SEARCH · Engineering Papers

Results for “Numerical 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.

SourceResearch connectionFrom yearThrough year

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

At least 217 records · Page 12

All sources NASA NTRS DOE OSTI

NASA NTRS1974

REDUCE 2: A computer program for the symbolic reduction of large block diagrams

REDUCE 2 is reported as a FORMAC program which symbolically calculates the transfer function(s) of any linear-block-diagram output variable to any or all input variables. The program requires as input a set of algebraic expressions representing the block diagram, the desired transfer function(s), and a string of variables indicating the desired order of reduction. The solution is presented in the compact form of a set of nested functions (super G's). The program can handle systems as large as 600 equations and is intended as a tool for the analysis of complex control and dynamic systems. A companion FORTRAN program, EVAL 2, which numerically evaluates the solution set to obtain amplitude ratio and phase angle as functions of frequency is also presented.

Lorenzo, C. F.↗

NASA NTRS1977

Exact solution of some linear matrix equations using algebraic methods

A study is done of solution methods for Linear Matrix Equations including Lyapunov's equation, using methods of modern algebra. The emphasis is on the use of finite algebraic procedures which are easily implemented on a digital computer and which lead to an explicit solution to the problem. The action f sub BA is introduced a Basic Lemma is proven. The equation PA + BP = -C as well as the Lyapunov equation are analyzed. Algorithms are given for the solution of the Lyapunov and comment is given on its arithmetic complexity. The equation P - A'PA = Q is studied and numerical examples are given.

Djaferis, T. E.↗

NASA NTRS1988

On Hilbert-Schmidt norm convergence of Galerkin approximation for operator Riccati equations

An abstract approximation framework for the solution of operator algebraic Riccati equations is developed. The approach taken is based on a formulation of the Riccati equation as an abstract nonlinear operator equation on the space of Hilbert-Schmidt operators. Hilbert-Schmidt norm convergence of solutions to generic finite dimensional Galerkin approximations to the Riccati equation to the solution of the original infinite dimensional problem is argued. The application of the general theory is illustrated via an operator Riccati equation arising in the linear-quadratic design of an optimal feedback control law for a 1-D heat/diffusion equation. Numerical results demonstrating the convergence of the associated Hilbert-Schmidt kernels are included.

Rosen, I. G.↗

NASA NTRS1980

A mixed-mode crack analysis of rectilinear anisotropic solids using conservation laws of elasticity

A very simple and convenient method of analysis for studying two-dimensional mixed-mode crack problems in rectilinear anisotropic solids is presented. The analysis is formulated on the basis of conservation laws of anisotropic elasticity and of fundamental relationships in anisotropic fracture mechanics. The problem is reduced to a system of linear algebraic equations in mixed-mode stress intensity factors. One of the salient features of the present approach is that it can determine directly the mixed-mode stress intensity solutions from the conservation integrals evaluated along a path removed from the crack-tip region without the need of solving the corresponding complex near-field boundary value problem. Several examples with solutions available in the literature are solved to ensure the accuracy of the current analysis. This method is further demonstrated to be superior to other approaches in its numerical simplicity and computational efficiency. Solutions of more complicated and practical engineering problems dealing with the crack emanating from a circular hole in composites are presented also to illustrate the capacity of this method.

Wang, S. S.↗

NASA NTRS1992

Propagating Qualitative Values Through Quantitative Equations

In most practical problems where traditional numeric simulation is not adequate, one need to reason about a system with both qualitative and quantitative equations. In this paper, we address the problem of propagating qualitative values represented as interval values through quantitative equations. Previous research has produced exponential-time algorithms for approximate solution of the problem. These may not meet the stringent requirements of many real time applications. This paper advances the state of art by producing a linear-time algorithm that can propagate a qualitative value through a class of complex quantitative equations exactly and through arbitrary algebraic expressions approximately. The algorithm was found applicable to Space Shuttle Reaction Control System model.

Kulkarni, Deepak↗

DOE OSTI2020

An Algebraic Sparsified Nested Dissection Algorithm Using Low-Rank Approximations

Here, we propose a new algorithm for the fast solution of large, sparse, symmetric positive-definite linear systems, spaND (sparsified Nested Dissection). It is based on nested dissection, sparsification, and low-rank compression. After eliminating all interiors at a given level of the elimination tree, the algorithm sparsifies all separators corresponding to the interiors. This operation reduces the size of the separators by eliminating some degrees of freedom but without introducing any fill-in. This is done at the expense of a small and controllable approximation error. The result is an approximate factorization that can be used as an efficient preconditioner. We then perform several numerical experiments to evaluate this algorithm. We demonstrate that a version using orthogonal factorization and block-diagonal scaling takes fewer CG iterations to converge than previous similar algorithms on various kinds of problems. Furthermore, this algorithm is provably guaranteed to never break down and the matrix stays symmetric positive-definite throughout the process. We evaluate the algorithm on some large problems show it exhibits near-linear scaling. The factorization time is roughly $\mathcal{O}$(N), and the number of iterations grows slowly with N.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

GPU acceleration of all-electron electronic structure theory using localized numeric atom-centered basis functions

We present an implementation of all-electron density-functional theory for massively parallel GPU-based platforms, using localized atom-centered basis functions and real-space integration grids. Special attention is paid to domain decomposition of the problem on non-uniform grids, which enables compute- and memory-parallel execution across thousands of nodes for real-space operations, e.g. the update of the electron density, the integration of the real-space Hamiltonian matrix, and calculation of Pulay forces. To assess the performance of our GPU implementation, we performed benchmarks on three different architectures using a 103-material test set. We find that operations which rely on dense serial linear algebra show dramatic speedups from GPU acceleration: in particular, SCF iterations including force and stress calculations exhibit speedups ranging from 4.5 to 6.6. For the architectures and problem types investigated here, this translates to an expected overall speedup between 3–4 for the entire calculation (including non-GPU accelerated parts), for problems featuring several tens to hundreds of atoms. Additional calculations for a 375-atom Bi2Se3 bilayer show that the present GPU strategy scales for large-scale distributed-parallel simulations.

42 ENGINEERING↗

DOE OSTI2020

Parallel performance of algebraic multigrid domain decomposition

Algebraic multigrid (AMG) is a widely used scalable solver and preconditioner for large-scale linear systems resulting from the discretization of a wide class of elliptic PDEs. While AMG has optimal computational complexity, the cost of communication has become a significant bottleneck that limits its scalability as processor counts continue to grow on modern machines. This article examines the design, implementation, and parallel performance of a novel algorithm, algebraic multigrid domain decomposition (AMG-DD), designed specifically to limit communication. The goal of AMG-DD is to provide a low-communication alternative to standard AMG V-cycles by trading some additional computational overhead for a significant reduction in communication cost. Numerical results show that AMG-DD achieves superior accuracy per communication cost compared with AMG, and speedup over AMG is demonstrated on a large GPU cluster.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1986

Stability of semidiscrete approximations for hyperbolic initial-boundary-value problems: An eigenvalue analysis

A hyperbolic initial-boundary-value problem can be approximated by a system of ordinary differential equations (ODEs) by replacing the spatial derivatives by finite-difference approximations. The resulting system of ODEs is called a semidiscrete approximation. A complication is the fact that more boundary conditions are required for the spatially discrete approximation than are specified for the partial differential equation. Consequently, additional numerical boundary conditions are required and improper treatment of these additional conditions can lead to instability. For a linear initial-boundary-value problem (IBVP) with homogeneous analytical boundary conditions, the semidiscrete approximation results in a system of ODEs of the form du/dt = Au whose solution can be written as u(t) = exp(At)u(O). Lax-Richtmyer stability requires that the matrix norm of exp(At) be uniformly bounded for O less than or = t less than or = T independent of the spatial mesh size. Although the classical Lax-Richtmyer stability definition involves a conventional vector norm, there is no known algebraic test for the uniform boundedness of the matrix norm of exp(At) for hyperbolic IBVPs. An alternative but more complicated stability definition is used in the theory developed by Gustafsson, Kreiss, and Sundstrom (GKS). The two methods are compared.

Warming, Robert F.↗

DOE OSTI2021

Porting hypre to heterogeneous computer architectures: Strategies and experiences

We report that linear systems are occurring in many applications, and solving them can take a large amount of the total simulation time. The high performance library hypre provides a variety of interfaces and linear solvers, including various multigrid methods, that have achieved good scalability on a variety of homogeneous parallel computer architectures. Heterogeneous architectures with nodes that have both CPUs and accelerators provide new challenges, since they require more fine-grained parallelism and reduced data movement between different memories on a single node as well as across nodes. We will discuss our experiences and strategies to port hypre to heterogeneous computers with accelerators, including the design of a new memory model, the use of abstractions, the BoxLoop macros in the structured and semi-structured interfaces, and the restructuring of algebraic multigrid (AMG) into modular components. We present numerical experiments comparing CPU and GPU performance for several test problems.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1992

Reduced basis technique for calculating sensitivity coefficients of nonlinear structural response

An efficient reduced basis technique is presented for calculating the sensitivity of nonlinear structural response to variations in the design variables. The structure is discretized by using two-field mixed finite element models. The vector of structural response and its sensitivity coefficients (derivatives with respect to design variables) are each expressed as a linear combination of a small number of basis (or global approximation) vectors. The Bubnov-Galerkin technique is then used to approximate each of the finite element equations governing the response and the sensitivity coefficients by a small number of algebraic equations in the amplitudes of these vectors. The path derivatives (derivatives of the response vector with respect to path parameters, e.g., load parameters) are used as basis vectors for approximating the response. A combination of the path derivatives and their derivatives with respect to the design variables is used for approximating the sensitivity coefficients. The potential of the proposed technique is discussed and its effectiveness is demonstrated by means of numerical examples of laminated composite plates subjected to mechanical and thermal loads.

Noor, Ahmed K.↗

DOE OSTI2020

Algebraic multigrid preconditioning of the Hessian in optimization constrained by a partial differential equation

Summary We construct an algebraic multigrid (AMG) based preconditioner for the reduced Hessian of a linear‐quadratic optimization problem constrained by an elliptic partial differential equation. While the preconditioner generalizes a geometric multigrid preconditioner introduced in earlier works, its construction relies entirely on a standard AMG infrastructure built for solving the forward elliptic equation, thus allowing for it to be implemented using a variety of AMG methods and standard packages. Our analysis establishes a clear connection between the quality of the preconditioner and the AMG method used. The proposed strategy has a broad and robust applicability to problems with unstructured grids, complex geometry, and varying coefficients. The method is implemented using the Hypre package and several numerical examples are presented.

Barker, Andrew T.↗

NASA NTRS2015

A Model for Jet-Surface Interaction Noise Using Physically Realizable Upstream Turbulence Conditions

This paper is a continuation of previous work in which a generalized Rapid Distortion Theory (RDT) formulation was used to model low-frequency trailing-edge noise. The research was motivated by proposed next-generation aircraft configurations where the exhaust system is tightly integrated with the airframe. Data from recent experiments at NASA on the interaction between high-Reynolds-number subsonic jet flows and an external flat plate showed that the power spectral density (PSD) of the far-field pressure underwent considerable amplification at low frequencies. For example, at the 900 observation angle, the low-frequency noise could be as much as 10dB greater than the jet noise itself. In this paper, we present predictions of the noise generated by the interaction of a rectangular jet with the trailing edge of a semi-infinite flat plate. The calculations are based on a formula for the acoustic spectrum of this noise source derived from an exact formal solution of the linearized Euler equations involving (in this case) one arbitrary convected scalar quantity and a Rayleigh equation Green's function. A low-frequency asymptotic approximation for the Green's function based on a two-dimensional mean flow is used in the calculations along with a physically realizable upstream turbulence spectrum, which includes a finite de-correlation region. Numerical predictions, based on three-dimensional RANS solutions for a range of subsonic acoustic Mach number jets and nozzle aspect ratios are compared with experimental data. Comparisons of the RANS results with flow data are also presented for selected cases. We find that a finite decorrelation region increases the low-frequency algebraic decay (the low frequency "rolloff") of the acoustic spectrum with angular frequency thereby producing much closer agreement with noise data for Strouhal numbers less than 0.1. Secondly, the large-aspectratio theory is able to predict the low-frequency amplification due to the jet-edge interaction reasonably well, even for moderate aspect ratio nozzles. We show also that the noise predictions for smaller aspect ratio jets can be fine-tuned using the appropriate RANS-based mean flow and turbulence properties.

Jet↗

NASA NTRS2015

A Model for Jet-Surface Interaction Noise Using Physically Realizable Upstream Turbulence Conditions

Aircraft↗

NASA NTRS2022

A Quantum Algorithm to Simulate Open Quantum Systems

Given the advent of quantum algorithms for a wide array of problems in linear algebra and machine learning, it is important to develop general methods for the simulation of arbitrary (ie non-unitary) operators on quantum hardware. In this talk, we present a novel quantum algorithm based on the quantum singular value transformation (QSVT) to apply an arbitrary operator K to some input state and subsequently estimate the expectation value of some observable. Our construction then immediately yields a route to estimating observables of states undergoing open quantum dynamics, whose effect is captured by a set of non-unitary Kraus operators. Our algorithm succeeds deterministically given the Sz-Nagy dilation, and we provide details on the algorithm's query and gate complexity, numerical verification, and comparisons with prior methods.

Quantum computing↗

DOE OSTI2024

HHL algorithm with mapping function and enhanced sampling for model predictive control in microgrids

Here, this paper presents a refined quantum Harrow Hassidim Lloyd (HHL) algorithm for microgrid control. The first novelty of the developed method is that a mapping shift function enables the original HHL algorithm to handle general linear equations with non-singular and indefinite matrix. Second, a method of Matrix Extension for Amplifying Sampling Probabilities of Intended Solution (ME-ASPI) is proposed to design the reformulated linear algebraic equations, allowing for improved sampling efficiency of the quantum tomography in the refined HHL algorithm. Then, we applied the method to solve the model predictive control (MPC) problem in nonlinear dynamical microgrids. Specifically, with the ME-ASPI method, the refined HHL algorithm can effectively obtain the intended partial optimal control inputs for MPC. The optimization of quadratic programming problem in each time step of MPC is transformed into a linear system problem, which is addressed by the proposed quantum solver through using only partial information, with the time complexity improved from $\mathscr{O}(\mathscr{N}^{2.37286})$ classically to $\mathscr{O}(\mathscr{N}^{2} log \mathscr{N}$ x $p$ log $p)$ in quantum. Numerical examples have validated the effectiveness of the refined HHL algorithm with the proposed mapping function and the ME-ASPI method. By leveraging quantum properties, the proposed method provides a hybrid quantum–classical framework for microgrid control. This generic method can also potentially tackle many other challenges in analyzing and controlling general complex engineered systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

NASA NTRS1990

Domain decomposition methods in aerodynamics

Compressible Euler equations are solved for two-dimensional problems by a preconditioned conjugate gradient-like technique. An approximate Riemann solver is used to compute the numerical fluxes to second order accuracy in space. Two ways to achieve parallelism are tested, one which makes use of parallelism inherent in triangular solves and the other which employs domain decomposition techniques. The vectorization/parallelism in triangular solves is realized by the use of a recording technique called wavefront ordering. This process involves the interpretation of the triangular matrix as a directed graph and the analysis of the data dependencies. It is noted that the factorization can also be done in parallel with the wave front ordering. The performances of two ways of partitioning the domain, strips and slabs, are compared. Results on Cray YMP are reported for an inviscid transonic test case. The performances of linear algebra kernels are also reported.

Venkatakrishnan, V.↗

NASA NTRS1976

Optimal control of spin-stabilized spacecraft with telescoping appendages

The control of a spin-stabilized spacecraft consisting of a rigid central hub and one or two movable offset telescoping booms (with end masses) is considered. The equations of rotational motion are linearized about either of two desired final states. A control law for the boom end mass position is sought such that a quadratic cost functional involving the weighted components of angular velocity plus the control is minimized when the final time is unspecified and involves the solution of the matrix Riccati algebraic equation. For three axis control more than one offset boom (orthogonal to each other) is required. For two-axis control with a single boom offset from a symmetrical hub, an analytic solution is obtained; when this system is used for nutation decay the time constant is one order of magnitude smaller than previously achieved using nonoptimal control logic. For the general case results are obtained numerically.

Bainum, P. M.↗