Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 30 of 66

Full-Text Articles in Physical Sciences and Mathematics

Aspects Of Stochastic Geometric Mechanics In Molecular Biophysics, David Frost Dec 2023

Aspects Of Stochastic Geometric Mechanics In Molecular Biophysics, David Frost

All Dissertations

In confocal single-molecule FRET experiments, the joint distribution of FRET efficiency and donor lifetime distribution can reveal underlying molecular conformational dynamics via deviation from their theoretical Forster relationship. This shift is referred to as a dynamic shift. In this study, we investigate the influence of the free energy landscape in protein conformational dynamics on the dynamic shift by simulation of the associated continuum reaction coordinate Langevin dynamics, yielding a deeper understanding of the dynamic and structural information in the joint FRET efficiency and donor lifetime distribution. We develop novel Langevin models for the dye linker dynamics, including rotational dynamics, based …


New Preconditioned Conjugate Gradient Methods For Some Structured Problems In Physics, Tianqi Zhang Dec 2023

New Preconditioned Conjugate Gradient Methods For Some Structured Problems In Physics, Tianqi Zhang

All Dissertations

This dissertation concerns the development and analysis of new preconditioned conjugate gradient (PCG) algorithms for three important classes of large-scale and complex physical problems characterized by special structures. We propose several new iterative methods for solving the eigenvalue problem or energy minimization problem, which leverage the unique structures inherent in these problems while preserving the underlying physical properties. The new algorithms enable more efficient and robust large-scale modeling and simulations in many areas, including condensed matter physics, optical properties of materials, stabilities of dynamical systems arising from control problems, and many more. Some methods are expected to be applicable to …


Controlled Manipulation And Transport By Microswimmers In Stokes Flows, Jake Buzhardt Dec 2023

Controlled Manipulation And Transport By Microswimmers In Stokes Flows, Jake Buzhardt

All Dissertations

Remotely actuated microscale swimming robots have the potential to revolutionize many aspects of biomedicine. However, for the longterm goals of this field of research to be achievable, it is necessary to develop modelling, simulation, and control strategies which effectively and efficiently account for not only the motion of individual swimmers, but also the complex interactions of such swimmers with their environment including other nearby swimmers, boundaries, other cargo and passive particles, and the fluid medium itself. The aim of this thesis is to study these problems in simulation from the perspective of controls and dynamical systems, with a particular focus …


Acceleration Methods For Nonlinear Solvers And Application To Fluid Flow Simulations, Duygu Vargun Aug 2023

Acceleration Methods For Nonlinear Solvers And Application To Fluid Flow Simulations, Duygu Vargun

All Dissertations

This thesis studies nonlinear iterative solvers for the simulation of Newtonian and non- Newtonian fluid models with two different approaches: Anderson acceleration (AA), an extrapolation technique that accelerates the convergence rate and improves the robustness of fixed-point iterations schemes, and continuous data assimilation (CDA) which drives the approximate solution towards coarse data measurements or observables by adding a penalty term.

We analyze the properties of nonlinear solvers to apply the AA technique. We consider the Picard iteration for the Bingham equation which models the motion of viscoplastic materials, and the classical iterated penalty Picard and Arrow-Hurwicz iterations for the incompressible …


Asymptotic Cones Of Quadratically Defined Sets And Their Applications To Qcqps, Alexander Joyce Aug 2023

Asymptotic Cones Of Quadratically Defined Sets And Their Applications To Qcqps, Alexander Joyce

All Dissertations

Quadratically constrained quadratic programs (QCQPs) are a set of optimization problems defined by a quadratic objective function and quadratic constraints. QCQPs cover a diverse set of problems, but the nonconvexity and unboundedness of quadratic constraints lead to difficulties in globally solving a QCQP. This thesis covers properties of unbounded quadratic constraints via a description of the asymptotic cone of a set defined by a single quadratic constraint. A description of the asymptotic cone is provided, including properties such as retractiveness and horizon directions.

Using the characterization of the asymptotic cone, we generalize existing results for bounded quadratically defined regions with …


Recovering Coefficients Of Second-Order Hyperbolic And Plate Equations Via Finite Measurements On The Boundary, Scott Randall Scruggs Aug 2023

Recovering Coefficients Of Second-Order Hyperbolic And Plate Equations Via Finite Measurements On The Boundary, Scott Randall Scruggs

All Dissertations

Abstract In this dissertation, we consider the inverse problem for a second-order hyperbolic equation of recovering n + 3 unknown coefficients defined on an open bounded domain with a smooth enough boundary. We also consider the inverse problem of recovering an unknown coefficient on the Euler- Bernoulli plate equation on a lower-order term again defined on an open bounded domain with a smooth enough boundary. For the second-order hyperbolic equation, we show that we can uniquely and (Lipschitz) stably recover all these coefficients from only using half of the corresponding boundary measurements of their solutions, and for the plate equation, …


Advancements In Fluid Simulation Through Enhanced Conservation Schemes, Sean Ingimarson May 2023

Advancements In Fluid Simulation Through Enhanced Conservation Schemes, Sean Ingimarson

All Dissertations

To better understand and solve problems involving the natural phenomenon of fluid and air flows, one must understand the Navier-Stokes equations. Branching several different fields including engineering, chemistry, physics, etc., these are among the most important equations in mathematics. However, these equations do not have analytic solutions save for trivial solutions. Hence researchers have striven to make advancements in varieties of numerical models and simulations. With many variations of numerical models of the Navier-Stokes equations, many lose important physical meaningfulness. In particular, many finite element schemes do not conserve energy, momentum, or angular momentum. In this thesis, we will study …


Machine Learning-Based Data And Model Driven Bayesian Uncertanity Quantification Of Inverse Problems For Suspended Non-Structural System, Zhiyuan Qin May 2023

Machine Learning-Based Data And Model Driven Bayesian Uncertanity Quantification Of Inverse Problems For Suspended Non-Structural System, Zhiyuan Qin

All Dissertations

Inverse problems involve extracting the internal structure of a physical system from noisy measurement data. In many fields, the Bayesian inference is used to address the ill-conditioned nature of the inverse problem by incorporating prior information through an initial distribution. In the nonparametric Bayesian framework, surrogate models such as Gaussian Processes or Deep Neural Networks are used as flexible and effective probabilistic modeling tools to overcome the high-dimensional curse and reduce computational costs. In practical systems and computer models, uncertainties can be addressed through parameter calibration, sensitivity analysis, and uncertainty quantification, leading to improved reliability and robustness of decision and …


Improving Efficiency Of Rational Krylov Subspace Methods, Shengjie Xu Dec 2022

Improving Efficiency Of Rational Krylov Subspace Methods, Shengjie Xu

All Dissertations

This thesis studies two classes of numerical linear algebra problems, approximating the product of a function of a matrix with a vector, and solving the linear eigenvalue problem $Av=\lambda Bv$ for a small number of eigenvalues. These problems are solved by rational Krylov subspace methods (RKSM). We present several improvements in two directions: pole selection and applying inexact methods.

In Chapter 3, a flexible extended Krylov subspace method ($\mathcal{F}$-EKSM) is considered for numerical approximation of the action of a matrix function $f(A)$ to a vector $b$, where the function $f$ is of Markov type. $\mathcal{F}$-EKSM has the same framework as …


On Variants Of Sliding And Frank-Wolfe Type Methods And Their Applications In Video Co-Localization, Seyed Hamid Nazari Dec 2022

On Variants Of Sliding And Frank-Wolfe Type Methods And Their Applications In Video Co-Localization, Seyed Hamid Nazari

All Dissertations

In this dissertation, our main focus is to design and analyze first-order methods for computing approximate solutions to convex, smooth optimization problems over certain feasible sets. Specifically, our goal in this dissertation is to explore some variants of sliding and Frank-Wolfe (FW) type algorithms, analyze their convergence complexity, and examine their performance in numerical experiments. We achieve three accomplishments in our research results throughout this dissertation. First, we incorporate a linesearch technique to a well-known projection-free sliding algorithm, namely the conditional gradient sliding (CGS) method. Our proposed algorithm, called the conditional gradient sliding with linesearch (CGSls), does not require the …


Managing Risk For Power System Operations And Planning: Applications Of Conditional Value-At-Risk And Uncertainty Quantification To Optimal Power Flow And Distributed Energy Resources Investment, Thanh To May 2022

Managing Risk For Power System Operations And Planning: Applications Of Conditional Value-At-Risk And Uncertainty Quantification To Optimal Power Flow And Distributed Energy Resources Investment, Thanh To

All Dissertations

Renewable energy sources are indispensable components of sustainable electrical systems that reduce human dependence on fossil fuels. However, due to their intermittent nature, there are issues that need to be addressed to ensure the security and resiliency of these power systems. This dissertation formulates several practical problems, from an optimization perspective, stemming from the increasing penetration of intermittent renewable energy to power systems. A number of Optimal Power Flow (OPF) formulations are investigated and new formulations are proposed to control both operations and planning risks by utilizing the Conditional Value–at–Risk (CVaR) measure. Our formulations provide system operators and investors analysis …


Advancements In Gaussian Process Learning For Uncertainty Quantification, John C. Nicholson May 2022

Advancements In Gaussian Process Learning For Uncertainty Quantification, John C. Nicholson

All Dissertations

Gaussian processes are among the most useful tools in modeling continuous processes in machine learning and statistics. The research presented provides advancements in uncertainty quantification using Gaussian processes from two distinct perspectives. The first provides a more fundamental means of constructing Gaussian processes which take on arbitrary linear operator constraints in much more general framework than its predecessors, and the other from the perspective of calibration of state-aware parameters in computer models. If the value of a process is known at a finite collection of points, one may use Gaussian processes to construct a surface which interpolates these values to …


An Algorithm For Biobjective Mixed Integer Quadratic Programs, Pubudu Jayasekara Merenchige Dec 2021

An Algorithm For Biobjective Mixed Integer Quadratic Programs, Pubudu Jayasekara Merenchige

All Dissertations

Multiobjective quadratic programs (MOQPs) are appealing since convex quadratic programs have elegant mathematical properties and model important applications. Adding mixed-integer variables extends their applicability while the resulting programs become global optimization problems. Thus, in this work, we develop a branch and bound (BB) algorithm for solving biobjective mixed-integer quadratic programs (BOMIQPs). An algorithm of this type does not exist in the literature.

The algorithm relies on five fundamental components of the BB scheme: calculating an initial set of efficient solutions with associated Pareto points, solving node problems, fathoming, branching, and set dominance. Considering the properties of the Pareto set of …


Numerical Decoding, Johnson-Lindenstrauss Transforms, And Linear Codes, Yue Mao Dec 2014

Numerical Decoding, Johnson-Lindenstrauss Transforms, And Linear Codes, Yue Mao

All Dissertations

Many computational problems are related to the model y = Ax + e, including compressive sensing, coding theory, dimensionality reduction, etc. The related algorithms are extremely useful in practical applications for high performance computing, for example, digital communications, biological imaging and data streaming, etc. This thesis studies two important problems. One problem is related to efficient decoding for Reed-Solomon codes over complex numbers. In this case, A and y are given, and the goal is to find an efficient stable algorithm to compute x. This is related to magnetic resonance imaging (MRI). The other problem is related to fast algorithms …


Homomorphic Encryption And The Approximate Gcd Problem, Nathanael Black Aug 2014

Homomorphic Encryption And The Approximate Gcd Problem, Nathanael Black

All Dissertations

With the advent of cloud computing, everyone from Fortune 500 businesses to personal consumers to the US government is storing massive amounts of sensitive data in service centers that may not be trustworthy. It is of vital importance to leverage the benefits of storing data in the cloud while simultaneously ensuring the privacy of the data. Homomorphic encryption allows one to securely delegate the processing of private data. As such, it has managed to hit the sweet spot of academic interest and industry demand. Though the concept was proposed in the 1970s, no cryptosystem realizing this goal existed until Craig …


Grobner Bases: Degree Bounds And Generic Ideals, Juliane Golubinski Capaverde Aug 2014

Grobner Bases: Degree Bounds And Generic Ideals, Juliane Golubinski Capaverde

All Dissertations

In this thesis, we study two problems related to Gröbner basis theory: degree bounds for general ideals and Gröbner bases structure for generic ideals. We start by giving an introduction to Gröbner bases and their basic properties and presenting a recent algorithm by Gao, Volny and Wang. Next, we survey degree bounds for the ideal membership problem, the effective Nullstellensatz, and polynomials in minimal Gröbner bases. We present general upper bounds, and bounds for several classes of special ideals. We provide classical examples showing some of these bounds cannot be improved in general. We present a comprehensive study of a …


Applied Statistics In Environmental Monitoring: Case Studies And Analysis For The Michigan Bald Eagle Biosentinel Program, Katherine Leith Aug 2014

Applied Statistics In Environmental Monitoring: Case Studies And Analysis For The Michigan Bald Eagle Biosentinel Program, Katherine Leith

All Dissertations

The bald eagle (Haliaeetus leucocephalus) is an extensively researched tertiary predator. Its life history and the impact of various stressors on its reproductive outcomes have been documented in many studies, and over many years. Furthermore, the bald eagle population recovery in Michigan has been closely monitored since the 1960s, as it has continued to recover from a contaminant-induced bottleneck. Because of its position at the top of the aquatic food web and the large body of ethological knowledge, the bald eagle has become a sentinel species for the Michigan aquatic ecosystem. In April 1999, the Michigan Department of Environmental Qualtity, …


On Numerical Algorithms For Fluid Flow Regularization Models, Abigail Bowers Aug 2014

On Numerical Algorithms For Fluid Flow Regularization Models, Abigail Bowers

All Dissertations

This thesis studies regularization models as a way to approximate a flow simulation at a lower computational cost. The Leray model is more easily computed than the Navier-Stokes equations (NSE), and it is more computationally attractive than the NS-α regularization because it admits a natural linearization which decouples the mass/momentum system and the filter system, allowing for efficient and stable computations. A major disadvantage of the Leray model lies in its inaccuracy. Thus, we study herein several methods to improve the accuracy of the model, while still retaining many of its attractive properties. This thesis is arranged as follows. Chapter …


Level Stripping Of Genus 2 Siegel Modular Forms, Rodney Keaton Aug 2014

Level Stripping Of Genus 2 Siegel Modular Forms, Rodney Keaton

All Dissertations

In this Dissertation we consider stripping primes from the level of genus 2 cuspidal Siegel eigenforms. Specifically, given an eigenform of level Nlr which satisfies certain mild conditions, where l is a prime not dividing N, we construct an eigenform of level N which is congruent to our original form. To obtain our results, we use explicit constructions of Eisenstein series and theta functions to adapt ideas from a level stripping result on elliptic modular forms. Furthermore, we give applications of this result to Galois representations and provide evidence for an analog of Serre's conjecture in the genus 2 case.


Convergence Of A Reinforcement Learning Algorithm In Continuous Domains, Stephen Carden Aug 2014

Convergence Of A Reinforcement Learning Algorithm In Continuous Domains, Stephen Carden

All Dissertations

In the field of Reinforcement Learning, Markov Decision Processes with a finite number of states and actions have been well studied, and there exist algorithms capable of producing a sequence of policies which converge to an optimal policy with probability one. Convergence guarantees for problems with continuous states also exist. Until recently, no online algorithm for continuous states and continuous actions has been proven to produce optimal policies. This Dissertation contains the results of research into reinforcement learning algorithms for problems in which both the state and action spaces are continuous. The problems to be solved are introduced formally as …


Approximation In Multiobjective Optimization With Applications, Lakmali Weerasena Dec 2013

Approximation In Multiobjective Optimization With Applications, Lakmali Weerasena

All Dissertations

Over the last couple of decades, the field of multiobjective optimization has received much attention in solving real-life optimization problems in science, engineering, economics and other fields where optimal decisions need to be made in the presence of trade-offs between two or more conflicting objective functions. The conflicting nature of objective functions implies a solution set for a multiobjective optimization problem. Obtaining this set is difficult for many reasons, and a variety of approaches for approximating it either partially or entirely have been proposed.

In response to the growing interest in approximation, this research investigates developing a theory and methodology …


On The Cuspidality Of Maass-Gritsenko And Mixed Level Lifts, Dania Zantout Aug 2013

On The Cuspidality Of Maass-Gritsenko And Mixed Level Lifts, Dania Zantout

All Dissertations

your words


Advancements In Finite Element Methods For Newtonian And Non-Newtonian Flows, Keith Galvin Aug 2013

Advancements In Finite Element Methods For Newtonian And Non-Newtonian Flows, Keith Galvin

All Dissertations

This dissertation studies two important problems in the mathematics of computational fluid dynamics. The first problem concerns the accurate and efficient simulation of incompressible, viscous Newtonian flows, described by the Navier-Stokes equations. A direct numerical simulation of these types of flows is, in most cases, not computationally feasible. Hence, the first half of this work studies two separate types of models designed to more accurately and efficient simulate these flows. The second half focuses on the defective boundary problem for non-Newtonian flows. Non-Newtonian flows are generally governed by more complex modeling equations, and the lack of standard Dirichlet or Neumann …


Mathematical Optimization For Engineering Design Problems, Brian Dandurand Aug 2013

Mathematical Optimization For Engineering Design Problems, Brian Dandurand

All Dissertations

Applications in engineering design and the material sciences motivate the development of optimization theory in a manner that additionally draws from other branches of mathematics including the functional, complex, and numerical analyses.
The first contribution, motivated by an automotive design application, extends multiobjective optimization theory under the assumption that the problem information is not available in its entirety to a single decision maker as traditionally assumed in the multiobjective optimization literature. Rather, the problem information and the design control are distributed among different decision makers. This requirement appears in the design of an automotive system whose subsystem components themselves correspond …


Polyhedral Approximations Of Quadratic Semi-Assignment Problems, Disjunctive Programs, And Base-2 Expansions Of Integer Variables, Frank Muldoon Dec 2012

Polyhedral Approximations Of Quadratic Semi-Assignment Problems, Disjunctive Programs, And Base-2 Expansions Of Integer Variables, Frank Muldoon

All Dissertations

This research is concerned with developing improved representations for special families of mixed-discrete programming problems. Such problems can typically be modeled using different mathematical forms, and the representation employed can greatly influence the problem's ability to be solved. Generally speaking, it is desired to obtain mixed 0-1 linear forms whose continuous relaxations provide tight polyhedral outer-approximations to the convex hulls of feasible solutions. This dissertation makes contributions to three distinct problems, providing new forms that improve upon published works.
The first emphasis is on devising solution procedures for the classical quadratic semi-assignment problem(QSAP), which is an NP-hard 0-1 quadratic program. …


Sensitivity Analysis In Magnetic Resonance Elastography And A Local Wavelength Reconstruction Based On Wave Direction, Christopher Gillam Dec 2012

Sensitivity Analysis In Magnetic Resonance Elastography And A Local Wavelength Reconstruction Based On Wave Direction, Christopher Gillam

All Dissertations

or the detection of early stage cancer. MRE utilizes interior data for its inverse problems, which greatly reduces the ill-posedness from which most traditional inverse problems suffer.
In this thesis, we first establish a sensitivity analysis for viscoelastic scalar medium with complex wave number and compare it with the purely elastic case. Also we estimate the smallest detectable inclusion for breast and liver, which is about twice larger than using the purely elastic model. We also found the existence of optimal frequency (50 Hz) that maximizes the detectability when the Voigt model is used.
Second, we propose a local wavelength …


Sensitivity Anaylsis And Detectability For Magnetic Resonance Elastography, Catherine White Aug 2012

Sensitivity Anaylsis And Detectability For Magnetic Resonance Elastography, Catherine White

All Dissertations

This thesis is for a sensitivity analysis of magnetic resonance elastography, a hybrid imaging technique used in early-stage cancer screening. To quantitatively analyze the sensitivity, we introduce a notion of detectability, which is dened as a relative amplitude
drop in a small sti tumor region. This analysis is accomplished in both the full elastic and viscoelastic models and compared with that of the simpler scalar model which is frequently used in the actual application.
Some of the highlights are 1) a useful formula for detectability in terms of physical parameters, which will help the design of experiments; 2) the discrepancy …


Physicic-Based Algorithms And Divergence Free Finite Elements For Coupled Flow Problems, Nicholas Wilson Aug 2012

Physicic-Based Algorithms And Divergence Free Finite Elements For Coupled Flow Problems, Nicholas Wilson

All Dissertations

This thesis studies novel physics-based methods for
simulating incompressible fluid flow described by the Navier-Stokes equations (NSE) and
magnetohydrodynamics equations (MHD).
It is widely accepted in computational fluid dynamics (CFD) that numerical schemes which are more
physically accurate lead to more precise flow simulations especially over long time intervals.
A prevalent theme throughout will be the inclusion of as much
physical fidelity in numerical solutions as efficiently possible. In algorithm design, model
selection/development, and element choice, subtle changes can provide better physical accuracy,
which in turn provides better overall accuracy (in any measure). To this end we develop and study …


Sparsity Regularization In Diffuse Optical Tomography, John Cooper Aug 2012

Sparsity Regularization In Diffuse Optical Tomography, John Cooper

All Dissertations

The purpose of this dissertation is to improve image reconstruction in Diffuse Optical Tomography (DOT), a high contrast imaging modality that uses a near infrared light source. Because the scattering and absorption of a tumor varies significantly from healthy tissue, a reconstructed spatial representation of these parameters serves as tomographic image of a medium. However, the high scatter and absorption of the optical source also causes the inverse problem to be severely ill posed, and currently only low resolution reconstructions are possible, particularly when using an unmodulated direct current (DC) source.
In this work, the well posedness of the forward …


Modular Forms, Elliptic Curves And Drinfeld Modules, Catherine Trentacoste May 2012

Modular Forms, Elliptic Curves And Drinfeld Modules, Catherine Trentacoste

All Dissertations

In this thesis we explore three different subfields in the area of number theory. The first topic we investigate involves modular forms, specifically nearly holomorphic eigenforms. In Chapter 3, we show the product of two nearly holomorphic eigenforms is an eigenform for only a finite list of examples. The second type of problem we analyze is related to the rank of elliptic curves. Specifically in Chapter 5 we give a graph theoretical approach to calculating the size of 3-Selmer groups for a given family of elliptic curves. By calculating the size of the 3-Selmer groups, we give an upper bound …