Applied Mathematics Commons^™

Safe Control Design For Quadruped Locomotion In Unstructured Environments Using Linear Transfer Operators, Sriram Sundar Krishnamoorthy Shankara Narayanan

All Dissertations

Deploying quadruped robots in unstructured, obstacle-rich environments requires control and planning methods that remain safe and reliable despite complex terrain geometry, limited sensing, and inevitable modeling errors. This thesis develops operator-theoretic tools for safe control design of robotic systems using linear transfer operators, with a focus on quadruped locomotion in unstructured environments. The central goal is to develop a unified operator-theoretic framework for safe control design based on the Perron–Frobenius (P–F) and Koopman operators. In particular, the thesis leverages \emph{density functions} to develop safe navigation frameworks in the dual space of densities. In the operator-theoretic perspective, the P–F operator governs …

Decision Making For Large-Scale Problems Under Uncertainty And Conflict, Benjamin J. Hamlin

All Dissertations

Large-scale decision-making problems appear in many areas including long-range forecasting such as energy generation forecasting. Many such problems are subject to conflicting objectives and uncertain data, and can be modeled as linear optimization problems. We study novel theoretical results and algorithms for large-scale linear decision problems under conflict and uncertainty. First, we propose a parametric Benders decomposition algorithm for solving large-scale linear optimization problems with multiple objectives or deterministically uncertain objectives. Second, we extend the parametric Benders decomposition to a multi-stage setting, developing a parametric stochastic dual dynamic programming algorithm, which enables decision-making when conflicts and uncertainty have planning impacts …

Universal Systems Simulation Via Constraint Hypergraphs With Applications To Digital Twins, John Morris

All Dissertations

The characterization of systems encompasses a variety of modeling frameworks designed to capture specific behaviors and components of various system domains. Whatever the framework, the core elements of a system representation are the information of the system and a description of how that information is related. The relations in deterministic systems are functions, which, when composed to form executable processes, can be used to simulate system data. A declarative modeling framework is one that encodes mechanisms for preparing these simulations within the model structure, allowing an external agent to form the execution processes required for a given context. To date, …

Reverse (Bio)Engineering: A Machine Learning Approach To Optimize Baseball Pitcher Health And Performance, Robert C. Moore

All Dissertations

Ball tracking systems are becoming ubiquitous in sport, creating an unprecedented opportunity for big data applications to optimize human health and performance. These applications are especially common in baseball, a sport known for analyzing ball flight data to quantify performance. Analysts routinely use ball flight data to identify the attributes of top performing pitchers, finding that the best pitchers throw with optimal combinations of release speed and spin to precise locations. However, for certain pitchers, the throwing motion required to produce optimal ball flight places exceedingly high biomechanical load on the elbow, and consequently injury rates continue to rise. This …

Accurate Temporal Integration Schemes For Nonlinear Adsorption Problems, Evan D. Butterworth

All Dissertations

We consider a nonlinear transport problem to model the chromatography process of high-capacity multimodal membranes. Robust and efficient algorithms that simulate these bioseparation processes are critical to developing therapeutics for various chronic illnesses and infectious diseases. However, much of the current methodology focuses on stabilization and linearization techniques, often implementing low-order time-discretizations and linearized adsorption, resulting in inefficiencies and inaccuracies in the numerical solution. Utilizing Rothe's method, we develop various time-discretization schemes coupled with the finite element method to solve the fully implicit problems. Stability and solvability results are presented for several methods. Through multiple high-level software implementations paired with …

Decomposition And Coordination For Multiobjective Optimization: A Framework And Methodology, Philip J. De Castro

All Dissertations

In this work, we consider finding Pareto efficient solutions for complex multiobjective optimization problems (MOPs). Complex MOPs are unique in the literature because they have many more objective functions than is typically considered. In fact, such complex MOPs will have 30+ objective functions. This large problem size presents computational and coginitive difficulties. Computationally, standard techniques for solving MOPs are often ineffective and cognitively it is difficult for a decision maker (DM) to handle all of the information provided in such a large problem. To address these challenges, we develop a decomposition and coordination framework. This framework will allow us to …

Robust And Efficient Solvers For Physics-Based Pde’S, Elizabeth Hawkins

All Dissertations

This work was partially supported by the U.S. Department of Energy under award DE- SC0025292, by NSF grant DMS 2152623, and by NSF grant DMS 2011490.

This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, Mathematical Multifaceted Integrated Capability Centers (MMICCs) program, under Field Work Proposal 22-025291 (Multifaceted Math- ematics for Predictive Digital Twins (M2dt)), Field Work Proposal 23-020467, and Computing and Information Sciences (CIS) investment area in the Laboratory Directed Research and Development program at Sandia National Laboratories. This written work is authored by an employee …

Domain Decomposition For Coupled Systems Of Fluid-Structure Interaction And Numerical Modeling For Thin Film Polymers, Amy De Castro

All Dissertations

We consider two primary areas of physical application in this work: fluid interaction systems with either linear elastic structures or with poroelastic structures, and thin film polymers, where the majority of the work focuses on the fluid-structure interaction systems.

In the first chapter, we present a strongly coupled partitioned method for fluid structure interaction (FSI) problems based on a monolithic formulation of the system which employs a Lagrange multiplier (LM). We prove that both the semi-discrete and fully discrete formulations are well-posed. To derive the partitioned scheme, a Schur complement equation, which implicitly expresses the Lagrange multiplier and the fluid …

Efficient First-Order Methods For Some Smooth Nonlinear Optimization Problems, Yunheng Jiang

All Dissertations

none

First-Order Algorithms For Convex Smooth Optimization Problems With Homogeneous Linear Constraints, Yidan Guo

All Dissertations

The purpose of this dissertation is to explore the first-order methods that can be used to solve an approximate solution for convex smooth problems with homogeneous linear constraints. It consists of three interconnected research projects.

In the first project, we study the problem of computing the projection of a given vector onto the kernel of a symmetric positive semi-definite matrix. The complexity of an algorithm for computing a numerical solution is evaluated by the total number of matrix-vector multiplications required for computing an approximate solution. Such problems arise commonly in consensus optimization, in which the total number of matrix-vector multiplications …

Optimization Strategies For Political Redistricting, Blake Splitter

All Dissertations

Political redistricting has remained a hot-button issue in the United States for several decades. Every ten years, most states need to redraw their districts to account for changing populations. Sometimes, these district plans can be drawn with the malevolent intention of aiding one political party over another. This dissertation summarizes four distinct methods of drawing these districts using computer algorithms while keeping several objectives in mind. We test these approaches on the case study state of South Carolina, since it provides a sufficiently challenging problem for us to test various algorithms. We find that many of these approaches improve upon …

Frameworks For The Techno-Economic Assessment Of Membrane-Based Bioprocessing Platforms, Juan Jose Romero Conde

All Dissertations

This dissertation describes developing and implementing computational frameworks for simulating and optimizing purification processes in the biopharmaceutical industry. The framework performs techno-economic analyses to establish value propositions for new process alternatives, especially membrane technologies. Initially, the focus is developing a framework capable of simulating monoclonal antibody (mAb) capture using membrane and resin media in multi-column chromatography (MCC) platforms for continuous manufacturing. Subsequently, the impact of capture MCC is compared against other intensification strategies in established mAb manufacturing facilities. Finally, the framework application expands to simulate the purification of adeno-associated virus (AAV) vectors for gene therapy.

Chapter 2 details the framework …

Convergence Estimate Of Minimal Residual Methods And Random Sketching Of Krylov Subspace Methods, Peter Westerbaan

All Dissertations

This study concerns two main issues in numerical linear algebra: convergence estimate of minimal residual methods based on explicit construction of approximate min-max polynomials for in- definite matrices, and development and analysis of Krylov subspace methods using non-orthonormal basis vectors based on random sketching. For a matrix A with spectrum Λ(A), it is well known that the min-max polynomial problem min max |pk (z)| pk ∈Pk, pk (0)=1, z∈Λ(A) is used to bound the relative error of Krylov subspace minimum residual methods or similar methods. For a symmetric positive definite matrix A, the min-max polynomial for the Conjugate Gradient (CG) …

Models Of Functional Redundancy In Ecological Communities, Sandra Annie Tsiorintsoa

All Dissertations

Functional redundancy is the number of taxa that perform a given function within a given community. In most systems, high levels of functional redundancy are important, because they contribute to ecosystem stability. However, we currently have very little understanding of why functional redundancy varies among communities. One possible factor that could affect functional redundancy is environmental complexity. Many studies show that simplified ecosystems harbor communities with lower taxon diversity. What is less clear is if this simplicity and lower taxon diversity also affects functional redundancy. To answer this question, we use metacommunity models to explore the connection between environmental complexity …

Domain Decomposition Methods For Fluid-Structure Interaction Problems Involving Elastic, Porous, Or Poroelastic Structures, Hemanta Kunwar

All Dissertations

We introduce two global-in-time domain decomposition methods, namely the Steklov-Poincare method and Schwarz waveform relaxation (SWR) method using Robin transmission conditions (or the Robin method), for solving fluid-structure interaction systems involving elastic, porous, or poroelastic structure. These methods allow us to formulate the coupled system as a space-time interface problem and apply iterative algorithms directly to the evolutionary problem. Each time-dependent fluid and the structure subdomain problem is solved independently, which enables the use of different time discretization schemes and time step sizes in the subsystems. This leads to an efficient way of simulating time-dependent multiphysics phenomena. For the fluid-porous …

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 …

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 …

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 …

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

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

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

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

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

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

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

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

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

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

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

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 …