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 973 records · Page 54

Private algebras in quantum information and infinite-dimensional complementarity

We introduce a generalized framework for private quantum codes using von Neumann algebras and the structure of commutants. This leads naturally to a more general notion of complementary channel, which we use to establish a generalized complementarity theorem between private and correctable subalgebras that applies to both the finite and infinite-dimensional settings. Linear bosonic channels are considered and specific examples of Gaussian quantum channels are given to illustrate the new framework together with the complementarity theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Turbulent Spot Pressure Fluctuation Wave Packet Model

Wave packet analysis provides a connection between linear small disturbance theory and subsequent nonlinear turbulent spot flow behavior. The traditional association between linear stability analysis and nonlinear wave form is developed via the method of stationary phase whereby asymptotic (simplified) mean flow solutions are used to estimate dispersion behavior and stationary phase approximation are used to invert the associated Fourier transform. The resulting process typically requires nonlinear algebraic equations inversions that can be best performed numerically, which partially mitigates the value of the approximation as compared to a more complete, e.g. DNS or linear/nonlinear adjoint methods. To obtain a simpler, closed-form analytical result, the complete packet solution is modeled via approximate amplitude (linear convected kinematic wave initial value problem) and local sinusoidal (wave equation) expressions. Significantly, the initial value for the kinematic wave transport expression follows from a separable variable coefficient approximation to the linearized pressure fluctuation Poisson expression. The resulting amplitude solution, while approximate in nature, nonetheless, appears to mimic many of the global features, e.g. transitional flow intermittency and pressure fluctuation magnitude behavior. A low wave number wave packet models also recover meaningful auto-correlation and low frequency spectral behaviors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Symmetries of the refined D1/D5 BPS spectrum

We examine the large N 1/4-BPS spectrum of the symmetric orbifold CFT Sym N ( M ) deformed to the supergravity point in moduli space for M = K 3 and T 4 . We consider refinement under both left- and right-moving SU(2) R symmetries of the superconformal algebra, and decompose the spectrum into characters of the algebra. We find that at large N the character decomposition satisfies an unusual property, in which the degeneracy only depends on a certain linear combination of left- and right-moving quantum numbers, suggesting deeper symmetry structure. Furthermore, we consider the action of discrete symmetry groups on these degeneracies, where certain subgroups of the Conway group are known to play a role. We also comment on the potential for larger discrete symmetry groups to appear in the large N limit.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Suboptimal design of a class of nonlinear controllers.

A systematic design procedure is presented for suboptimal nonlinear controller synthesis. Such a control yields faster response characteristics than are normally possible with a linear controller. The technique is geared to single-input linear systems where excursions of one state variable are of more importance than others. Design steps are formulated in terms of readily applicable algebraic equations. The proposed method is applied to several design examples and the advantages are shown by comparison with the results obtained from existing techniques.

Rouse, W. B.↗

Algebraic multigrid methods applied to problems in computational structural mechanics

The development of algebraic multigrid (AMG) methods and their application to certain problems in structural mechanics are described with emphasis on two- and three-dimensional linear elasticity equations and the 'jacket problems' (three-dimensional beam structures). Various possible extensions of AMG are also described. The basic idea of AMG is to develop the discretization sequence based on the target matrix and not the differential equation. Therefore, the matrix is analyzed for certain dependencies that permit the proper construction of coarser matrices and attendant transfer operators. In this manner, AMG appears to be adaptable to structural analysis applications.

Mccormick, Steve↗

Computation and sensitivity considerations of the Ricatti equation in spacecraft CMG steering laws

The steady-state matrix Ricatti equation is studied with respect to sensitivity and computational burden for a linear regulator controller in spacecraft. The class of systems studied use control moment gyros (CMGs) as the torque driver, assuming that the CMGs are free of gimbal stops. Different solution techniques are evaluated relative to computation time and accuracy to determine which solution method is most acceptable with respect to the prescribed requirements. It is shown that it is not feasible to eliminate off-diagonal Ricatti equation terms in the relevent updata equation due to their high sensitivity, that Potter's algebraic technique requires the least computation time of the methods studied, and that the simple Euler method yields the best results when accuracy and computation time are equally weighted. If an optimal linear regulator formulation is employed, a full Ricatti equation solution of n(n + 1)2 elements of the symmetric positive definite gain matrix which is the solution to the matrix Ricatti equation must be computed at each update cycle.

Colburn, B. K.↗

Controller scheduling - A possible algebraic viewpoint

In the applications, one common way to design a control system for a nonlinear plant is to localize its behavior along lines of operation specified by the plant manufacturer, to develop linear multi-variable controls for these localizations, and to schedule those controls with key plant variables which vary smoothly along operating lines. An important part of practical design lore, the art of controller scheduling has received little modern attention from the conceptual point of view. This paper describes four basic types of scheduling questions and outlines some of the theoretical issues associated with them. Schedules are considered in terms of state equations; however, some relations with the input/output description are discussed, together with an analysis of the effects on the overall configuration of approximations made to the individual subsystems.

Sain, M.↗

GRID2D/3D: A computer program for generating grid systems in complex-shaped two- and three-dimensional spatial domains. Part 2: User's manual and program listing

An efficient computer program, called GRID2D/3D, was developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2- and 3-D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation in which the distribution of grid points within the spatial domain is controlled by stretching functions. All single grid systems generated by GRID2D/3D can have grid lines that are continuous and differentiable everywhere up to the second-order. Also, grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For continuous composite grid systems, the grid lines are continuous and differentiable everywhere up to the second-order except at interfaces where different single grid systems meet. At interfaces where different single grid systems meet, the grid lines are only differentiable up to the first-order. For 2-D spatial domains, the boundary curves are described by using either cubic or tension spline interpolation. For 3-D spatial domains, the boundary surfaces are described by using either linear Coon's interpolation, bi-hyperbolic spline interpolation, or a new technique referred to as 3-D bi-directional Hermite interpolation. Since grid systems generated by algebraic methods can have grid lines that overlap one another, GRID2D/3D contains a graphics package for evaluating the grid systems generated. With the graphics package, the user can generate grid systems in an interactive manner with the grid generation part of GRID2D/3D. GRID2D/3D is written in FORTRAN 77 and can be run on any IBM PC, XT, or AT compatible computer. In order to use GRID2D/3D on workstations or mainframe computers, some minor modifications must be made in the graphics part of the program; no modifications are needed in the grid generation part of the program. The theory and method used in GRID2D/3D is described.

Bailey, R. T.↗

GRID2D/3D: A computer program for generating grid systems in complex-shaped two- and three-dimensional spatial domains. Part 1: Theory and method

An efficient computer program, called GRID2D/3D was developed to generate single and composite grid systems within geometrically complex two- and three-dimensional (2- and 3-D) spatial domains that can deform with time. GRID2D/3D generates single grid systems by using algebraic grid generation methods based on transfinite interpolation in which the distribution of grid points within the spatial domain is controlled by stretching functions. All single grid systems generated by GRID2D/3D can have grid lines that are continuous and differentiable everywhere up to the second-order. Also, grid lines can intersect boundaries of the spatial domain orthogonally. GRID2D/3D generates composite grid systems by patching together two or more single grid systems. The patching can be discontinuous or continuous. For continuous composite grid systems, the grid lines are continuous and differentiable everywhere up to the second-order except at interfaces where different single grid systems meet. At interfaces where different single grid systems meet, the grid lines are only differentiable up to the first-order. For 2-D spatial domains, the boundary curves are described by using either cubic or tension spline interpolation. For 3-D spatial domains, the boundary surfaces are described by using either linear Coon's interpolation, bi-hyperbolic spline interpolation, or a new technique referred to as 3-D bi-directional Hermite interpolation. Since grid systems generated by algebraic methods can have grid lines that overlap one another, GRID2D/3D contains a graphics package for evaluating the grid systems generated. With the graphics package, the user can generate grid systems in an interactive manner with the grid generation part of GRID2D/3D. GRID2D/3D is written in FORTRAN 77 and can be run on any IBM PC, XT, or AT compatible computer. In order to use GRID2D/3D on workstations or mainframe computers, some minor modifications must be made in the graphics part of the program; no modifications are needed in the grid generation part of the program. This technical memorandum describes the theory and method used in GRID2D/3D.

Shih, T. I.-P.↗

Final Report, DE-FG01-06ER25718 Domain Decomposition and Parallel Computing

The goal of this project is to develop and improve domain decomposition algorithms for a variety of partial differential equations such as those of linear elasticity and electro-magnetics.These iterative methods are designed for massively parallel computing systems and allow the fast solution of the very large systems of algebraic equations that arise in large scale and complicated simulations. A special emphasis is placed on problems arising from Maxwell's equation. The approximate solvers, the preconditioners, are combined with the conjugate gradient method and must always include a solver of a coarse model in order to have a performance which is independent of the number of processors used in the computer simulation. A recent development allows for an adaptive construction of this coarse component of the preconditioner.

97 MATHEMATICS AND COMPUTING↗

A new approach to the design of time varying control systems with application to the space shuttle booster

A general approach toward the analysis and design of closed loop control for slowly time-varying linear systems was investigated. The approach is by the method of generalized multiple scales, in which slow and fast dynamics are systematically separated by employing different clocks which measure time at varying rates. The clocks, which are necessarily nonlinear functions of time, so that the system dynamics are asymptotically invariant with respect to the new time scale. A transfer function relating the output to the input for general linear slowly time-varying systems is developed and represents the actual system under certain conditions. The clock functions are shown to satisfy an algebraic characteristic equation and can be determined in general in terms of the coefficients.

Ramnath, R. V.↗

A new approach to enforcing discrete maximum principles in continuous Galerkin methods for convection-dominated transport equations

This work introduces a set of design principles and new algorithmic tools for enforcing maximum principles and/or positivity preservation in continuous finite element approximations to convection-dominated transport problems. Enabling a linear first-order advection equation as a model problem, we address the design of first-order artificial diffusion operators and their higherorder counterparts at the element matrix level. The proposed methodology leads to a nonlinear high-resolution scheme capable of resolving moving fronts and internal/boundary layers as sharp localized nonoscillatory features. The amount of numerical dissipation depends on the difference between the solution value at a given node and a local maximum or minimum. The shockcapturing numerical diffusion coefficient is designed to vanish as the nodal values approach a mass-weighted or linearity-preserving average. The universal applicability and simplicity of the element-based limiting procedure makes it an attractive alternative to edge-based algebraic flux correction.

Kuzmin, D.↗

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗

Decreasing the temporal complexity for nonlinear, implicit reduced-order models by forecasting

Implicit numerical integration of nonlinear ODEs requires solving a system of nonlinear algebraic equations at each time step. Each of these systems is often solved by a Newton-like method, which incurs a sequence of linear-system solves. Most model-reduction techniques for nonlinear ODEs exploit knowledge of system's spatial behavior to reduce the computational complexity of each linear-system solve. However, the number of linear-system solves for the reduced-order simulation often remains roughly the same as that for the full-order simulation. We propose exploiting knowledge of the model's temporal behavior to (1) forecast the unknown variable of the reduced-order system of nonlinear equations at future time steps, and (2) use this forecast as an initial guess for the Newton-like solver during the reduced-order-model simulation. To compute the forecast, we propose using the Gappy POD technique. As a result, the goal is to generate an accurate initial guess so that the Newton solver requires many fewer iterations to converge, thereby decreasing the number of linear-system solves in the reduced-order-model simulation.

97 MATHEMATICS AND COMPUTING↗

A fully implicit, asymptotic-preserving, semi-Lagrangian algorithm for the time dependent anisotropic heat transport equation

In this paper, we extend the operator-split asymptotic-preserving, semi-Lagrangian algorithm for time dependent anisotropic heat transport equation proposed in Chacón et al. (2014) [18] to use a fully implicit time integration with backward differentiation formulas. The proposed implicit method can deal with arbitrary heat-transport anisotropy ratios $\mathcal{X}$∥ /$ \mathcal{X}$⟂ $\ggg$ 1 (with $\mathcal{X}$∥, $ \mathcal{X}$⟂ the parallel and perpendicular heat diffusivities, respectively) in complicated magnetic field topologies in an accurate and efficient manner. Further, the implicit algorithm is second-order accurate temporally and demonstrates an accurate treatment at boundary layers (e.g., island separatrices), which was not ensured by the operator-split implementation. The condition number of the resulting algebraic system is independent of the anisotropy ratio, and is inverted with preconditioned GMRES. We propose a simple preconditioner that renders the finite-dimensional linear operator compact, resulting in mesh-independent convergence rates for topologically simple magnetic fields, and convergence rates scaling as ~ (NΔt) 1/4 (with N the total mesh size and Δt the timestep) in topologically complex magnetic-field configurations. We demonstrate the accuracy and performance of the approach with test problems of varying complexity, including an analytically tractable boundary-layer problem in a straight magnetic field, and a topologically complex magnetic field featuring magnetic islands with extreme anisotropy ratios $\mathcal{X}$∥ /$ \mathcal{X}$⟂ = 10 10 ) .

97 MATHEMATICS AND COMPUTING↗