Numerical Analysis and Computation Commons^™

On A Classification Of Goy/Sabra-Type Shell Models Of Turbulence, Austin Ho

Theses and Dissertations

Since their inception in the 1970s, shell models have proved to be a fruitful testbed for studying theories of turbulence. This thesis considers variations of two classical shell models: the Gledzer–Ohkitani–Yamada (GOY) model and the Sabra model. Up to conjugacy classes, we classify all possible GOY-type and Sabra-type models. We numerically approximate the scaling exponents for the newly identified models and develop their mathematical well-posedness.

Using Ai To Analyze Survey Data, Sara Martucci

Open Educational Resources

This assignment in Methodology in Sociology/Criminology engages students in the full research process by guiding them through variable selection, data analysis, interpretation, and critical reflection on AI-assisted decision-making. Using a class-generated survey dataset (or an existing dataset), students develop a research question, identify independent and dependent variables, and formulate a hypothesis. They then compare their selections with those suggested by an AI tool, analyzing differences in reasoning and variable choice. Through SPSS, students generate frequency tables, charts, and scatterplots to examine relationships between variables, including potential intervening factors. The assignment culminates in a group presentation and reflective analysis on the …

Project Title: Maximizing The Volume Of A Cardboard Box To Save Trees– An Application Of Polynomial Functions To Address Global Issues [Mathematics], Lucie Mingla

Open Educational Resources

MAT 115 College Algebra & Trigonometry/Precalculus

Project Title: Maximizing the Volume of a Cardboard Box to Save Trees– An Application of Polynomial Functions to Address Global Issues

Reflective Narrative:

This project was inspired by my participation in the "Designing and Implementation of STEM Co-Curricular Activities" CTL seminar in Spring 2023. I am grateful to Drs. Bukurie Gjoci, Daniel Gertner, Ingrid Veras, and Midas Tsai, along with fellow participants, for their invaluable feedback that helped shape its development. The project was implemented in two College Algebra and Trigonometry courses. I participated in two seminars to further develop this project. The Community …

New Algorithmic Support For The Fundamental Theorem Of Algebra, Vitaly Zaderman

Dissertations, Theses, and Capstone Projects

Univariate polynomial root-finding is a venerated subjects of Mathematics and Computational Mathematics studied for four millenia. In 1924 Herman Weyl published a seminal root-finder and called it an algorithmic proof of the Fundamental Theorem of Algebra. Steve Smale in 1981 and Arnold Schonhage in 1982 proposed to classify such algorithmic proofs in terms of their computational complexity. This prompted extensive research in 1980s and 1990s, culminated in a divide-and-conquer polynomial root-finder by Victor Pan at ACM STOC 1995, which used a near optimal number of bit-operations. The algorithm approximates all roots of a polynomial p almost as fast as one …

Hydrodynamic And Physicochemical Interactions Between An Active Janus Particle And An Inactive Particle, Jessica S. Rosenberg

Dissertations, Theses, and Capstone Projects

Active matter is an area of soft matter science in which units consume energy and turn it into autonomous motion. Groups of these units – whether flocks of birds, bacterial colonies, or even collections of synthetically-made active particles – may exhibit complex behavior on large scales. While the large-scale picture is of great importance, so is the microscopic scale. Studying the individual particles that make up active matter will allow us to understand how they move, and whether and under what circumstances their activity can be controlled.

Here we delve into the world of active matter by studying colloidal-sized (100 …

Towards Simulation Of Complex Ocean Flows: Analysis And Algorithm For Computation Of Coupled Partial Differential Equations, Wenbin Dong

Dissertations and Theses

The hybrid CFD models which usually consist of 2 sub-models, develop our capability to simulate many emerging problems with multiphysics and multiscale flows, especially for the coastal ocean flows interacted with local phenomena of interest. For most cases, the sub-models are connected with direct interpolation which is easy and workable. It becomes urgently needed to investigate the inner mechanism of such model integration as this simple method does not work well if the two sub-models are different in governing equations, numerical methods, and computational grids. Also, it can not treat complex flow structures as well as the balance in mass …

Dynamic Parameter Estimation From Partial Observations Of The Lorenz System, Eunice Ng

Theses and Dissertations

Recent numerical work of Carlson-Hudson-Larios leverages a nudging-based algorithm for data assimilation to asymptotically recover viscosity in the 2D Navier-Stokes equations as partial observations on the velocity are received continuously-in-time. This "on-the-fly" algorithm is studied both analytically and numerically for the Lorenz equations in this thesis.

The Exact Factorization Equations For One- And Two-Level Systems, Bart Rosenzweig

Theses and Dissertations

Exact Factorization is a framework for studying quantum many-body problems. This decomposes the wavefunctions of such systems into conditional and marginal components. We derive corresponding evolution equations for molecular systems whose conditional electronic subsystems are described by one or two Born-Oppenheimer levels and develop a program for their mathematical study.

Application Of Randomness In Finance, Jose Sanchez, Daanial Ahmad, Satyanand Singh

Publications and Research

Brownian Motion which is also considered to be a Wiener process and can be thought of as a random walk. In our project we had briefly discussed the fluctuations of financial indices and related it to Brownian Motion and the modeling of Stock prices.

Modeling And Analysis Of Affiliation Networks With Subsumption, Alexey Nikolaev

Dissertations, Theses, and Capstone Projects

An affiliation (or two-mode) network is an abstraction commonly used for representing systems with group interactions. It consists of a set of nodes and a set of their groupings called affiliations. We introduce the notion of affiliation network with subsumption, in which no affiliation can be a subset of another. A network with this property can be modeled by an abstract simplicial complex whose facets are the affiliations of the network.

We introduce a new model for generating affiliation networks with and without subsumption (represented as simplicial complexes and hypergraphs, respectively). In this model, at each iteration, a constant number …

Using Statistical Analysis To Examine Weather Variability In New York City, Ryan Chen, Yuhuang Wang, Jiehao Huang

Publications and Research

As the overall temperature of Earth continues to warm, atmospheric hazards (e.g. heatwaves, cyclones) may be driving increases in climatological trends. This study examines the daily precipitation and temperature record of the greater New York City region during the 1979-2014 period. Daily station observations from three greater New York City airports: John F. Kennedy (JFK), LaGuardia (LGA) and Newark (EWR), are used in this study. Climatological & statistical analyses are performed for the weather variability of New York City metro area to understand the impacts of climate change.The temperature climatology reveals a distinct seasonal cycle, while the precipitation climatology exhibits …

Matrix Low Rank Approximation At Sublinear Cost, Qi Luan

Dissertations, Theses, and Capstone Projects

A matrix algorithm runs at sublinear cost if the number of arithmetic operations involved is far fewer than the number of entries of the input matrix. Such algorithms are especially crucial for applications in the field of Big Data, where input matrices are so immense that one can only store a fraction of the entire matrix in memory of modern machines. Typically, such matrices admit Low Rank Approximation (LRA) that can be stored and processed at sublinear cost. Can we compute LRA at sublinear cost? Our counter example presented in Appendix C shows that no sublinear cost algorithm can compute …

Sensor Data Analysis In Smart Buildings, Manuel A. Mane Penton

Publications and Research

Data analysis and Machine Learning are destined to evolve the current technology infrastructure by solving technology and economy demands present mainly in developed cities like New York. This research proposes a machine learning (ML) based solution to alleviate one of the main issues that big buildings such as CUNY campuses have, that is the waste of energy resources. The analysis of data coming from the readings of different deployed sensors such as CO2, humidity and temperature can be used to estimate occupancy in a specific room and building in general. The outcome of this research established a relationship between the …

Determinism Of Stochastic Processes Through The Relationship Between The Heat Equation And Random Walks, Gurmehar Singh Makker

Publications and Research

We study the deterministic characteristics of stochastic processes through investigation of random walks and the heat equation. The relationship is confirmed by discretizing the heat equation in time and space and determining the probability distribution function for random walks in dimension d = 1, 2. The existence of the relationship is presented both through theoretical analysis and numerical computation.

Computational Methods In Civil Engineering, Nir Krakauer

Open Educational Resources

No abstract provided.

Fast Algorithms On Random Matrices And Structured Matrices, Liang Zhao

Dissertations, Theses, and Capstone Projects

Randomization of matrix computations has become a hot research area in the big data era. Sampling with randomly generated matrices has enabled fast algorithms to perform well for some most fundamental problems of numerical algebra with probability close to 1. The dissertation develops a set of algorithms with random and structured matrices for the following applications: 1) We prove that using random sparse and structured sampling enables rank-r approximation of the average input matrix having numerical rank r. 2) We prove that Gaussian elimination with no pivoting (GENP) is numerically safe for the average nonsingular and well-conditioned matrix preprocessed with …

Generalized Least-Powers Regressions I: Bivariate Regressions, Nataniel Greene

Publications and Research

The bivariate theory of generalized least-squares is extended here to least-powers. The bivariate generalized least-powers problem of order p seeks a line which minimizes the average generalized mean of the absolute pth power deviations between the data and the line. Least-squares regressions utilize second order moments of the data to construct the regression line whereas least-powers regressions use moments of order p to construct the line. The focus is on even values of p, since this case admits analytic solution methods for the regression coefficients. A numerical example shows generalized least-powers methods performing comparably to generalized least-squares methods, …

Generalized Least-Squares Regressions V: Multiple Variables, Nataniel Greene

Publications and Research

The multivariate theory of generalized least-squares is formulated here using the notion of generalized means. The multivariate generalized least-squares problem seeks an m dimensional hyperplane which minimizes the average generalized mean of the square deviations between the data and the hyperplane in m + 1 variables. The numerical examples presented suggest that a multivariate generalized least-squares method can be preferable to ordinary least-squares especially in situations where the data are ill- conditioned.

Generalized Least-Squares Regressions Iv: Theory And Classification Using Generalized Means, Nataniel Greene

Publications and Research

The theory of generalized least-squares is reformulated here using the notion of generalized means. The generalized least-squares problem seeks a line which minimizes the average generalized mean of the square deviations in x and y. The notion of a generalized mean is equivalent to the generating function concept of the previous papers but allows for a more robust understanding and has an already existing literature. Generalized means are applied to the task of constructing more examples, simplifying the theory, and further classifying generalized least-squares regressions.

Generalized Least-Squares Regressions Iii: Further Theory And Classification, Nataniel Greene

Publications and Research

This paper continues the work of this series with two results. The first is an exponential equivalence theorem which states that every generalized least-squares regression line can be generated by an equivalent exponential regression. It follows that every generalized least-squares line has an effective normalized exponential parameter between 0 and 1 which classifies the line on the spectrum between ordinary least-squares and the extremal line for a given set of data. The second result is the presentation of fundamental formulas for the generalized least-squares slope and y-intercept.

Stochastic Dea With A Perfect Object And Its Application To Analysis Of Environmental Efficiency, Alexander Vaninsky

Publications and Research

The paper introduces stochastic DEA with a Perfect Object (SDEA PO). The Perfect Object (PO) is a virtual Decision Making Unit (DMU) that has the smallest inputs and greatest outputs. Including the PO in a collection of actual objects yields an explicit formula of the efficiency index. Given the distributions of DEA inputs and outputs, this formula allows us to derive the probability distribution of the efficiency score, to find its mathematical expectation, and to deliver common (group–related) and partial (object-related) efficiency components. We apply this approach to a prospective analysis of environmental efficiency of the major national and regional …

Refining Environmental Satellite Data Using A Statistical Approach, Md Zahidur Rahman, Leonid Roytman, Abdelhamid Kadik

Publications and Research

The proposed approach in this article applies an efficient and novel statistical technique to accurately describe radiometric data measured by Advanced Very High Resolution Radiometers (AVHRR) onboard the National Oceanic and Atmospheric Administration’s (NOAA) Polar Orbiting Environmental Satellites (POES). The corrected data set will then be applied to improve the strength of NOAA Global Vegetation Index (GVI) data set for the 1982- 2003 period produced from AVHRR. The GVI is used extensively for studying and monitoring land surface, atmosphere and recently for analyzing climate and environmental changes. The POES AVHRR data, though useful, cannot be directly used in climate change …

Generalized Least-Squares Regressions Ii: Theory And Classification, Nataniel Greene

Publications and Research

In the first paper of this series, a variety of known and new symmetric and weighted least-squares regression methods were presented with efficient derivations. This paper continues and generalizes the previous work with a theory for deriving, analyzing, and classifying all symmetric and weighted least-squares regression methods.

Generalized Least-Squares Regressions I: Efficient Derivations, Nataniel Greene

Publications and Research

Ordinary least-squares regression suffers from a fundamental lack of symmetry: the regression line of y given x and the regression line of x given y are not inverses of each other. Alternative symmetric regression methods have been developed to address this concern, notably: orthogonal regression and geometric mean regression. This paper presents in detail a variety of least squares regression methods which may not have been known or fully explicated. The derivation of each method is made efficient through the use of Ehrenberg's formula for the ordinary least-squares error and through the extraction of a weight function g(b) which characterizes …

Multiresolution Inverse Wavelet Reconstruction From A Fourier Partial Sum, Nataniel Greene

Publications and Research

The Gibbs phenomenon refers to the lack of uniform convergence which occurs in many orthogonal basis approximations to piecewise smooth functions. This lack of uniform convergence manifests itself in spurious oscillations near the points of discontinuity and a low order of convergence away from the discontinuities.In previous work [11,12] we described a numerical procedure for overcoming the Gibbs phenomenon called the Inverse Wavelet Reconstruction method (IWR). The method takes the Fourier coefficients of an oscillatory partial sum and uses them to construct the wavelet coefficients of a non-oscillatory wavelet series. However, we only described the method standard wavelet series and …

Methods Of Assessing And Ranking Probable Sources Of Error, Nataniel Greene

Publications and Research

A classical method for ranking n potential events as sources of error is Bayes' theorem. However, a ranking based on Bayes' theorem lacks a fundamental symmetry: the ranking in terms of blame for error will not be the reverse of the ranking in terms of credit for lack of error. While this is not a flaw in Bayes' theorem, it does lead one to inquire whether there are related methods which have such symmetry. Related methods explored here include the logical version of Bayes' theorem based on probabilities of conditionals, probabilities of biconditionals, and ratios or differences of credit to …

A Wavelet-Based Method For Overcoming The Gibbs Phenomenon, Nataniel Greene

Publications and Research

The Gibbs phenomenon refers to the lack of uniform convergence which occurs in many orthogonal basis approximations to piecewise smooth functions. This lack of uniform convergence manifests itself in spurious oscillations near the points of discontinuity and a low order of convergence away from the discontinuities. Here we describe a numerical procedure for overcoming the Gibbs phenomenon called the inverse wavelet reconstruction method. The method takes the Fourier coefficients of an oscillatory partial sum and uses them to construct the wavelet coefficients of a non-oscillatory wavelet series.

An Overview Of Conditionals And Biconditionals In Probability, Nataniel Greene

Publications and Research

Conditional and biconditional statements are a standard part of symbolic logic but they have only recently begun to be explored in probability for applications in artificial intelligence. Here we give a brief overview of the major theorems involved and illustrate them using two standard model problems from conditional probability.

Fourier Series Of Orthogonal Polynomials, Nataniel Greene

Publications and Research

Explicit formulas for the Fourier coefficients of the Legendre polynomials can be found in the Bateman Manuscript Project. However, similar formulas for more general classes of orthogonal polynomials do not appear to have been worked out. Here we derive explicit formulas for the Fourier series of Gegenbauer, Jacobi, Laguerre and Hermite polynomials.

Formulas For The Fourier Series Of Orthogonal Polynomials In Terms Of Special Functions, Nataniel Greene

Publications and Research

An explicit formula for the Fourier coefficient of the Legendre polynomials can be found in the Bateman Manuscript Project. However, formulas for more general classes of orthogonal polynomials do not appear to have been worked out. Here we derive explicit formulas for the Fourier series of Gegenbauer, Jacobi, Laguerre and Hermite polynomials. The methods described here apply in principle to a class of polynomials, including non-orthogonal polynomials.