Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear algebra”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,153 records · Page 64

The finite element method in shell stability analysis.

A development of the finite element method for thin shell instability analysis is presented, covering three principal aspects: (1) representation of shell geometry, (2) representation of element behavior, and (3) algorithmic tools for solution of the large-order systems of nonlinear algebraic equations which characterize various phases of shell instability. Two shell elements are described, an arbitrary quadrilateral and a triangle, and numerical results are presented for two widely-employed comparison problems for linear (stable) analysis. Two shell problems which include instability effects are also solved.-

Gallagher, R. H.↗

A new application of algebraic geometry to systems theory

Following an introduction to algebraic geometry, the dominant morphism theorem is stated, and the application of this theorem to systems-theoretic problems, such as the feedback problem, is discussed. The Gaussian elimination method used for solving linear equations is shown to be an example of a dominant morphism.

Martin, C. F.↗

State-space solutions to standard H2 and H(infinity) control problems

Simple state-space formulas are derived for all controllers solving the standard H(infinity) problem of finding, for a given number gamma greater than 0, all controllers such that the H(infinity) norm of the closed-loop transfer function is (strictly) less than gamma. It is known that a controller exists if and only if the unique stabilizing solutions to two algebraic Riccati equations are positive definite and the spectral radius of their product is less than gamma squared. Under these conditions, a parameterization of all controllers solving the problem is given as a linear fractional transformation (LFT) on a contractive stable free parameter. The state dimension of the coefficient matrix for the LFT, constructed using the two Riccati solutions, equals that of the plant and has a separation structure reminiscent of classical LQG (i.e., H2) theory. A standard H2 solution is developed in parallel.

Doyle, John C.↗

A Comparison of Classical and Aggregation-Based Algebraic Multigrid Preconditioners for High-Fidelity Simulation of Wind Turbine Incompressible Flows

This paper presents a comparison of parallel strong scaling performance of classical and aggregation algebraic multigrid (AMG) preconditioners in the context of wind turbine simulations. Fluid motion is governed by the incompressible Navier--Stokes equations, discretized in space with control-volume finite elements and in time with an inexact projection scheme using an implicit integrator. A discontinuous-Galerkin sliding-mesh algorithm captures rotor motion. The momentum equations are solved with iterative Krylov methods, preconditioned by symmetric Gauss--Seidel (SGS) in Trilinos and $\ell_1$ SGS in hypre. The mass-continuity equation is solved with GMRES preconditioned by AMG and can account for the majority of simulation time. Reducing this continuity solve time is crucial. Wind turbine simulations present two unique challenges for AMG preconditioned solvers: the computational meshes include strongly anisotropic elements, and mesh motion requires matrix reinitialization and computation of preconditioners at each time step. Detailed timing profiles are presented and analyzed, and best practices are discussed for both classical and aggregation-based AMG. Results are presented for simulations of two different wind turbines with up to 6 billion grid points on two different computer architectures. For moving mesh problems that require linear-system reinitialization, the well-established strategy of amortizing preconditioner setup costs over a large number of time steps to reduce the solve time is no longer valid. Instead, results show that faster time to solution is achieved by reducing preconditioner setup costs at the expense of linear-system solve costs. Standard smoothed aggregation with Chebyshev relaxation was found to perform poorly when compared with classical AMG in terms of solve time and robustness. However, plain aggregation was comparable to classical AMG.

97 MATHEMATICS AND COMPUTING↗

Enabling New Flexibility in the SUNDIALS Suite of Nonlinear and Differential/Algebraic Equation Solvers

In recent years, the SUite of Nonlinear and DIfferential/ALgebraic equation Solvers (SUNDIALS) has been redesigned to better enable the use of application-specific and third-party algebraic solvers and data structures. Throughout this work, we have adhered to specific guiding principles that minimized the impact to current users while providing maximum flexibility for later evolution of solvers and data structures. The redesign was done through the addition of new linear and nonlinear solvers classes, enhancements to the vector class, and the creation of modern Fortran interfaces. The vast majority of this work has been performed “behind-the-scenes,” with minimal changes to the user interface and no reduction in solver capabilities or performance. These changes allow SUNDIALS users to more easily utilize external solver libraries and create highly customized solvers, enabling greater flexibility on extreme-scale, heterogeneous computational architectures.

97 MATHEMATICS AND COMPUTING↗

A Comparison of Linear Solvers for Resolving Flow in Three-Dimensional Discrete Fracture Networks

We compare various methods for resolving steady flow within three-dimensional discrete fracture networks, including direct methods, Krylov subspace methods with and without preconditioning, and multi-grid methods. We compared the performance of the methods based on compute times and scaling of the solution as a function of the number of grid nodes and log-variance of the hydraulic aperture. The methods are applied to three test cases: (a) variable density of networks with a truncated power-law distribution of fracture lengths, (b) a fixed network composed of monodisperse fracture sizes but varied permeability/aperture heterogeneity, (c) and a network based on field site in Nevada, US. We chose these cases to allow us to study the impact of the mesh size and flow properties, as well as to demonstrate our conclusions on a large-scale, realistic problem (more than 40 million mesh nodes). A direct solution using Cholesky factorization outperformed other methods for every example but was closely followed in performance by some algebraic multigrid (AMG) preconditioned Krylov subspace methods. Among the Krylov methods, conjugate gradients (CG) with an AMG preconditioner performs the best. Generally, Cholesky factorization is recommended, but CG with an AMG preconditioner may be suitable for very large problems beyond 40 million nodes where the entire linear system cannot reside in memory.

58 GEOSCIENCES↗

A fast Fourier transform-based solver for elastic micropolar composites

This work presents a spectral micromechanical formulation for obtaining the full-field and homogenized response of elastic micropolar composites. The algorithm relies on a coupled set of convolution integral equations for the micropolar strains, where periodic Green’s operators associated with a linear homogeneous reference medium are convolved with functions of the Cauchy and couple stress fields that encode the material’s heterogeneity, as well as any potential material nonlinearity. Such convolution integral equations take an algebraic form in the reciprocal Fourier space that can be solved iteratively. In this vein, the fast Fourier transform (FFT) algorithm is leveraged to accelerate the numerical solution, resulting in a mesh-free formulation in which the periodic unit cell representing the heterogeneous material can be discretized by a regular grid of pixels in two dimensions (or voxels in three dimensions). For verification, the numerical solutions obtained with the micropolar FFT solver are compared with analytical solutions for a matrix with a dilute circular inclusion subjected to plane strain loading. The developed computational framework is then used to study length-scale effects and effective (micropolar) moduli of composites with various topological configurations.

97 MATHEMATICS AND COMPUTING↗

Modulation of ring-laser mode coupling.

This paper develops an analytical, algebraic formalism that predicts effects induced in ring lasers by phase modulation, corresponding both to mode-decoupling mechanisms deliberately incorporated in the ring laser and to naturally occurring periodic or random angular or linear accelerations. The analysis is based on an approach that seems potentially convenient in the analysis of other systems that are physically stable but mathematically nonlinear.

Whitney, C.↗

Symbolic computation of recurrence equations for the Chebyshev series solution of linear ODE's

If a linear ordinary differential equation with polynomial coefficients is converted into integrated form then the formal substitution of a Chebyshev series leads to recurrence equations defining the Chebyshev coefficients of the solution function. An explicit formula is presented for the polynomial coefficients of the integrated form in terms of the polynomial coefficients of the differential form. The symmetries arising from multiplication and integration of Chebyshev polynomials are exploited in deriving a general recurrence equation from which can be derived all of the linear equations defining the Chebyshev coefficients. Procedures for deriving the general recurrence equation are specified in a precise algorithmic notation suitable for translation into any of the languages for symbolic computation. The method is algebraic and it can therefore be applied to differential equations containing indeterminates.

Geddes, K. O.↗

A computational methodology for learning low-complexity surrogate models of process from experiments or simulations. (Paper 679a)

Costly and/or insufficiently robust simulations or experiments can often pose difficulties when their use extends well beyond a single evaluation. This is case with the numerous evaluations of uncertainty quantification, when an algebraic model is needed for optimization, as well as numerous other areas. To overcome these difficulties, we generate an accurate set of algebraic surrogate models of disaggregated process blocks of the experiment or simulation. We developed a method that uses derivative-based and derivative-free optimization alongside machine learning and statistical techniques to generate the set of surrogate models using data sampled from experiments or detailed simulations. Our method begins by building a low-complexity surrogate model for each block from an initial sample set. The model is built using a best subset technique that leverages a mixed-integer linear problem formulation to allow for very large initial basis sets. The models are then tested, exploited, and improved through the use of derivative-free solvers to adaptively sample new simulation or experimental points. The sets of surrogate models from each disaggregated process block are then combined with heat and mass balances around each disaggregated block to generate a full algebraic model of the process. The full model can be used for cheap and accurate evaluations of the original simulation or experiment or combined with design specifications and an objective for nonlinear optimization.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Gradient-based stochastic estimation of the density matrix

Fast estimation of the single-particle density matrix is key to many applications in quantum chemistry and condensed matter physics. The best numerical methods leverage the fact that the density matrix elements f(H) ij decay rapidly with distance rij between orbitals. This decay is usually exponential. However, for the special case of metals at zero temperature, algebraic decay of the density matrix appears and poses a significant numerical challenge. Here, we introduce a gradient-based probing method to estimate all local density matrix elements at a computational cost that scales linearly with system size. For zero-temperature metals, the stochastic error scales like S -(d+2)/2d , where d is the dimension and S is a prefactor to the computational cost. The convergence becomes exponential if the system is at finite temperature or is insulating.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Robustness of linear quadratic state feedback designs in the presence of system uncertainty

The paper deals with the problem of expressing the robustness (stability) property of a linear quadratic state feedback (LQSF) design quantitatively in terms of bounds on the perturbations (modeling errors or parameter variations) in the system matrices so that the closed-loop system remains stable. Nonlinear time-varying and linear time-invariant perturbations are considered. The only computation required in obtaining a measure of the robustness of an LQSF design is to determine the eigenvalues of two symmetric matrices determined when solving the algebraic Riccati equation corresponding to the LQSF design problem. Results are applied to a complex dynamic system consisting of the flare control of a STOL aircraft. The design of the flare control is formulated as an LQSF tracking problem.

Patel, R. V.↗

Application of the Finite Element Method to Rotary Wing Aeroelasticity

A finite element method for the spatial discretization of the dynamic equations of equilibrium governing rotary-wing aeroelastic problems is presented. Formulation of the finite element equations is based on weighted Galerkin residuals. This Galerkin finite element method reduces algebraic manipulative labor significantly, when compared to the application of the global Galerkin method in similar problems. The coupled flap-lag aeroelastic stability boundaries of hingeless helicopter rotor blades in hover are calculated. The linearized dynamic equations are reduced to the standard eigenvalue problem from which the aeroelastic stability boundaries are obtained. The convergence properties of the Galerkin finite element method are studied numerically by refining the discretization process. Results indicate that four or five elements suffice to capture the dynamics of the blade with the same accuracy as the global Galerkin method.

Straub, F. K.↗

Solution of steady-state, two-dimensional conservation laws by mathematical programming

A truly two-dimensional algorithm is created for solving the steady-state two-dimensional conservation-law problem. An overdetermined system of algebraic equations is obtained through discretization by finite-volume formulas. These equations are perturbed nonsingularly and are solved by an efficient geometrically oriented l(1) procedure. The basic algorithm and the theory for the linear case f(u) = u are presented, and computational results for the nonlinear case f(u) = sq u are also analyzed. It is noted that the l(1) procedure captures boundary shocks as well as oblige and zigzag interior shocks in bands that are one cell wide, and the solution values are accurate up to the edge of the shock.

Lavery, John E.↗

Angular-Rate Estimation Using Delayed Quaternion Measurements

This paper presents algorithms for estimating the angular-rate vector of satellites using quaternion measurements. Two approaches are compared one that uses differentiated quaternion measurements to yield coarse rate measurements, which are then fed into two different estimators. In the other approach the raw quaternion measurements themselves are fed directly into the two estimators. The two estimators rely on the ability to decompose the non-linear part of the rotas rotational dynamics equation of a body into a product of an angular-rate dependent matrix and the angular-rate vector itself. This non unique decomposition, enables the treatment of the nonlinear spacecraft (SC) dynamics model as a linear one and, thus, the application of a PseudoLinear Kalman Filter (PSELIKA). It also enables the application of a special Kalman filter which is based on the use of the solution of the State Dependent Algebraic Riccati Equation (SDARE) in order to compute the gain matrix and thus eliminates the need to compute recursively the filter covariance matrix. The replacement of the rotational dynamics by a simple Markov model is also examined. In this paper special consideration is given to the problem of delayed quaternion measurements. Two solutions to this problem are suggested and tested. Real Rossi X-Ray Timing Explorer (RXTE) data is used to test these algorithms, and results are presented.

Azor, R.↗

Polar Phase of One-dimensional Bosons with Large Spin

Spinor ultracold gases in one dimension (1D) represent an interesting example of strongly correlated quantum fluids. They have a rich phase diagram and exhibit a variety of quantum phase transitions. We consider a 1D spinor gas of bosons with a large spin S. A particular example is the gas of chromium atoms (S = 3), where the dipolar collisions efficiently change the magnetization and make the system sensitive to the linear Zeeman effect. We argue that in 1D the most interesting effects come from the pairing interaction. If this interaction is negative, it gives rise to a (quasi)condensate of singlet bosonic pairs with an algebraic order at zero temperature, and for (2S+1) >> 1 the saddle point approximation leads to physically transparent results. Since in 1D one needs a finite energy to destroy a pair, the spectrum of spin excitations has a gap. Hence, in the absence of a magnetic field, there is only one gapless mode corresponding to phase fluctuations of the pair quasicondensate. Once the magnetic field exceeds the gap, another condensate emerges, namely the quasicondensate of unpaired bosons with spins aligned along the magnetic field. The spectrum then contains two gapless modes corresponding to the singlet-paired and spin-aligned unpaired Bose condensed particles, respectively. At T = 0, the corresponding phase transition is of the commensurate-incommensurate type.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Polyhedral approximation in mixed-integer convex optimization

Generalizing both mixed-integer linear optimization and convex optimization, mixed-integer convex optimization possesses broad modeling power but has seen relatively few advances in general-purpose solvers in recent years. Here, we intend to provide a broadly accessible introduction to our recent work in developing algorithms and software for this problem class. Our approach is based on constructing polyhedral outer approximations of the convex constraints, resulting in a global solution by solving a finite number of mixed-integer linear and continuous convex subproblems. The key advance we present is to strengthen the polyhedral approximations by constructing them in a higher-dimensional space. In order to automate this extended formulation we rely on the algebraic modeling technique of disciplined convex programming (DCP), and for generality and ease of implementation we use conic representations of the convex constraints. Although our framework requires a manual translation of existing models into DCP form, after performing this transformation on the MINLPLIB2 benchmark library we were able to solve a number of unsolved instances and on many other instances achieve superior performance compared with state-of-the-art solvers like Bonmin, SCIP, and Artelys Knitro.

97 MATHEMATICS AND COMPUTING↗

Optimizing Power–Frequency Droop Characteristics of Distributed Energy Resources

This paper outlines a procedure to design power-frequency droop slopes for distributed energy resources (DERs) installed in distribution networks to optimally participate in primary frequency response. In particular, the droop slopes are engineered such that DERs respond in proportion to their power ratings and they are not unfairly penalized in power provisioning based on their location in the distribution network. The main contribution of our approach is that a guaranteed level of frequency regulation can be guaranteed at the feeder head, while ensuring that the outputs of individual DERs conform to some well-defined notion of fairness. The approach we adopt leverages an optimization-based perspective and suitable linearizations of the power-flow equations to embed notions of fairness and information regarding the physics of the power flows within the distribution network into the droop slopes. Time-domain simulations from a differential algebraic equation model of the 39-bus New England test-case system augmented with three instances of the IEEE 37-node distribution-network with frequency-sensitive DERs are provided to validate our approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗