Numerical Analysis and Computation Commons^™

A Computational Study Of Taylor Approximation, Sihui Wei

SACAD: Scholarly Activities

This project investigates the accuracy of Taylor approximation using computational methods. Taylor polynomials of degree 1, 3, and 5 were applied to the functions e^x, sin x, and ln⁡(1+x), all centered at x=0.

Using C++, we generated both numerical data and graphical visualizations to analyze the absolute error∣f(x)−Tn(x)∣. The results show that higher-degree polynomials provide better approximation near the expansion point, while the error increases as the distance from the center grows.

In addition, the study reveals that the effectiveness of Taylor approximation depends not only on the polynomial degree but also on the structure of the function. In particular, …

Stabilized Weak-Gradient Discontinuous Finite Elements With Optimal Error Estimates For Second-Order Elliptic Pdes, Aymen Laadhari

Mathematical Modelling and Numerical Simulation with Applications

This work introduces an accurate finite element approach employing a new stabilized discrete weak gradient, designed for second-order elliptic problems on arbitrary conforming meshes. We formulate the approach within a discontinuous Galerkin framework and derive a consistent and coercive bilinear form. Appropriate error analysis on a model problem confirms optimal convergence. Building on the core analysis, we extend the method to more challenging settings, including time-dependent heterogeneous scenarios and a biophysically realistic optimal-control model of photobleaching in the budding yeast cell. We further illustrate the versatility of the weak-gradient construction by applying it to an unsteady level-set equation relevant to …

Modified Equations Of Conformal Symplectic Exponential Time Differencing Methods, Taylore M. Keesler

Honors Undergraduate Theses

Planetary orbits, pendulums, and hurricanes are everyday examples of nonlinear systems, often studied using differential equations. However, their exact solutions can not always be computed, and thus, we use numerical methods to approximate their solutions. Certain methods are better suited to preserve special properties of the system like energy and geometry. Through previous numerical simulations, a conformal symplectic method proves more effective in this preservation. To understand why, we find the modified equation of a nonlinear system with damping, which is a differential equation for which the numerical solution is exact. Through backward error analysis, we obtain these modified equations, …

Modeling And Numerical Analysis Of The Cholesteric Landau-De Gennes Model, Andrew L. Hicks

LSU Doctoral Dissertations

This thesis gives an analysis of modeling and numerical issues in the Landau-de Gennes (LdG) model of nematic liquid crystals (LCs) with cholesteric effects. We derive various time-step restrictions for a (weighted) $L^2$ gradient flow scheme to be energy decreasing. Furthermore, we prove a mesh size restriction, for finite element discretizations, that is critical to avoid spurious numerical artifacts in discrete minimizers that is not well-known in the LC literature, particularly when simulating cholesteric LCs that exhibit ``twist''. Furthermore, we perform a computational exploration of the model and present several numerical simulations in 3-D, on both slab geometries and spherical …

Les-C Turbulence Models And Fluid Flow Modeling: Analysis And Application To Incompressible Turbulence And Fluid-Fluid Interaction, Kyle J. Schwiebert

Dissertations, Master's Theses and Master's Reports

In the first chapter of this dissertation, we give some background on the Navier-Stokes equations and turbulence modeling. The next two chapters in this dissertation focus on two important numerical difficulties arising in fluid flow modeling: poor mass-conservation and nonphysical oscillations. We investigate two different formulations of the Crank-Nicolson method for the Navier-Stokes equations. The most attractive implementation, second order accurate for both velocity and pressure, is shown to introduce non-physical oscillations. We then propose two options which are shown to avoid the poor behavior. Next, we show that grad-div stabilization, previously assumed to have no effect on the target …

Mathematical Modeling Of Egain Droplets Sliding Down An Inclined Plane, Shawn Koohy, Kathryn Massey, Luis Schneegans, Megan Vezzetti, Keith Hillaire, Souradip Chattopadhyay, Jessie Chen, Carmen Lee, Karen Daniels

Undergraduate Research Symposium

Eutectic Gallium-Indium (EGaIn) is a room-temperature liquid metal alloy that dramatically changes its surface tension and dynamics under an applied electric field. EGaIn has been used heavily in soft electronics engineering due to its high conductivity, malleability, and safety. However, the absence of mathematical modeling in the current literature makes its behavior difficult to understand and predict. In this study, we present a one-dimensional lubrication model for the dynamics of an EGaIn droplet moving along an inclined plane. Our model incorporates essential physical effects and parameters including oxidation, capillary action, diffusion, gravity, and Marangoni effects. In particular, we incorporate effects …

Numerical Study Of The Seiqr Model For Covid-19, Caitlin Holt

Departmental Honors & Graduate Capstone Projects

In this research project, we used numerical methods to investigate trends in the susceptible, exposed, infectious, quarantined, recovered, closed cases and insusceptible populations for the COVID-19 pandemic in 2021. We used the SEIQR model containing seven ordinary differential equations, based on the SIR model for epidemics. An analytical solution was derived from a simplified version of the model, created by making various assumptions about the original model. Numerical solutions were generated for the first 100 days of 2021 using algorithms based on Euler's Method, Runge-Kutta Method, and Multistep Methods. Our goal is to show that numerical methods can help us …

Numerical Analysis And Gravity, Tyler D. Knowles

Graduate Theses, Dissertations, and Problem Reports (ETD)

In this dissertation we apply techniques of numerical analysis to current questions related to understanding gravity. The first question is that of sources of gravitational waves: how can we accurately determine the intrinsic physical parameters of a binary system whose late inspiral and merger was detected by the Laser Interferometer Gravitational-Wave Observatory. In particular, state-of-the-art algorithms for producing theoretical waveforms are as many as three orders of magnitude too slow for timely analysis. We show that direct software optimization produces a two order of magnitude speedup. We also describe documentation efforts undertaken so that the software may be rewritten to …

Algorithms To Approximate Solutions Of Poisson's Equation In Three Dimensions, Ray Dambrose

Rose-Hulman Undergraduate Mathematics Journal

The focus of this research was to develop numerical algorithms to approximate solutions of Poisson's equation in three dimensional rectangular prism domains. Numerical analysis of partial differential equations is vital to understanding and modeling these complex problems. Poisson's equation can be approximated with a finite difference approximation. A system of equations can be formed that gives solutions at internal points of the domain. A computer program was developed to solve this system with inputs such as boundary conditions and a nonhomogenous source function. Approximate solutions are compared with exact solutions to prove their accuracy. The program is tested with an …

Filtered Subspace Iteration For Selfadjoint Operators, Jay Gopalakrishnan, Luka Grubišić, Jeffrey S. Ovall

Portland Institute for Computational Science Publications

We consider the problem of computing a cluster of eigenvalues (and its associated eigenspace) of a (possibly unbounded) selfadjoint operator in a Hilbert space. A rational function of the operator is constructed such that the eigenspace of interest is its dominant eigenspace, and a subspace iteration procedure is used to approximate this eigenspace. The computed space is then used to obtain approximations of the eigenvalues of interest. An eigenvalue and eigenspace convergence analysis that considers both iteration error and dis- cretization error is provided. A realization of the proposed approach for a model second-order elliptic operator is based on a …

Computational Algorithms For Improved Representation Of The Model Error Covariance In Weak-Constraint 4d-Var, Jeremy A. Shaw

Dissertations and Theses

Four-dimensional variational data assimilation (4D-Var) provides an estimate to the state of a dynamical system through the minimization of a cost functional that measures the distance to a prior state (background) estimate and observations over a time window. The analysis fit to each information input component is determined by the specification of the error covariance matrices in the data assimilation system (DAS). Weak-constraint 4D-Var (w4D-Var) provides a theoretical framework to account for modeling errors in the analysis scheme. In addition to the specification of the background error covariance matrix, the w4D-Var formulation requires information on the model error statistics and …

A Numerical Study Of Construction Of Honey Bee Comb, Pamela Guerrero, Pamela C. Guerrero

Murray State Theses and Dissertations

We use finite difference methods in the treatment of an existing system of partial differential equations that captures the dynamics of parallel honeycomb construction in a bee hive. We conduct an uncertainty analysis by calculating the partial rank correlation coefficient for the parameters to find which are most important to the outcomes of the model. We then use an eFAST method to determine both the individual and total sensitivity index for the parameters. Afterwards we examine our numerical model under varying initial conditions and parameter values, and compare ratios found from local data with the golden mean by fitting images …

Discrete Stability Of Dpg Methods, Ammar Harb

Dissertations and Theses

This dissertation presents a duality theorem of the Aubin-Nitsche type for discontinuous Petrov Galerkin (DPG) methods. This explains the numerically observed higher convergence rates in weaker norms. Considering the specific example of the mild-weak (or primal) DPG method for the Laplace equation, two further results are obtained. First, for triangular meshes, the DPG method continues to be solvable even when the test space degree is reduced, provided it is odd. Second, a non-conforming method of analysis is developed to explain the numerically observed convergence rates for a test space of reduced degree. Finally, for rectangular meshes, the test space is …

Several New Families Of Jarratt’S Method For Solving Systems Of Nonlinear Equations, V. Kanwar, Sanjeev Kumar, Ramandeep Behl

Applications and Applied Mathematics: An International Journal (AAM)

In this study, we suggest and analyze a new and wide general class of Jarratt’s method for solving systems of nonlinear equations. These methods have fourth-order convergence and do not require the evaluation of any second or higher-order Fréchet derivatives. In terms of computational cost, all these methods require evaluations of one function and two first-order Fréchet derivatives. The performance of proposed methods is compared with their closest competitors in a series of numerical experiments. It is worth mentioning that all the methods considered here are found to be effective and comparable to the robust methods available in the literature.

Determining The Orbit Locations Of Turkish Airborne Early Warning And Control Aircraft Over The Turkish Air Space, Nebi Sarikaya

Theses and Dissertations

The technology improvement affects the military needs of individual countries. The new doctrine of defense for many countries emphasizes detecting threats as far away as you can from your homeland. Today, the military uses both ground RADAR and Airborne Early Warning and Control (AEW&C) Aircraft. AEW&C aircraft has become vital to detect low altitude threats that a ground RADAR cannot detect because of obstacles on the earth. Turkey has ordered four AEW&C aircraft for her air defense system because of the lack of complete coverage by ground RADAR. This research provides optimal orbit locations that can be updated according to …

Polynomial Extension Operators. Part Ii, Leszek Demkowicz, Jay Gopalakrishnan, Joachim Schöberl

Mathematics and Statistics Faculty Publications and Presentations

Consider the tangential trace of a vector polynomial on the surface of a tetrahedron. We construct an extension operator that extends such a trace function into a polynomial on the tetrahedron. This operator can be continuously extended to the trace space of H(curl ). Furthermore, it satisfies a commutativity property with an extension operator we constructed in Part I of this series. Such extensions are a fundamental ingredient of high order finite element analysis.

Hardware Algorithm Implementation For Mission Specific Processing, Jason W. Shirley

Theses and Dissertations

There is a need to expedite the process of designing military hardware to stay ahead of the adversary. The core of this project was to build reusable, synthesizeable libraries to make this a possibility. In order to build these libraries, Matlab® commands and functions, such as Conv2, Round, Floor, Pinv, etc., had to be converted into reusable VHDL modules. These modules make up reusable libraries for the Mission Specific Process (MSP) which will support AFRL/RY. The MSP allows the VLSI design process to be completed in a mere matter of days or months using an FPGA or ASIC design, as …

Mapping Efficient Numerical Methods To The Solution Of Multiple Objective Linear Programs, Michael A. Shields

Theses and Dissertations

This investigation was initiated to increase the speed, accuracy and capacity of m-simplex algorithms for solving multiple objective linear programming problems. Specifically, improvements were sought through the application of general numerical techniques. It soon became apparent that the m- simplex algorithm, like the simplex algorithm, is heavily dependent upon the technology of solving related systems of linear equations. The numerical arguments for the application of LU triangular matrix factorization techniques to simplex computations are well known. OF special significance to m-simplex performance is the case of rank-k updates to basis factorizations. A stable and efficient LU approach to the rank-k …