The variable projection method has been developed as a powerful tool for solvingseparable nonlinear least squares problems. It has proven effective in cases where
the underlying model consists of a linear combination of nonlinear functions, such as
exponential functions. In this thesis,…
The variable projection method has been developed as a powerful tool for solvingseparable nonlinear least squares problems. It has proven effective in cases where
the underlying model consists of a linear combination of nonlinear functions, such as
exponential functions. In this thesis, a modified version of the variable projection
method to address a challenging semi-blind deconvolution problem involving mixed
Gaussian kernels is employed. The aim is to recover the original signal accurately
while estimating the mixed Gaussian kernel utilized during the convolution process.
The numerical results obtained through the implementation of the proposed algo-
rithm are presented. These results highlight the method’s ability to approximate the
true signal successfully. However, accurately estimating the mixed Gaussian kernel
remains a challenging task. The implementation details, specifically focusing on con-
structing a simplified Jacobian for the Gauss-Newton method, are explored. This
contribution enhances the understanding and practicality of the approach.
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
This project is a synthesis of the author's learning over the semesters in working with the CFD Group at Arizona State University. The incompressible Navier-Stokes equations are overviewed, starting with the derivation from the continuity equation, then non-dimensionalization, methods of…
This project is a synthesis of the author's learning over the semesters in working with the CFD Group at Arizona State University. The incompressible Navier-Stokes equations are overviewed, starting with the derivation from the continuity equation, then non-dimensionalization, methods of solving and computing quantities of interest. The rest of this document is expository analysis of solutions in a confined fluid flow, building toward a parametrically forced regime that generates complex flow patterns including Faraday waves. The solutions come from recently published studies Dynamics in a stably stratified tilted square cavity (Grayer et al.) and Parametric instabilities of a stratified shear layer (Buchta et al).
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
This thesis project focuses on algorithms that generate good sampling points for function approximation. In one dimension, polynomial interpolation using equispaced points is unstable, with high Oscillations near the endpoints of the interpolated interval. On the other hand, Chebyshev…
This thesis project focuses on algorithms that generate good sampling points for function approximation. In one dimension, polynomial interpolation using equispaced points is unstable, with high Oscillations near the endpoints of the interpolated interval. On the other hand, Chebyshev nodes provide both stable and highly accurate points for polynomial interpolation. In higher dimensions, optimal sampling points are unknown. This project addresses this problem by finding algorithms that are robust in various domains for polynomial interpolation and least-squares. To measure the quality of the nodes produced by said algorithms, the Lebesgue constant will be used. In the algorithms, a number of numerical techniques will be used, such as the Gram-Schmidt process and the pivoted-QR process. In addition, concepts such as node density and greedy algorithms will be explored.
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
With the coming advances of computational power, algorithmic trading has become one of the primary strategies to trading on the stock market. To understand why and how these strategies have been effective, this project has taken a look at the…
With the coming advances of computational power, algorithmic trading has become one of the primary strategies to trading on the stock market. To understand why and how these strategies have been effective, this project has taken a look at the complete process of creating tools and applications to analyze and predict stock prices in order to perform low-frequency trading. The project is composed of three main components. The first component is integrating several public resources to acquire and process financial trading data and store it in order to complete the other components. Alpha Vantage API, a free open source application, provides an accurate and comprehensive dataset of features for each stock ticker requested. The second component is researching, prototyping, and implementing various trading algorithms in code. We began by focusing on the Mean Reversion algorithm as a proof of concept algorithm to develop meaningful trading strategies and identify patterns within our datasets. To augment our market prediction power (“alpha”), we implemented a Long Short-Term Memory recurrent neural network. Neural Networks are an incredibly effective but often complex tool used frequently in data science when traditional methods are found lacking. Following the implementation, the last component is to optimize, analyze, compare, and contrast all of the algorithms and identify key features to conclude the overall effectiveness of each algorithm. We were able to identify conclusively which aspects of each algorithm provided better alpha and create an entire pipeline to automate this process for live trading implementation. An additional reason for automation is to provide an educational framework such that any who may be interested in quantitative finance in the future can leverage this project to gain further insight.
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
A comparison of the performance of CUDA versus OpenMP for Jacobi, Gauss-Seidel, and S.O.R. iterative methods for Laplace's Equation with Dirichlet boundary conditions is presented. Both the number of cores and the grid size were varied for the OpenMP program,…
A comparison of the performance of CUDA versus OpenMP for Jacobi, Gauss-Seidel, and S.O.R. iterative methods for Laplace's Equation with Dirichlet boundary conditions is presented. Both the number of cores and the grid size were varied for the OpenMP program, while the grid size was varied for the CUDA program. CUDA outperforms the 8-core OpenMP program with the Jacobi and Gauss-Seidel schemes for all grid sizes, and is competitive with S.O.R for all grid sizes examined.
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
We study an idealized model of a wind-driven ocean, namely a 2-D lid-driven cavity with a linear temperature gradient along the side walls and constant hot and cold temperatures on the top and bottom boundaries respectively. In particular, we determine…
We study an idealized model of a wind-driven ocean, namely a 2-D lid-driven cavity with a linear temperature gradient along the side walls and constant hot and cold temperatures on the top and bottom boundaries respectively. In particular, we determine numerically the response on flow field and temperature stratification associated with the velocity of the lid driven by harmonic forcing using the Navier-Stokes equations with Boussinesq approximation in an attempt to gain an understanding of how variations of external forces (such as the wind over the ocean) transfer energy to a system by exciting internal modes through resonances. The time variation of the forcing, accounting for turbulence at the boundary is critical for allowing penetration of energy waves through the stratified medium in which the angles of the internal waves depend on these perturbation frequencies. Determining the results of the interaction of two 45 degree angle wave beams at the center of the cavity is of particular interest.
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)
Functional magnetic resonance imaging (fMRI) is one of the popular tools to study human brain functions. High-quality experimental designs are crucial to the success of fMRI experiments as they allow the collection of informative data for making precise and valid…
Functional magnetic resonance imaging (fMRI) is one of the popular tools to study human brain functions. High-quality experimental designs are crucial to the success of fMRI experiments as they allow the collection of informative data for making precise and valid inference with minimum cost. The primary goal of this study is on identifying the best sequence of mental stimuli (i.e. fMRI design) with respect to some statistically meaningful optimality criteria. This work focuses on two related topics in this research field. The first topic is on finding optimal designs for fMRI when the design matrix is uncertain. This challenging design issue occurs in many modern fMRI experiments, in which the design matrix of the statistical model depends on both the selected design and the experimental subject's uncertain behavior during the experiment. As a result, the design matrix cannot be fully determined at the design stage that makes it difficult to select a good design. For the commonly used linear model with autoregressive errors, this study proposes a very efficient approach for obtaining high-quality fMRI designs for such experiments. The proposed approach is built upon an analytical result, and an efficient computer algorithm. It is shown through case studies that our proposed approach can outperform the existing method in terms of computing time, and the quality of the obtained designs. The second topic of the research is to find optimal designs for fMRI when a wavelet-based technique is considered in the fMRI data analysis. An efficient computer algorithm to search for optimal fMRI designs for such cases is developed. This algorithm is inspired by simulated annealing and a recently proposed algorithm by Saleh et al. (2017). As demonstrated in the case studies, the proposed approach makes it possible to efficiently obtain high-quality designs for fMRI studies, and is practically useful.
Date Created
The date the item was original created (prior to any relationship with the ASU Digital Repositories.)