Applied Mathematics Commons^™

Solution Of Preconditioned Nonsymmetric Saddle Point Systems Through Modified Conjugate Gradient Iteration, Samson Ayo

Dissertations

In this dissertation, we present an iterative method (Preconditioned Nonsymmetric Saddle Point Conjugate Gradient) for simultaneously solving forward ($A{\bf x}={\bf b}$) and adjoint ($A^T{\bf y}={\bf g}$) linear systems. Our approach involves constructing an augmented nonsymmetric saddle point matrix that has a real positive spectrum and developing a conjugate gradient-like iteration for this matrix. We investigate the use of Schur Complement preconditioners with block-diagonal factorization computed by an incomplete QR factorization of $A$ to speed up the convergence of our method and compare the results to the preconditioned generalized least squares residual (GLSQR) and quasi-minimal residual (QMR) methods. We develop quadrature …

The Numerical Method For Finding All The Zeros Of A Function F (X) On An Interval [A,B], Franissa Simon

Honors Theses

In this study, we develop a simple mathematical method for finding all the roots of a function on a specified interval. Existing classical numerical methods, including the Bisection Method, Secant Method, and Newton Method, cannot find all the zeros of a function f (x) on an interval [a,b]. Popular numerical root solvers like Matlab’s ‘fzero’, Maple’s ‘fsolve’, and SageMath’s ‘find_root’ typically yield only a single zero. This thesis explores a proposed interval computation bisection method, a systematic approach based on the traditional Bisection Method and interval computation. Unlike traditional bisection, which relies on the intermediate value theorem, this approach uses …

Sliding Window Method For Simulating Action Potentials In Axons, Hayden Reed

Honors Theses

ABSTRACT Hodgkin and Huxley’s nonlinear partial differential equations model the excitation and propagation of action potentials in neurons, and there have been numerous attempts at finding the best numerical solution method. This thesis proposes a novel approach to solving these equations: the Sliding Window method, in which a fixed sub-interval is found through capturing the signal’s head and tail. The system is then solved on the sub-interval instead of the entire interval. Using the Sliding Window technique also involves implementing the backward and forward Euler methods and the finite difference method. It will be demonstrated that, in utilizing the Sliding …

A Spectroscopic Survey Of Atmospheres Of Super-Earths, Luke Brust

Honors Theses

Recent research has made it possible to use spectroscopy to analyze the composition of the atmospheres of exoplanets, planets that orbit other stars. Most projects thus far have focused on the atmospheres of gas giants, as it is less challenging to observe them with available equipment. This project studies the atmospheres of four Super- Earths, planets that have a mass greater than the Earth but smaller than Neptune. This is accomplished by processing the raw spectroscopic data from the Hubble Space Telescope and modeling the atmosphere using the program 𝝉-Rex3. This survey found clear results from two of the selected …

Globally Adaptive Exponential Integrators For Stiff Systems Of Odes, Anzhelika Vasilyeva

Honors Theses

This thesis introduces a novel method for solving systems of Ordinary Differential Equations (ODEs) resulting from the spatial discretization of Partial Differential Equations (PDEs). The proposed approach builds upon an existing technique that employs Krylov projection, which requires evaluating a matrix function at each timestep. The innovation of the new method lies in its reuse strategy, which shifts the perspective from direct matrix function evaluation to polynomial interpolation. Numerical experiments conducted on constant and variable coefficient heat equations, with both smooth and discontinuous initial data, demonstrate the computational time advantage of the new approach. The results indicate that this method …

Delta-Shaped Approximation Based Homotopy Analysis Method For Nonlinear Poisson-Type Partial Differential Equations, Cyril Ocloo

Dissertations

This research aims to solve nonlinear Poisson-type partial differential equations (PDEs) by the approach of the homotopy analysis method (HAM) incorporated with approximate particular solutions (APS) using Delta-shaped basis (DSB) approximations.

With the inclusion of the h auxiliary parameters, we tackle nonlinear problems by studying the mathematical characteristics of the h curve. This is to ensure the numerical convergence of the HAM.

In the solution process, we use the homotopy analysis method to convert a nonlinear PDE into linear inhomogeneous PDEs, which are solved using the method of approximate particular solutions with DSB.

A proper value of the h is …

Localized Hermite Method Of Approximate Particular Solutions, Kwesi Acheampong

Dissertations

A localized Hermite method of approximate particular solutions (LHMAPS) is presented in this dissertation. This method is designed to improve the accuracy of the localized method of approximate particular solutions (LMAPS) for solving partial differential equations. LMAPS is a strong-form method that defines local radial basis function approximations to the solution values at a group of collocation points before applying the differential operator to this approximation function. Based on the LMAPS's local scheme, LHMAPS seeks Hermite-type local approximations based on both function values and derivatives. Numerical experiments validate the superior accuracy of the proposed method to the LMAPS by solving …

Scalable Solution Of Time-Dependent Pdes Through Component-Wise Exponential Integrator, Chelsea Drum

Dissertations

Exponential integrators, such as exponential Runge-Kutta or Rosenbrock methods, are designed specifically for the time integration of stiff systems of ordinary differential equations (ODEs) and allow the use of larger time steps than other general-purpose ODE solvers. However, these methods rely on computing matrix function-vector products that are traditionally computed using a Krylov projection, such as Lanczos or Arnoldi iteration, that involves substantial computational expense at high spatial resolution. Krylov Subspace Spectral (KSS) methods' frequency-dependent approach, designed to circumvent stiffness in linear problems, computes these products with greater scalability. We propose the combination of such KSS methods with exponential integrators …

Cost-Risk Analysis Of The Ercot Region Using Modern Portfolio Theory, Megan Sickinger

Master's Theses

In this work, we study the use of modern portfolio theory in a cost-risk analysis of the Electric Reliability Council of Texas (ERCOT). Based upon the risk-return concepts of modern portfolio theory, we develop an n-asset minimization problem to create a risk-cost frontier of portfolios of technologies within the ERCOT electricity region. The levelized cost of electricity for each technology in the region is a step in evaluating the expected cost of the portfolio, and the historical data of cost factors estimate the variance of cost for each technology. In addition, there are several constraints in our minimization problem to …

A Tale Of Two Diagonalizations: Methods To Diagonalize A 1-D Piecewise Constant Indefinite Schrödinger Operator, Sarah Wright

Dissertations

We present two numerical methods for computing the solution of a partial differential equation (PDE) for modeling acoustic pressure, known as an extra-wide angle parabolic equation, that features the square root of a differential operator. The differential operator is the negative of an indefinite Schrödinger operator with a piecewise constant potential. This work primarily deals with the 3-piece case; however, a generalization is made to the case of an arbitrary number of pieces. In the first method, the Rayleigh-Secant Method, through restriction to a judiciously chosen lower-dimensional subspace, approximate eigenfunctions are used to obtain estimates for the eigenvalues of the …

Solving The Cable Equation, A Second-Order Time Dependent Pde For Non-Ideal Cables With Action Potentials In The Mammalian Brain Using Kss Methods, Nirmohi Charbe

Master's Theses

In this thesis we shall perform the comparisons of a Krylov Subspace Spectral method with Forward Euler, Backward Euler and Crank-Nicolson to solve the Cable Equation. The Cable Equation measures action potentials in axons in a mammalian brain treated as an ideal cable in the first part of the study. We shall subject this problem to the further assumption of a non-ideal cable. Assume a non-uniform cross section area along the longitudinal axis. At the present time, the effects of torsion, curvature and material capacitance are ignored. There is particular interest to generalize the application of the PDEs including and …

Spectral Multistep Methods For The Scalable Simulation Of Time-Dependent Phenomena, Bailey Rester

Dissertations

Krylov subspace spectral (KSS) methods are high-order accurate, one-step explicit time-stepping methods for partial differential equations (PDEs) that also possess stability characteristic of implicit methods. Unlike other time-stepping approaches, KSS methods compute each Fourier coefficient of the solution from an individualized approximation of the solution operator of the PDE, using techniques developed by Golub and Meurant for approximating bilinear forms involving matrix functions. As a result, KSS methods scale effectively to higher spatial resolution.

This dissertation will present spectral multistep methods, explicit and implicit, designed through the combination of KSS methods and Adams methods. This combination allows spectral multistep methods …

Training Rbf Neural Networks For The Solution Of Elliptic Boundary Value Problems, Andreas Karageorghis, C.S. Chen

Faculty Publications

We propose a radial basis function (RBF) neural network method for solving two- and three–dimensional second and fourth order elliptic boundary value problems (BVPs). The neural network in question is trained by minimizing a nonlinear least squares functional, thus determining the optimal values of the various RBF parameters involved. The functional minimization is carried out using standard MATLAB® software efficiently. Several numerical experiments are presented to demonstrate the efficacy of the proposed method.

Analysis Of Covid-19 And Vaccine Administration In Mississippi, Megan Sickinger

Honors Theses

In this work, we develop a simple mathematical model to observe the spread of COVID-19 and vaccine administration in Mississippi. Based on the well-known Kermack-McKendrick Susceptible-Infected-Removed epidemiological model, the ASIRD−V model has eight ordinary differential equations that split infected populations and recovered populations into vaccinated and unvaccinated populations. After determining that the system is reliable for real-world applications, we investigate and determine the stability and equilibrium points of this system. The system is found to be disease-free when R0 < 1 and endemic when R0 > 1. We use MATLAB to numerically solve the system and optimize the model’s parameters over four short periods, two with the …

Fine-Tuning A 𝑘-Nearest Neighbors Machine Learning Model For The Detection Of Insurance Fraud, Alliyah Stout

Honors Theses

Billions of dollars are lost within insurance companies due to fraud. Large money losses force insurance companies to increase premium costs and/or restrict policies. This negatively affects a company’s loyal customers. Although this is a prevalent problem, companies are not urgently working toward bettering their machine learning algorithms. Underskilled workers paired with inefficient computer algorithms make it difficult to accurately and reliably detect fraud.

The goal of this study is to understand the idea of -Nearest Neighbors ( -NN) and to use this classification technique to accurately detect fraudulent auto insurance claims. Using -NN requires choosing a value and a …

Large Scale Disease Modeling, Walker Mattox

Master's Theses

In this we study large scale disease modeling. After understanding the mechanics behind the SIR disease model in an ODE sense, we will apply this knowledge to model disease spread in more and more increasing advanced cellular automata. Eventually, some of our cellular automata will include long distance travel. From this discrete data, we can then build an SIR model in the PDE sense to display large scale disease spread.

Multi-Valued Solutions For The Equation Of Motion, Darcy-Jordan Model, As A Cauchy Problem: A Shocking Event, Chandler Shimp

Master's Theses

Shocks are physical phenomenon that occur quite often around us. In this thesis we examine the occurrence of shocks in finite amplitude acoustic waves from a numerical perspective. These waves, or jump discontinuities, yield ill-behaved solutions when solved numerically. This study takes on the challenge of finding both single- and multi-valued solutions.

The previously unsolved problem in this study is the representation of the Equation of Motion (EoM) in the form of the Darcy-Jordan model (DJM) and expressed as a dimensionless IVP Cauchy problem. Prior attempts to solve have resulted only in implicit solutions or explicit solutions with certain initial …

Ensemble Data Fitting For Bathymetric Models Informed By Nominal Data, Samantha Zambo

Dissertations

Due to the difficulty and expense of collecting bathymetric data, modeling is the primary tool to produce detailed maps of the ocean floor. Current modeling practices typically utilize only one interpolator; the industry standard is splines-in-tension.

In this dissertation we introduce a new nominal-informed ensemble interpolator designed to improve modeling accuracy in regions of sparse data. The method is guided by a priori domain knowledge provided by artificially intelligent classifiers. We recast such geomorphological classifications, such as ‘seamount’ or ‘ridge’, as nominal data which we utilize as foundational shapes in an expanded ordinary least squares regression-based algorithm. To our knowledge …

On A Stochastic Model Of Epidemics, Rachel Prather

Master's Theses

This thesis examines a stochastic model of epidemics initially proposed and studied by Norman T.J. Bailey [1]. We discuss some issues with Bailey's stochastic model and argue that it may not be a viable theoretical platform for a more general epidemic model. A possible alternative approach to the solution of Bailey's stochastic model and stochastic modeling is proposed as well. Regrettably, any further study on those proposals will have to be discussed elsewhere due to a time constraint.

A Modified Preconditioned Conjugate Gradient Method For Approximating The Scattering Amplitude, Samson Ayo

Master's Theses

In this thesis, we look at an iterative method for approximating the scattering amplitude that involves solving two linear systems: a forward system Ax=b and an adjoint system A^Ty=g. Once these two systems are solved, the scattering amplitude, defined by g^Tx=y^Tb is easily obtained.

We derive a conjugate gradient-like iteration for a nonsymmetric saddle point matrix that is constructed to have a real positive spectrum. We investigate the use of Schur Complement preconditioners with block-diagonal factorization to speed up the convergence of our method and compare …

A Component-Wise Approach To Smooth Extension Embedding Methods, Vivian Montiforte

Dissertations

Krylov Subspace Spectral (KSS) Methods have demonstrated to be highly scalable methods for PDEs. However, a current limitation of these methods is the requirement of a rectangular or box-shaped domain. Smooth Extension Embedding Methods (SEEM) use fictitious domain methods to extend a general domain to a simple, rectangular or box-shaped domain. This dissertation describes how these methods can be combined to extend the applicability of KSS methods, while also providing a component-wise approach for solving the systems of equations produced with SEEM.

Efficient Denoising Of High Resolution Color Digital Images Utilizing Krylov Subspace Spectral Methods, Eva Lynn Greenman

Dissertations

The solution to a parabolic nonlinear diffusion equation using a Krylov Subspace Spectral method is applied to high resolution color digital images with parallel processing for efficient denoising. The evolution of digital image technology, processing power, and numerical methods must evolve to increase efficiency in order to meet current usage requirements. Much work has been done to perfect the edge detector in Perona-Malik equation variants, while minimizing the effects of artifacts. It is demonstrated that this implementation of a regularized partial differential equation model controls backward diffusion, achieves strong denoising, and minimizes blurring and other ancillary effects. By adaptively tuning …

Stability Analysis Of Krylov Subspace Spectral Methods For The 1-D Wave Equation In Inhomogeneous Media, Bailey Rester

Master's Theses

Krylov subspace spectral (KSS) methods are high-order accurate, explicit time-stepping methods for partial differential equations (PDEs) that also possess the stability characteristic of implicit methods. Unlike other time-stepping approaches, KSS methods compute each Fourier coefficient of the solution from an individualized approximation of the solution operator of the PDE. As a result, KSS methods scale effectively to higher spatial resolution. This thesis will present a stability analysis of a first-order KSS method applied to the wave equation in inhomogeneous media.

Rapid Implicit Diagonalization Of Variable-Coefficient Differential Operators Using The Uncertainty Principle, Carley Walker

Master's Theses

We propose to create a new numerical method for a class of time-dependent PDEs (second-order, one space dimension, Dirichlet boundary conditions) that can be used to obtain more accurate and reliable solutions than traditional methods. Previously, it was shown that conventional time-stepping methods could be avoided for time-dependent mathematical models featuring a finite number of homogeneous materials, thus assuming general piecewise constant coefficients. This proposed method will avoid the modeling shortcuts that are traditionally taken, and it will generalize the piecewise constant case of energy diffusion and wave propagation to work for an infinite number of smaller pieces, or a …

Diagonalization Of 1-D Schrodinger Operators With Piecewise Constant Potentials, Sarah Wright

Master's Theses

In today's world our lives are very layered. My research is meant to adapt current inefficient numerical methods to more accurately model the complex situations we encounter. This project focuses on a specific equation that is used to model sound speed in the ocean. As depth increases, the sound speed changes. This means the variable related to the sound speed is not constant. We will modify this variable so that it is piecewise constant. The specific operator in this equation also makes current time-stepping methods not practical. The method used here will apply an eigenfunction expansion technique used in previous …

Variable Compact Multi-Point Upscaling Schemes For Anisotropic Diffusion Problems In Three-Dimensions, James Quinlan

Dissertations

Simulation is a useful tool to mitigate risk and uncertainty in subsurface flow models that contain geometrically complex features and in which the permeability field is highly heterogeneous. However, due to the level of detail in the underlying geocellular description, an upscaling procedure is needed to generate a coarsened model that is computationally feasible to perform simulations. These procedures require additional attention when coefficients in the system exhibit full-tensor anisotropy due to heterogeneity or not aligned with the computational grid. In this thesis, we generalize a multi-point finite volume scheme in several ways and benchmark it against the industry-standard routines. …

An Adaptive Approach To Gibbs’ Phenomenon, Jannatul Ferdous Chhoa

Master's Theses

Gibbs’ Phenomenon, an unusual behavior of functions with sharp jumps, is encountered while applying the Fourier Transform on them. The resulting reconstructions have high frequency oscillations near the jumps making the reconstructions far from being accurate. To get rid of the unwanted oscillations, we used the Lanczos sigma factor to adjust the Fourier series and we came across three cases. Out of the three, two of them failed to give us the right reconstructions because either it was removing the oscillations partially but not entirely or it was completely removing them but smoothing out the jumps a little too much. …

Using Modern Portfolio Theory To Analyze Virgil's Aeneid (Or Any Other Poem), David Patterson

Master's Theses

This paper demonstrates that it is possible to use mathematics to study literature as it has been used to study the social sciences. By focusing on mathematically defining economic and literary terms, it can be shown that the underlying mathematical structure behind key concepts in economics and literature are analogous. This opens the possibility of applying economic models in literature. Specifically, it is demonstrated that the economic mathematical model of modern portfolio theory can answer long standing questions around the Roman epic Aeneid by Virgil. The poet died before completing his poem. The relative completeness of the books of the …

Homotopy Analysis Method For Nonlinear Ordinary Eigenvalue Problems, Subagya Perera

Master's Theses

In this thesis, we solve nonlinear differential equations by the homotopy analysis method (HAM), which is a semi-analytic method first introduced by Shijun Liao in 1992. The modified HAM can be viewed as a more generalized method that encloses many perturbation and non-perturbation methods. It is different from perturbation or other analytical methods in that it allows considerable freedomformanyvariables. Using the modified HAM, especially zero-order and higher-order deformation equations, we solve a nonlinear initial value problem and a nonlinear eigenvalue problem. We adjust the convergence region of a solution by modifying auxiliary parameter values. The results converge in very few …

A Time Integration Method Of Approximate Particular Solutions For Nonlinear Ordinary Differential Equations, Cyril Ocloo

Master's Theses

We consider a time-dependent method which is coupled with the method of approximate particular solutions (MAPS) of Delta-shaped basis functions and the method of fundamental solutions (MFS) to solve nonlinear ordinary differential equations. Firstly, we convert a nonlinear problem into a sequence of time-dependent non-homogeneous boundary value problems through a fictitious time integration method. The superposition principle is applied to split the numerical solution at each time step into an approximate particular solution and a homogeneous solution. Delta-shaped basis functions are used to provide an approximation of the source function at each time step. The purpose of this is to …