SEARCH · Search NASA

Results for “linear systems”

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.

SourceResearch connectionFrom yearThrough year

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

At least 955 records · Page 53

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Solving sparse finite element problems on neuromorphic hardware

The finite element method (FEM) is one of the most important and ubiquitous numerical methods for solving partial differential equations (PDEs) on computers for scientific and engineering discovery. Applying the FEM to larger and more detailed scientific models has driven advances in high-performance computing for decades. Here we demonstrate that scalable spiking neuromorphic hardware can directly implement the FEM by constructing a spiking neural network that solves the large, sparse, linear systems of equations at the core of the FEM. We show that for the Poisson equation, a fundamental PDE in science and engineering, our neural circuit achieves meaningful levels of numerical accuracy and close to ideal scaling on modern, inherently parallel and energy-efficient neuromorphic hardware, specifically Intel’s Loihi 2 neuromorphic platform. We illustrate extensions to irregular mesh geometries in both two and three dimensions as well as other PDEs such as linear elasticity. Our spiking neural network is constructed from a recurrent network model of the brain’s motor cortex and, in contrast to black-box deep artificial neural network-based methods for PDEs, directly translates the well-understood and trusted mathematics of the FEM to a natively spiking neuromorphic algorithm.

Applied mathematics↗

DOE OSTI2021

System and method for focal-plane illuminator/detector (FASID) design for improved graded index lenses

The present disclosure relates to a detector system for imaging an optical signal received by a graded index (GRIN) optical element to account for known variations in a graded index distribution of the GRIN optical element. The detector system incorporates a plurality of optical detector elements configured to receive optical rays received by the GRIN optical element at specific locations on a plane of the GRIN optical element. Ray tracing software is configured to receive and map the optical rays to a plurality of additional specific locations on the plane based on the known variations in the graded index distribution of the GRIN optical element. A processor uses algorithms for diagonalization of a linear system matrix to determine information on both an intensity and an angle of the received optical rays at each one of the plurality of specific locations on the plane.

Bude, Jeffrey Devin↗

NASA NTRS1992

Least-squares finite element solution of 3D incompressible Navier-Stokes problems

Although significant progress has been made in the finite element solution of incompressible viscous flow problems. Development of more efficient methods is still needed before large-scale computation of 3D problems becomes feasible. This paper presents such a development. The most popular finite element method for the solution of incompressible Navier-Stokes equations is the classic Galerkin mixed method based on the velocity-pressure formulation. The mixed method requires the use of different elements to interpolate the velocity and the pressure in order to satisfy the Ladyzhenskaya-Babuska-Brezzi (LBB) condition for the existence of the solution. On the other hand, due to the lack of symmetry and positive definiteness of the linear equations arising from the mixed method, iterative methods for the solution of linear systems have been hard to come by. Therefore, direct Gaussian elimination has been considered the only viable method for solving the systems. But, for three-dimensional problems, the computer resources required by a direct method become prohibitively large. In order to overcome these difficulties, a least-squares finite element method (LSFEM) has been developed. This method is based on the first-order velocity-pressure-vorticity formulation. In this paper the LSFEM is extended for the solution of three-dimensional incompressible Navier-Stokes equations written in the following first-order quasi-linear velocity-pressure-vorticity formulation.

Jiang, Bo-Nan↗

NASA NTRS2017

Practical Methodology for the Inclusion of Nonlinear Slosh Damping in the Stability Analysis of Liquid-Propelled Space Vehicles

One of the challenges of developing flight control systems for liquid-propelled space vehicles is ensuring stability and performance in the presence of parasitic minimally damped slosh dynamics in the liquid propellants. This can be especially difficult when the fundamental frequencies of the slosh motions are in proximity to the frequency used for vehicle control. The challenge is partially alleviated since the energy dissipation and effective damping in the slosh modes increases with amplitude. However, traditional launch vehicle control design methodology is performed with linearized systems using a fixed slosh damping corresponding to a slosh motion amplitude based on heritage values. This papers presents a method for performing the control design and analysis using damping at slosh amplitudes chosen based on the resulting limit cycle amplitude of the vehicle thrust vector system due to a control-slosh interaction under degraded phase and gain margin conditions.

Ottander, John A.↗

NASA NTRS2017

Practical Methodology for the Inclusion of Nonlinear Slosh Damping in the Stability Analysis of Liquid-propelled Space Vehicles

Ottander, John A.↗

NASA NTRS1990

Bounding the states of systems with unknown-but-bounded disturbances

Control systems with hard constraints on certain variables are characterized, in an analytical review of recent investigations based on an unknown-but-bounded description of magnitude uncertainties. Hard-constraint problems typically arise in the design of controllers for potentially hazardous systems such as nuclear power plants. Consideration is given to norm bounds based on matrix measures, extensions of Schweppe's (1968) ellipsoid bounds, and set-theoretic regulator design. The performance of these approaches is evaluated by means of numerical simulations involving a third-order nonlinear steam-boiler model; the results are presented in graphs, and it is found that ellipsoid bounds are tightest in the general case, but that box bounds are even tighter for linear systems with Metzler system matrices.

Tsai, Wei K.↗

NASA NTRS2008

A Verification-Driven Approach to Control Analysis and Tuning

This paper proposes a methodology for the analysis and tuning of controllers using control verification metrics. These metrics, which are introduced in a companion paper, measure the size of the largest uncertainty set of a given class for which the closed-loop specifications are satisfied. This framework integrates deterministic and probabilistic uncertainty models into a setting that enables the deformation of sets in the parameter space, the control design space, and in the union of these two spaces. In regard to control analysis, we propose strategies that enable bounding regions of the design space where the specifications are satisfied by all the closed-loop systems associated with a prescribed uncertainty set. When this is unfeasible, we bound regions where the probability of satisfying the requirements exceeds a prescribed value. In regard to control tuning, we propose strategies for the improvement of the robust characteristics of a baseline controller. Some of these strategies use multi-point approximations to the control verification metrics in order to alleviate the numerical burden of solving a min-max problem. Since this methodology targets non-linear systems having an arbitrary, possibly implicit, functional dependency on the uncertain parameters and for which high-fidelity simulations are available, they are applicable to realistic engineering problems..

Crespo, Luis G.↗

NASA NTRS1971

On stochastic control and optimal measurement strategies

The control of stochastic dynamic systems is studied with particular emphasis on those which influence the quality or nature of the measurements which are made to effect control. Four main areas are discussed: (1) the meaning of stochastic optimality and the means by which dynamic programming may be applied to solve a combined control/measurement problem; (2) a technique by which it is possible to apply deterministic methods, specifically the minimum principle, to the study of stochastic problems; (3) the methods described are applied to linear systems with Gaussian disturbances to study the structure of the resulting control system; and (4) several applications are considered.

Kramer, L. C.↗

NASA NTRS1981

Graph theory approach to the eigenvalue problem of large space structures

Graph theory is used to obtain numerical solutions to eigenvalue problems of large space structures (LSS) characterized by a state vector of large dimensions. The LSS are considered as large, flexible systems requiring both orientation and surface shape control. Graphic interpretation of the determinant of a matrix is employed to reduce a higher dimensional matrix into combinations of smaller dimensional sub-matrices. The reduction is implemented by means of a Boolean equivalent of the original matrices formulated to obtain smaller dimensional equivalents of the original numerical matrix. Computation time becomes less and more accurate solutions are possible. An example is provided in the form of a free-free square plate. Linearized system equations and numerical values of a stiffness matrix are presented, featuring a state vector with 16 components.

Reddy, A. S. S. R.↗

DOE OSTI2021

ExaWind: Predictive Wind Energy Simulations

This presentation describes the ExaWind project and the team's progress in creating a suite of performance-portable codes designed for predictive simulations of wind farms on next-generation exascale-class supercomputers. Such simulations will require the resolution of scales spanning many orders of magnitude, from blade boundary layers to wind farm flow structures. In the U.S., the first exascale systems will be GPU accelerated, and different GPU manufacturers have been chosen for the different systems. At the heart of the ExaWind software is a hybrid-solver approach based on the codes Nalu-Wind and AMR-Wind, which are computational fluid dynamics solvers for the incompressible Navier-Stokes equations. Nalu-Wind is an unstructured-grid code used to resolve wind turbine geometry and blade boundary layers, whereas AMR-Wind is a structured-grid background solver for atmospheric turbulent flow and turbine wake propagation. The models are coupled with overset meshes and global linear systems are approximated through a loose-coupling algorithm. Results will include validation-quality high-fidelity simulations and strong/weak scaling results from the Summit supercomputer.

49 EE - Wind and Water Power Program - Wind (EE-4W↗

DOE OSTI2024

Milestone 49 Report: Batched Sparse LA Phase 5 Implementation

Batched sparse linear algebra operations in general, and solvers in particular, have become the major algorithmic development activity and foremost performance engineering effort in the numerical software libraries work on modern hardware with accelerators such as GPUs. Many applications, ECP and non-ECP alike, require simultaneous solutions of many small linear systems of equations that are structurally sparse in one form or another. In order to move towards high hardware utilization levels, it is important to provide these applications with appropriate interface designs to be both functionally efficient and performance portable and give full access to the appropriate batched sparse solvers running on modern hardware accelerators prevalent across DOE supercomputing sites since the inception of ECP. To this end, we present here a summary of recent advances on the interface designs in use by HPC software libraries supporting batched sparse linear algebra and the development of sparse batched kernel codes for solvers and preconditioners. We also address the potential interoperability opportunities to keep the corresponding software portable between the major hardware accelerators from AMD, Intel, and NVIDIA, while maintaining the appropriate disclosure levels conforming to the active NDA agreements. The presented interface specifications include a mix of batched band, sparse iterative, and sparse direct solvers with their accompanying functionality that is already required by the application codes or we anticipated to be needed in the near future. This report summarizes progress in Kokkos Kernels and the xSDK libraries MAGMA, Ginkgo, hypre, PETSc, and SuperLU.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Variational, stable, and self-consistent coupling of 3D electromagnetics to 1D transmission lines in the time domain

This work presents a new multiscale method for coupling the 3D Maxwell's equations to the 1D telegrapher's equations. While Maxwell's equations are appropriate for modeling complex electromagnetics in arbitrary-geometry domains, simulation cost for many applications (e.g. pulsed power) can be dramatically reduced by representing less complex transmission line regions of the domain with a 1D model. By assuming a transverse electromagnetic (TEM) ansatz for the solution in a transmission line region, we reduce the Maxwell's equations to the telegrapher's equations. Here, we propose a self-consistent finite element formulation of the fully coupled system that uses boundary integrals to couple between the 3D and 1D domains and supports arbitrary unstructured 3D meshes. Additionally, by using a Lagrange multiplier to enforce continuity at the coupling interface, we allow for an absorbing boundary condition to also be applied to non-TEM modes on this boundary. We demonstrate that this feature reduces non-physical reflection and ringing of non-TEM modes off of the coupling boundary. By employing implicit time integration, we ensure a stable coupling, and we introduce an efficient method for solving the resulting linear systems. We demonstrate the accuracy of the new method on two verification problems, a transient O-wave in a rectilinear prism and a steady-state problem in a coaxial geometry, and show the efficiency and weak scalability of our implementation on a cold test of the Z-machine MITL and post-hole convolute.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

Iterated Gauss-Seidel GMRES

The GMRES algorithm of Saad and Schultz [SIAM J. Sci. Stat. Comput., 7 (1986), pp. 856-869] is an iterative method for approximately solving linear systems Ax = b, with initial guess x0 and residual r0 = b Ax0. The algorithm employs the Arnoldi process to generate the Krylov basis vectors (the columns of Vk ). It is well known that this process can be viewed as a QR factorization of the matrix Bk = [r0, AVk] at each iteration. Despite an O (..epsilon..)..kappa.. (Bk ) loss of orthogonality, for unit roundoff ..epsilon..and condition number ..kappa.. , the modified Gram-Schmidt formulation was shown to be backward stable in the seminal paper by Paige et al. [SIAM J. Matrix Anal.Appl., 28 (2006), pp. 264-284]. We present an iterated Gauss-Seidel formulation of the GMRES algorithm (IGS-GMRES) based on the ideas of Ruhe [Linear Algebra Appl., 52 (1983), pp. 591-601] and Swirydowicz et al. [Numer. Linear Algebra Appl., 28 (2020), pp. 1-20]. IGS-GMRES maintains orthogonality to the level O (..epsilon..)..kappa.. (Bk ) or O (..epsilon..), depending on the choice of one or two iterations; for two Gauss-Seidel iterations, the computed Krylov basis vectors remain orthogonal to working accuracy and the smallest singular value of Vk remains close to one. The resulting GMRES method is thus backward stable. We show that IGS-GMRES can be implemented with only a single synchronization point per iteration, making it relevant to large-scale parallel computing environments. We also demonstrate that, unlike MGS-GMRES, in IGS-GMRES the relative Arnoldi residual corresponding to the computed approximate solution no longer stagnates above machine precision even for highly nonnormal systems.

Arnoldi-QR↗

NASA NTRS1994

Parallel Preconditioning for CFD Problems on the CM-5

Up to today, preconditioning methods on massively parallel systems have faced a major difficulty. The most successful preconditioning methods in terms of accelerating the convergence of the iterative solver such as incomplete LU factorizations are notoriously difficult to implement on parallel machines for two reasons: (1) the actual computation of the preconditioner is not very floating-point intensive, but requires a large amount of unstructured communication, and (2) the application of the preconditioning matrix in the iteration phase (i.e. triangular solves) are difficult to parallelize because of the recursive nature of the computation. Here we present a new approach to preconditioning for very large, sparse, unsymmetric, linear systems, which avoids both difficulties. We explicitly compute an approximate inverse to our original matrix. This new preconditioning matrix can be applied most efficiently for iterative methods on massively parallel machines, since the preconditioning phase involves only a matrix-vector multiplication, with possibly a dense matrix. Furthermore the actual computation of the preconditioning matrix has natural parallelism. For a problem of size n, the preconditioning matrix can be computed by solving n independent small least squares problems. The algorithm and its implementation on the Connection Machine CM-5 are discussed in detail and supported by extensive timings obtained from real problem data.

Simon, Horst D.↗

NASA NTRS1981

Nonlinear dynamic phenomena in the space shuttle thermal protection system

The development of an analysis for examining the nonlinear dynamic phenomena arising in the space shuttle orbiter tile/pad thermal protection system is presented. The tile/pad system consists of ceramic tiles bonded to the aluminum skin of the orbiter through a thin nylon felt pad. The pads are a soft nonlinear material which permits large strains and displays both hysteretic and nonlinear viscous damping. Application of the analysis to a square tile subjected to transverse sinusoidal motion of the orbiter skin is presented and the following nonlinear dynamic phenomena are considered: highly distorted wave forms, amplitude-dependent resonant frequencies which initially decrease and then increase with increasing amplitude of motion, magnification of substrate motion which is higher than would be expected in a similarly highly damped linear system, and classical parametric resonance instability.

Housner, J. M.↗

NASA NTRS1988

Dynamic analysis of nonlinear rotor-housing systems

Nonlinear analysis methods are developed which will enable the reliable prediction of the dynamic behavior of the space shuttle main engine (SSME) turbopumps in the presence of bearing clearances and other local nonlinearities. A computationally efficient convolution method, based on discretized Duhamel and transition matrix integral formulations, is developed for the transient analysis. In the formulation, the coupling forces due to the nonlinearities are treated as external forces acting on the coupled subsystems. Iteration is utilized to determine their magnitudes at each time increment. The method is applied to a nonlinear generic model of the high pressure oxygen turbopump (HPOTP). As compared to the fourth order Runge-Kutta numerical integration methods, the convolution approach proved to be more accurate and more highly efficient. For determining the nonlinear, steady-state periodic responses, an incremental harmonic balance method was also developed. The method was successfully used to determine dominantly harmonic and subharmonic responses fo the HPOTP generic model with bearing clearances. A reduction method similar to the impedance formulation utilized with linear systems is used to reduce the housing-rotor models to their coordinates at the bearing clearances. Recommendations are included for further development of the method, for extending the analysis to aperiodic and chaotic regimes and for conducting critical parameteric studies of the nonlinear response of the current SSME turbopumps.

Noah, Sherif T.↗

NASA NTRS1976

Applications Study of Aero-Maneuvering Orbit-to-Orbit Shuttle (AMOOS), Executive Summary

Preliminary designs and the supporting analysis for both the Aeromaneuvering Orbit-to-Orbit Shuttle (AMOOS) and the Aeromaneuvering Recovery System (AMRS) are presented. The AMOOS design is shown to yield from twice to almost three times the high energy, round-trip payloads as a purely propulsive vehicle of the same weight. Typically AMOOS can perform a crew rotation mission to equatorial geosynchronous orbit in one space shuttle launch. The flight test program analysis modeled parameters such as maximum dynamic pressure, heating rates, guidance, stability and recovery. Two model flight schedules were developed, one consisting of four flights and the other of two flights. The former is considered a very low risk, high information return program whereas the latter is a minimal cost program consistent with reasonable data returns and chance of success. The AMOOS and AMRS guidance scheme developed using linear regulator theory proved a precise and accurate guidance scheme. Both it and a classical linear system's based scheme were evaluated using 65 simulated trajectories in which the position in the entry corridor and the atmospheric density were varied randomly.

White, J.↗

DOE OSTI2023

Scaled ILU Smoothers for Navier-Stokes Pressure Projection

Incomplete LU (ILU) smoothers are effective in the algebraic multigrid (AMG) V-cycle for reducing high-frequency components of the error. However, the requisite direct triangular solves are comparatively slow on GPUs. Previous work has demonstrated the advantages of Jacobi iteration as an alternative to direct solution of these systems. Depending on the threshold and fill-level parameters chosen, the factors can be highly nonnormal and Jacobi is unlikely to converge in a low number of iterations. We demonstrate that row scaling can reduce the departure from normality, allowing us to replace the inherently sequential solve with a rapidly converging Richardson iteration. There are several advantages beyond the lower compute time. Scaling is performed locally for a diagonal block of the global matrix because it is applied directly to the factor. Further, an ILUT Schur complement smoother maintains a constant GMRES iteration count as the number of MPI ranks increases, and thus parallel strong-scaling is improved. Our algorithms have been incorporated into hypre, and we demonstrate improved time to solution for linear systems arising in the Nalu-Wind and PeleLM pressure solvers. For large problem sizes, GMRES+AMG executes at least five times faster when using iterative triangular solves compared with direct solves on massively parallel GPUs.

algebraic multigrid↗