Numerical Analysis and Computation Commons^™

Regularized Methods For Tensor Recovery And Processing, Katherine J. Henneberger

Theses and Dissertations--Mathematics

The rapid growth of high-dimensional data has exposed the limitations of traditional vector and matrix-based methods for data analysis. These methods often struggle with computational inefficiencies, loss of critical cross-dimensional correlations, and challenges inherent in high-dimensional data. Tensors—multidimensional arrays—offer a robust framework for modeling and analyzing complex data. Tensor methods have proven valuable in tasks such as dimensionality reduction, feature extraction, and data compression, underpinning advancements in machine learning, computer vision, signal processing, and remote sensing.

This thesis focuses on two challenges in tensor analysis: tensor recovery and tensor processing. Tensor recovery addresses the reconstruction of incomplete or corrupted tensors. …

(R2100) Optimality Conditions Of A Topsis Optimization Model And Its Application On Interval-Valued Data, Sudipta Roy, Sandip Chatterjee

Applications and Applied Mathematics: An International Journal (AAM)

The Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) is widely used in the field of multi-criteria decision analysis. Despite its popularity and widespread application, little attention has been given to the mathematical foundation that underlies the TOPSIS algorithm. The existing literature on this subject is far from comprehensive, leaving many aspects of the algorithm unexplored. This paper aims to address this gap in the literature by delving into the optimization problem associated with TOPSIS. Unlike traditional interval analysis theory, which only covers a limited scope, our approach extends to a broader range of scenarios and offers …

An Introduction To The Time-Independent Schrödinger Equation And Methods To Solve It, Vu Giang, Alex Gnech

OUR Journal: ODU Undergraduate Research Journal

The Time-Independent Schrödinger Equation is a linear elliptic PDE that describes quantum-mechanical systems. Its significance in the science of submicroscopic phenomena, particularly quantum mechanics, is as central as Newton’s laws of motion are to classical mechanics. This study uses various methods, including novel neural networks and finite difference schemes, to solve the one-dimensional two-body equation.

Optimization Pump As Turbine Coupled To A Self-Excited Induction Generator Using Multi-Objective Genetic Algorithm, Emanuel J. Nyirenda

Tanzania Journal of Engineering and Technology (TJET)

As a way of accelerating the deployment of affordable and clean renewable energy generation technologies, applying a pump working as a turbine coupled to a self-excited induction generator is gaining popularity in various areas including energy recovery and micro hydro systems. However, it is currently challenging to predict the performance of the PAT-SEIG system and there is no agreed-upon rule on the selection of the appropriate system to be installed at a particular site. This paper has presented multi-objective optimization to select the best operating point of the PAT-SEIG system. The results show that the peak efficiencies for the PAT …

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 …

Distributed Control Of Servicing Satellite Fleet Using Horizon Simulation Framework, Scott Plantenga

Master's Theses

On-orbit satellite servicing is critical to maximizing space utilization and sustainability and is of growing interest for commercial, civil, and defense applications. Reliance on astronauts or anchored robotic arms for the servicing of next-generation large, complex space structures operating beyond Low Earth Orbit is impractical. Substantial literature has investigated the mission design and analysis of robotic servicing missions that utilize a single servicing satellite to approach and service a single target satellite. This motivates the present research to investigate a fleet of servicing satellites performing several operations for a large, central space structure.

This research leverages a distributed control approach, …

An Optimization Model For Minimization Of Systemic Risk In Financial Portfolios, Zachary Alexander Gelber

Master's Theses

In this thesis, we study how sovereign credit default swaps are able to measure systemic risk as well as how they can be used to construct optimal portfolios to minimize risk. We define the clustering coefficient as a proxy for systemic risk and design an optimization problem with the goal of minimizing the mean absolute deviation of the clustering coefficient on a group of nine European countries. Additionally, we define a metric we call the diversity score that measures the diversification of any given portfolio. We solve this problem for a baseline set of parameters, then spend the remainder of …

Dynamic Nonlinear Gaussian Model For Inferring A Graph Structure On Time Series, Abhinuv Uppal

CMC Senior Theses

In many applications of graph analytics, the optimal graph construction is not always straightforward. I propose a novel algorithm to dynamically infer a graph structure on multiple time series by first imposing a state evolution equation on the graph and deriving the necessary equations to convert it into a maximum likelihood optimization problem. The state evolution equation guarantees that edge weights contain predictive power by construction. After running experiments on simulated data, it appears the required optimization is likely non-convex and does not generally produce results significantly better than randomly tweaking parameters, so it is not feasible to use in …

Optimal Design Problems With State Constraints, Nha Van Tran

LSU Doctoral Dissertations

This thesis focuses on constrained optimization problems with constraints on the state variables. When the constraints involve partial differential equations or variational inequalities, the optimization problem is also known as Mathematical Programs with Equilibrium Constraints. First, we applied active-set properties of optimal solutions to transform variational inequality constraints into partial differential equation constraints and devised an active-set method which allowed us to solve the optimization problems using the adjoint approach. We extended our approach to evolution problems with constraints on the trajectory of the state variable, such as the irreversibility condition in fracture mechanics. We implemented a gradient descent algorithm …

Computational Methods In Civil Engineering, Nir Krakauer

Open Educational Resources

No abstract provided.

Design Optimization Of A Stochastic Multi-Objective Problem: Gaussian Process Regressions For Objective Surrogates, Juan Sebastian Martinez, Piyush Pandita, Rohit K. Tripathy, Ilias Bilionis

The Summer Undergraduate Research Fellowship (SURF) Symposium

Multi-objective optimization (MOO) problems arise frequently in science and engineering situations. In an optimization problem, we want to find the set of input parameters that generate the set of optimal outputs, mathematically known as the Pareto frontier (PF). Solving the MOO problem is a challenge since expensive experiments can be performed only a constrained number of times and there is a limited set of data to work with, e.g. a roll-to-roll microwave plasma chemical vapor deposition (MPCVD) reactor for manufacturing high quality graphene. State-of-the-art techniques, e.g. evolutionary algorithms; particle swarm optimization, require a large amount of observations and do not …

On The Optimal Stopping Time Problem For Degenerate Diffusions, J. L. Menaldi

Mathematics Faculty Research Publications

In this paper we give a characterization of the optimal cost of a stopping time problem as the maximum solution of a variational inequality without coercivity. Some properties of continuity for the optimal cost are also given.