Applied Mathematics Commons^™

Rare Event Sampling In Applied Stochastic Dynamical Systems, Yiming Yu

Dissertations

Predicting rare events is a challenging problem in many complex systems arising in physics, chemistry, biology, and materials science. Simulating rare events is often prohibitive in such systems due to their high dimensionality and the numerical cost of their simulation, yet analytical expressions for rare event probabilities are usually not available. This dissertation tackles the problem of approximation of the probability of rare catastrophic events in optical communication systems and spin-torque magnetic nanodevices. With the application of the geometric minimum action method, the probability of pulse position shifts or other parameter changes in a model of an actively mode-locked laser …

Scalable Time-Stepping For Navier-Stokes Through High-Frequency Analysis Of Block Arnoldi Iteration, Brianna Bingham

Dissertations

Existing time-stepping methods for PDEs such as Navier-Stokes equations are not as efficient or scalable as they need to be for high-resolution simulation due to stiffness. The failure of existing time-stepping methods to adapt to changes in technology presents a dilemma that is becoming even more problematic over time. By rethinking approaches to time-stepping, dramatic gains in efficiency of simulation methods can be achieved. Krylov subspace spectral (KSS) methods have proven to be effective for solving time-dependent, variable-coefficient PDEs. The objective of this research is to continue the development of KSS methods to provide numerical solution methods that are far …

Enhancement Of Krylov Subspace Spectral Methods Through The Use Of The Residual, Haley Dozier

Dissertations

Depending on the type of equation, finding the solution of a time-dependent partial differential equation can be quite challenging. Although modern time-stepping methods for solving these equations have become more accurate for a small number of grid points, in a lot of cases the scalability of those methods leaves much to be desired. That is, unless the timestep is chosen to be sufficiently small, the computed solutions might exhibit unreasonable behavior with large input sizes. Therefore, to improve accuracy as the number of grid points increases, the time-steps must be chosen to be even smaller to reach a reasonable solution. …

Divisibility In The Stone-Cech Compactification Of N, Salahddeen Khalifa

Dissertations

Let S a discrete semigroup. The associative operation on S extends naturally to an associative operation on βS,the Stone Cech compactification of S. This involves both topology and algebra and leads us to think how to extend properties and operations that are defined on S to βS. A good application of this is the extension of relations and divisibility operations that are defined on the discrete semigroup of natural numbers (N,.) with multiplication as operation to relations and divisibility operations that are defined on (βN,?) where (?) is the extension of the operation (.). In this research I studied extending …

Adaptive Meshfree Methods For Partial Differential Equations, Jaeyoun Oh

Dissertations

There are many types of adaptive methods that have been developed with different algorithm schemes and definitions for solving Partial Differential Equations (PDE). Adaptive methods have been developed in mesh-based methods, and in recent years, they have been extended by using meshfree methods, such as the Radial Basis Function (RBF) collocation method and the Method of Fundamental Solutions (MFS). The purpose of this dissertation is to introduce an adaptive algorithm with a residual type of error estimator which has not been found in the literature for the adaptive MFS. Some modifications have been made in developing the algorithm schemes depending …

Rapid Generation Of Jacobi Matrices For Measures Modified By Rational Factors, Amber Sumner

Dissertations

Orthogonal polynomials are important throughout the fields of numerical analysis and numerical linear algebra. The Jacobi matrix J for a family of n orthogonal polynomials is an n x n tridiagonal symmetric matrix constructed from the recursion coefficients for the three-term recurrence satisfied by the family. Every family of polynomials orthogonal with respect to a measure on a real interval [a,b] satisfies such a recurrence. Given a measure that is modified by multiplying by a rational weight function r(t), an important problem is to compute the modified Jacobi matrix Jmod corresponding to the new measure from knowledge of J. There …

Highly Symmetric Multiple Bi-Frames For Curve And Surface Multiresolution Processing, Khulud Ziadi

Dissertations

Wavelets and wavelet frames are important and useful mathematical tools in numerous applications, such as signal and image processing, and numerical analysis. Recently, the theory of wavelet frames plays an essential role in signal processing, image processing, sampling theory, and harmonic analysis. However, multiwavelets and multiple frames are more flexible and have more freedom in their construction which can provide more desired properties than the scalar case, such as short compact support, orthogonality, high approximation order, and symmetry. These properties are useful in several applications, such as curve and surface noise-removing as studied in this dissertation. Thus, the study of …

Radial Basis Function Differential Quadrature Method For The Numerical Solution Of Partial Differential Equations, Daniel Watson

Dissertations

In the numerical solution of partial differential equations (PDEs), there is a need for solving large scale problems. The Radial Basis Function Differential Quadrature (RBFDQ) method and local RBF-DQ method are applied for the solutions of boundary value problems in annular domains governed by the Poisson equation, inhomogeneous biharmonic equation, and the inhomogeneous Cauchy-Navier equations of elasticity. By choosing the collocation points properly, linear systems can be obtained so that the coefficient matrices have block circulant structures. The resulting systems can be efficiently solved using matrix decomposition algorithms (MDAs) and fast Fourier transforms (FFTs). For the local RBFDQ method, the …

Structures Of Derived Graphs, Khawlah Hamad Alhulwah

Dissertations

One of the most familiar derived graphs are line graphs. The line graph L(G) of a graph G is the graph whose vertices are the edges of G where two vertices of L(G) are adjacent if and only if the corresponding edges of G are adjacent. One of the best- known results on the structure of line graphs deals with forbidden subgraphs by Beineke. A characterization of graphs whose line graph is Hamiltonian is due to Harary and Nash-Williams. Iterated line graphs of almost all connected graphs were shown to be Hamiltonian by Chartrand. The girth of a graph G …

Color-Connected Graphs And Information-Transfer Paths, Stephen Devereaux

Dissertations

The Department of Homeland Security in the United States was created in 2003 in response to weaknesses discovered in the transfer of classied information after the September 11, 2001 terrorist attacks. While information related to national security needs to be protected, there must be procedures in place that permit access between appropriate parties. This two-fold issue can be addressed by assigning information-transfer paths between agencies which may have other agencies as intermediaries while requiring a large enough number of passwords and rewalls that is prohibitive to intruders, yet small enough to manage. Situations such as this can be represented by …

Numerical Solution Of Partial Differential Equations Using Polynomial Particular Solutions, Thir R. Dangal

Dissertations

Polynomial particular solutions have been obtained for certain types of partial differential operators without convection terms. In this dissertation, a closed-form particular solution for more general partial differential operators with constant coefficients has been derived for polynomial basis functions. The newly derived particular solutions are further coupled with the method of particular solutions (MPS) for numerically solving a large class of elliptic partial differential equations. In contrast to the use of Chebyshev polynomial basis functions, the proposed approach is more flexible in selecting the collocation points inside the domain. Polynomial basis functions are well-known for yielding ill-conditioned systems when their …

Solution Of Pdes For First-Order Photobleaching Kinetics Using Krylov Subspace Spectral Methods, Somayyeh Sheikholeslami

Dissertations

We solve the first order reaction-diffusion equations which describe binding-diffusion kinetics using a photobleaching scanning profile of a confocal laser scanning microscope approximated by a Gaussian laser profile. We show how to solve these equations with prebleach steady-state initial conditions using a time-domain method known as a Krylov Subspace Spectral (KSS) method. KSS methods are explicit methods for solving time- dependent variable-coefficient partial differential equations (PDEs). KSS methods are advantageous compared to other methods because of their stability and their superior scalability. These advantages are obtained by applying Gaussian quadrature rules in the spectral domain developed by Golub and Meurant. …

Highly Hamiltonian Graphs And Digraphs, Zhenming Bi

Dissertations

A cycle that contains every vertex of a graph or digraph is a Hamiltonian cycle. A graph or digraph containing such a cycle is itself called Hamiltonian. This concept is named for the famous Irish physicist and mathematician Sir William Rowan Hamilton. These graphs and digraphs have been the subject of study for over six decades. In this dissertation, we study graphs and digraphs with even stronger Hamiltonian properties, namely highly Hamiltonian graphs and digraphs.

Krylov Subspace Spectral Methods For Pdes In Polar And Cylindrical Geometries, Megan Richardson

Dissertations

As a result of stiff systems of ODEs, difficulties arise when using time stepping methods for PDEs. Krylov subspace spectral (KSS) methods get around the difficulties caused by stiffness by computing each component of the solution independently. In this dissertation, we extend the KSS method to a circular domain using polar coordinates. In addition to using these coordinates, we will approximate the solution using Legendre polynomials instead of Fourier basis functions. We will also compare KSS methods on a time-independent PDE to other iterative methods. Then we will shift our focus to three families of orthogonal polynomials on the interval …

Correspondence Between Multiwavelet Shrinkage/Multiple Wavelet Frame Shrinkage And Nonlinear Diffusion, Hanan Ali Alkhidhr

Dissertations

There are numerous methodologies for signal and image denoising. Wavelet, wavelet frame shrinkage, and nonlinear diffusion are effective ways for signal and image denoising. Also, multiwavelet transforms and multiple wavelet frame transforms have been used for signal and image denoising. Multiwavelets have important property that they can possess the orthogonality, short support, good performance at the boundaries, and symmetry simultaneously. The advantage of multiwavelet transform for signal and image denoising was illustrated by Bui et al. in 1998. They showed that the evaluation of thresholding on a multiwavelet basis has produced good results. Further, Strela et al. have showed that …

Fast Method Of Particular Solutions For Solving Partial Differential Equations, Anup Raja Lamichhane

Dissertations

Method of particular solutions (MPS) has been implemented in many science and engineering problems but obtaining the closed-form particular solutions, the selection of the good shape parameter for various radial basis functions (RBFs) and simulation of the large-scale problems are some of the challenges which need to overcome. In this dissertation, we have used several techniques to overcome such challenges.

The closed-form particular solutions for the Matérn and Gaussian RBFs were not known yet. With the help of the symbolic computational tools, we have derived the closed-form particular solutions of the Matérn and Gaussian RBFs for the Laplace and biharmonic …

Solution Of Nonlinear Time-Dependent Pde Through Componentwise Approximation Of Matrix Functions, Alexandru Cibotarica

Dissertations

Exponential propagation iterative (EPI) methods provide an efficient approach to the solution of large stiff systems of ODE, compared to standard integrators. However, the bulk of the computational effort in these methods is due to products of matrix functions and vectors, which can become very costly at high resolution due to an increase in the number of Krylov projection steps needed to maintain accuracy. In this dissertation, it is proposed to modify EPI methods by using Krylov subspace spectral (KSS) methods, instead of standard Krylov projection methods, to compute products of matrix functions and vectors. This improvement allowed the benefits …

On The Selection Of A Good Shape Parameter For Rbf Approximation And Its Application For Solving Pdes, Lei-Hsin Kuo

Dissertations

Meshless methods utilizing Radial Basis Functions~(RBFs) are a numerical method that require no mesh connections within the computational domain. They are useful for solving numerous real-world engineering problems. Over the past decades, after the 1970s, several RBFs have been developed and successfully applied to recover unknown functions and to solve Partial Differential Equations (PDEs).
However, some RBFs, such as Multiquadratic (MQ), Gaussian (GA), and Matern functions, contain a free variable, the shape parameter, c. Because c exerts a strong influence on the accuracy of numerical solutions, much effort has been devoted to developing methods for determining shape parameters which provide …

Edge Colorings Of Graphs And Their Applications, Daniel Johnston

Dissertations

Edge colorings have appeared in a variety of contexts in graph theory. In this work, we study problems occurring in three separate settings of edge colorings.

For more than a quarter century, edge colorings have been studied that induce vertex colorings in some manner. One research topic we investigate concerns edge colorings belonging to this class of problems. By a twin edge coloring of a graph G is meant a proper edge coloring of G whose colors come from the integers modulo k that induce a proper vertex coloring in which the color of a vertex is the sum of …

Secondary Mathematics Teachers’ Attitudes And Beliefs Toward Statistics: Developing An Initial Profile, Christina M. Zumbrun

Dissertations

Over the last several decades, mathematics education researchers have given increased attention to students’ and teachers’ attitudes and beliefs toward mathematics and statistics, but no work has been done that examines practicing secondary mathematics teachers’ (SMTs’) attitudes and beliefs towards statistics in light of the GAISE framework and the Common Core State Standards for Mathematics (CCSSM). This study begins to address this gap in the research by creating the Teacher Attitude and Beliefs toward Statistics Survey (TABSS), a synthesis of items taken from the Survey of Attitudes Toward Statistics (Schau, 2003), the Statistics Course Attitude Scale and newly developed items …

Time Integration Methods Of Fundamental Solutions And Approximate Fundamental Solutions For Nonlinear Elliptic Partial Differential Equations, Corey Leon Jones

Dissertations

A time-dependent method is coupled with the Method of Approximate Particular Solutions (MAPS) of Delta-shaped basis functions, the Method of Fundamental Solutions (MFS), and the Method of Approximate Fundamental Solutions (MAFS) to solve a second order nonlinear elliptic partial differential equation (PDE) on regular and irregular shaped domains. The nonlinear PDE boundary value problem is first transformed into a time-dependent quasilinear problem by introducing a fictitious time. Forward Euler integration is then used to ultimately convert the problem into a sequence of time-dependent linear nonhomogeneous modified Helmholtz boundary value problems on which the superposition principle is applied to split the …

Modular Monochromatic Colorings, Spectra And Frames In Graphs, Chira Lumduanhom

Dissertations

Abstract attached as separate document.

Development And Applications Of The Expanded Equivalent Fluid Method, Bharath Kumar Kandula

Dissertations

Ocean acoustics is the study of sound in the oceans. Electromagnetic waves attenuate rapidly in the water medium. Sound is the best means to transmit information underwater. Computational numerical simulations play an important role in ocean acoustics. Simulations of acoustic propagation in the oceans are challenging due to the complexities involved in the ocean environment. Different methods have been developed to simulate underwater sound propagation. The Parabolic-Equation (PE) method is the best choice in several ocean acoustic problems. In shallow water acoustic experiments, sound loses some of its energy when it interacts with the bottom. An equivalent fluid technique was …

Multi-Sensory Emotion Recognition With Speech And Facial Expression, Qingmei Yao

Dissertations

Emotion plays an important role in human beings’ daily lives. Understanding emotions and recognizing how to react to others’ feelings are fundamental to engaging in successful social interactions. Currently, emotion recognition is not only significant in human beings’ daily lives, but also a hot topic in academic research, as new techniques such as emotion recognition from speech context inspires us as to how emotions are related to the content we are uttering.

The demand and importance of emotion recognition have highly increased in many applications in recent years, such as video games, human computer interaction, cognitive computing, and affective computing. …

On Eulerian Irregularity And Decompositions In Graphs, Eric Andrews

Dissertations

Abstract attached as separate file.

Gene Regulatory Network Reconstruction Using Dynamic Bayesian Networks, Haoni Li

Dissertations

High-content technologies such as DNA microarrays can provide a system-scale overview of how genes interact with each other in a network context. Various mathematical methods and computational approaches have been proposed to reconstruct GRNs, including Boolean networks, information theory, differential equations and Bayesian networks. GRN reconstruction faces huge intrinsic challenges on both experimental and theoretical fronts, because the inputs and outputs of the molecular processes are unclear and the underlying principles are unknown or too complex.

In this work, we focused on improving the accuracy and speed of GRN reconstruction with Dynamic Bayesian based method. A commonly used structure-learning algorithm …

Error Estimation Techniques To Refine Overlapping Aerial Image Mosaic Processes Via Detected Parameters, William Glenn Bond

Dissertations

In this paper, I propose to demonstrate a means of error estimation preprocessing in the assembly of overlapping aerial image mosaics. The mosaic program automatically assembles several hundred aerial images from a data set by aligning them, via image registration using a pattern search method, onto a GIS grid.

The method presented first locates the images from a data set that it predicts will not align well via the mosaic process, then it uses a correlation function, optimized by a modified Hooke and Jeeves algorithm, to provide a more optimal transformation function input to the mosaic program. Using this improved …

Monte Carlo Simulation Of Electron-Induced Air Fluorescence Utilizing Mobile Agents: A New Paradigm For Collaborative Scientific Simulation, Christopher Daniel Walker

Dissertations

A new paradigm for utilization of mobile agents in a modular architecture for scientific simulation is demonstrated through a case study involving Monte Carlo simulation of low energy electron interactions with molecular nitrogen gas. Design and development of Monte Carlo simulations for physical systems of moderate complexity can present a seemingly overwhelming endeavor. The researcher must possess or otherwise develop a thorough understanding the physical system, create mathematical and computational models of the physical system’s components, and forge a simulation utilizing those models. While there is no single route between a collection of physical concepts and a Monte Carlo simulation …

Modular And Graceful Edge Colorings Of Graphs, Ryan Jones

Dissertations

Abstract attached as separate file.

Hamiltonicity And Connectivity In Distance-Colored Graphs, Kyle C. Kolasinski

Dissertations

Abstract attached as separate file.