Open Access. Powered by Scholars. Published by Universities.®
![Digital Commons Network](http://assets.bepress.com/20200205/img/dcn/DCsunburst.png)
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
Articles 1 - 7 of 7
Full-Text Articles in Physical Sciences and Mathematics
Modeling And Numerical Analysis Of The Cholesteric Landau-De Gennes Model, Andrew L. Hicks
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 …
Basins Of Attraction And Metaoptimization For Particle Swarm Optimization Methods, David Ma
Basins Of Attraction And Metaoptimization For Particle Swarm Optimization Methods, David Ma
Honors Projects
Particle swarm optimization (PSO) is a metaheuristic optimization method that finds near- optima by spawning particles which explore within a given search space while exploiting the best candidate solutions of the swarm. PSO algorithms emulate the behavior of, say, a flock of birds or a school of fish, and encapsulate the randomness that is present in natural processes. In this paper, we discuss different initialization schemes and meta-optimizations for PSO, its performances on various multi-minima functions, and the unique intricacies and obstacles that the method faces when attempting to produce images for basins of attraction, which are the sets of …
Distributed Control Of Servicing Satellite Fleet Using Horizon Simulation Framework, Scott Plantenga
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
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 …
Sensitivity Analysis Of Basins Of Attraction For Nelder-Mead, Sonia K. Shah
Sensitivity Analysis Of Basins Of Attraction For Nelder-Mead, Sonia K. Shah
Honors Projects
The Nelder-Mead optimization method is a numerical method used to find the minimum of an objective function in a multidimensional space. In this paper, we use this method to study functions - specifically functions with three-dimensional graphs - and create images of the basin of attraction of the function. Three different methods are used to create these images named the systematic point method, randomized centroid method, and systemized centroid method. This paper applies these methods to different functions. The first function has two minima with an equivalent function value. The second function has one global minimum and one local minimum. …
Dynamic Nonlinear Gaussian Model For Inferring A Graph Structure On Time Series, Abhinuv Uppal
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 …
Paper Structure Formation Simulation, Tyler R. Seekins
Paper Structure Formation Simulation, Tyler R. Seekins
Electronic Theses and Dissertations
On the surface, paper appears simple, but closer inspection yields a rich collection of chaotic dynamics and random variables. Predictive simulation of paper product properties is desirable for screening candidate experiments and optimizing recipes but existing models are inadequate for practical use. We present a novel structure simulation and generation system designed to narrow the gap between mathematical model and practical prediction. Realistic inputs to the system are preserved as randomly distributed variables. Rapid fiber placement (~1 second/fiber) is achieved with probabilistic approximation of chaotic fluid dynamics and minimization of potential energy to determine flexible fiber conformations. Resulting digital packed …