Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 13 of 13
Full-Text Articles in Entire DC Network
Improved Full-Newton-Step Infeasible Interior-Point Method For Linear Complementarity Problems, Mustafa Ozen
Improved Full-Newton-Step Infeasible Interior-Point Method For Linear Complementarity Problems, Mustafa Ozen
Electronic Theses and Dissertations
In this thesis, we present an improved version of Infeasible Interior-Point Method (IIPM) for monotone Linear Complementarity Problem (LCP). One of the most important advantages of this version in compare to old version is that it only requires feasibility steps. In the earlier version, each iteration consisted of one feasibility step and some centering steps (at most three in practice). The improved version guarantees that after one feasibility step, the new iterated point is feasible and close enough to central path. Thus, the centering steps are eliminated. This improvement is based on the Lemma(Roos, 2015). Thanks to this lemma, proximity …
Enumerating Graphs Using Integrals From Quantum Field Theory, William A. Coggins
Enumerating Graphs Using Integrals From Quantum Field Theory, William A. Coggins
Electronic Theses and Dissertations
Enumerating graphs is a relatively new subfield of mathematics. In this thesis, we will discuss a enumerative method that derives from Quantum Field Theory. We begin with the basic ideas of Calculus and extend them into a enumerative method that will allow us to classify graphs embedded on surfaces.
Solutions Of Inequality Constrained Spline Optimization Problems With The Active Set Method, Joshua A. Holloway
Solutions Of Inequality Constrained Spline Optimization Problems With The Active Set Method, Joshua A. Holloway
Electronic Theses and Dissertations
We solve the problem of finding a near-interpolant curve, subject to constraints, which minimizes the bending energy of the curve. Using B-splines as our tools, we give a brief overview of spline properties and develop several different cases of inequality constrained optimization problems of this type. In particular, we develop the active set method and use it to solve these problems, emphasizing the fact that this algorithm will converge to a solution in finite iterations. Our solution will solve an open problem regarding near-interpolant spline curves. Furthermore, we supplement this with an iterative technique for better choosing data sites so …
Graphs Of Classroom Networks, Rebecca Holliday
Graphs Of Classroom Networks, Rebecca Holliday
Electronic Theses and Dissertations
In this work, we use the Havel-Hakimi algorithm to visualize data collected from students to investigate classroom networks. The Havel-Hakimi algorithm uses a recursive method to create a simple graph from a graphical degree sequence. In this case, the degree sequence is a representation of the students in a classroom, and we use the number of peers with whom a student studied or collaborated to determine the degree of each. We expand upon the Havel-Hakimi algorithm by coding a program in MATLAB that generates random graphs with the same degree sequence. Then, we run another algorithm to find the isomorphism …
Structure Vs. Properties Using Chemical Graph Theory, Tabitha N. Williford
Structure Vs. Properties Using Chemical Graph Theory, Tabitha N. Williford
Electronic Theses and Dissertations
Chemical graph theory began as a way for mathematicians to bring together the areas of the Physical Sciences and Mathematics. Through its use, mathematicians are able to model chemical systems, predict their properties as well as structure-property relationships. In this dissertation, we consider two questions involving chemical graph theory and its applications. We first look at tree-like polyphenyl systems, which form an important family of compounds in Chemistry, particularly in Material Science. The importance can be seen in LEDs, transmitters, and electronics. In recent years, many extremal results regarding such systems under specific constraints have been reported. More specifically are …
Adaptive State Feedback Control Of Lorenz Systems To Its Non-Trivial Equilibrium, Anh V. Tran
Adaptive State Feedback Control Of Lorenz Systems To Its Non-Trivial Equilibrium, Anh V. Tran
Electronic Theses and Dissertations
The complex Lorenz system is a simplified nonlinear dynamical system, which is derived from the Navier-Stokes equations that govern a closed thermal convection loop. The Lorenz system is chaotic for large Rayleigh number. In this chaotic regime, we implement a linear state feedback controller to stabilize the state trajectory at its original nontrivial equilibrium. The state variable for feedback is easily measurable. The system is proved to be globally asymptotically stable with a optimal feedback gain. The stability bound is improved over the previous result. We also established globally stability of the adaptively control system, where the system parameters are …
Epistasis In Predator-Prey Relationships, Iuliia Inozemtseva
Epistasis In Predator-Prey Relationships, Iuliia Inozemtseva
Electronic Theses and Dissertations
Epistasis is the interaction between two or more genes to control a single phenotype. We model epistasis of the prey in a two-locus two-allele problem in a basic predator- prey relationship. The resulting model allows us to examine both population sizes as well as genotypic and phenotypic frequencies. In the context of several numerical examples, we show that if epistasis results in an undesirable or desirable phenotype in the prey by making the particular genotype more or less susceptible to the predator or dangerous to the predator, elimination of undesirable phenotypes and then genotypes occurs.
Selection Of Step Size For Total Variation Minimization In Ct, Anna N. Yeboah
Selection Of Step Size For Total Variation Minimization In Ct, Anna N. Yeboah
Electronic Theses and Dissertations
Medical image reconstruction by total variation minimization is a newly developed area in computed tomography (CT). In compressed sensing literature, it hasbeen shown that signals with sparse representations in an orthonormal basis may be reconstructed via l1-minimization. Furthermore, if an image can be approximately modeled to be piecewise constant, then its gradient is sparse. The application of l1-minimization to a sparse gradient, known as total variation minimization, may then be used to recover the image. In this paper, the steepest descent method is employed to update the approximation of the image. We propose a way to estimate an optimal step …
Generating Surfaces Of Variable Eccentricity Within A Ray Tracer, Joshua A. Smith
Generating Surfaces Of Variable Eccentricity Within A Ray Tracer, Joshua A. Smith
Electronic Theses and Dissertations
Polynomial surfaces used in ray tracing have recently been improved upon allowing for three dimensional applications. Among these are surfaces that have a varying eccentricity. This paper will discuss a method for finding real roots of polynomials [allowing us to create these surfaces]. First, we will give the reader a basic comprehension of the workings of a ray tracer, a general understanding of three dimensional polynomial surfaces, how this newly implemented root finder functions, and how these concepts enable us to create surfaces of variable eccentricity. Then, examples will be provided to demonstrate the capabilities of the program.
Full Newton Step Interior Point Method For Linear Complementarity Problem Over Symmetric Cones, Andrii Berdnikov
Full Newton Step Interior Point Method For Linear Complementarity Problem Over Symmetric Cones, Andrii Berdnikov
Electronic Theses and Dissertations
In this thesis, we present a new Feasible Interior-Point Method (IPM) for Linear Complementarity Problem (LPC) over Symmetric Cones. The advantage of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of parameters we prove the global convergence of iterates which always stay in the the central path neighborhood. A global convergence of the method is proved and an upper bound for the number of iterations necessary to find ε-approximate solution of the problem is presented.
Pressure Poisson Method For The Incompressible Navier-Stokes Equations Using Galerkin Finite Elements, John Cornthwaite
Pressure Poisson Method For The Incompressible Navier-Stokes Equations Using Galerkin Finite Elements, John Cornthwaite
Electronic Theses and Dissertations
In this thesis we examine the Navier-Stokes equations (NSE) with the continuity equation replaced by a pressure Poisson equation (PPE). Appropriate boundary conditions are developed for the PPE, which allow for a fully decoupled numerical scheme to recover the pressure. The variational form of the NSE with PPE is derived and used in the Galerkin Finite Element discretization. The Galerkin finite element method is then used to solve the NSE with PPE. Moderate accuracy is shown.
Computational Fluid Dynamics (Cfd) Modeling Of A Laboratory Scale Coal Gasifier, Kiel S. Schultheiss
Computational Fluid Dynamics (Cfd) Modeling Of A Laboratory Scale Coal Gasifier, Kiel S. Schultheiss
Electronic Theses and Dissertations
Furthering gasification technology is an essential part of advancing clean coal technologies. In order to seek insight into the appropriate operations for the formation of synthetic gas (syngas) a numerical simulation was performed to predict the phenomena of coal gasification in a laboratory scale entrained-flow coal gasifier. The mesh for the model was developed with ICEM CFD software and the chemical and physical phenomena were modeled using the fluid flow solver ANSYS FLUENT. Mesh independence was verified. The model was validated with experimental data from several studies performed on a laboratory scale gasifier.
Systematic examination of the model was performed …
Infeasible Full-Newton-Step Interior-Point Method For The Linear Complementarity Problems, Antré Marquel Drummer
Infeasible Full-Newton-Step Interior-Point Method For The Linear Complementarity Problems, Antré Marquel Drummer
Electronic Theses and Dissertations
In this tesis, we present a new Infeasible Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters the iterates are forced to stay in the neighborhood of the central path, hence, still guaranteeing the global convergence of the method under strict feasibility assumption. The number of iterations necessary to find -approximate solution of the problem matches the best known iteration bounds for these types of methods. The preliminary implementation of the method …