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.

SourceResearch connectionFrom yearThrough year

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

At least 829 records · Page 46

All sources NASA NTRS DOE OSTI

NASA NTRS1991

Modelling the pressure-strain correlation of turbulence - An invariant dynamical systems approach

The modeling of the pressure-strain correlation of turbulence is examined from a basic theoretical standpoint with a view toward developing improved second-order closure models. Invariance considerations along with elementary dynamical systems theory are used in the analysis of the standard hierarchy of closure models. In these commonly used models, the pressure-strain correlation is assumed to be a linear function of the mean velocity gradients with coefficients that depend algebraically on the anisotropy tensor. It is proven that for plane homogeneous turbulent flows the equilibrium structure of this hierarchy of models is encapsulated by a relatively simple model which is only quadratically nonlinear in the anisotropy tensor. This new quadratic model - the SSG model - is shown to outperform the Launder, Reece, and Rodi model (as well as more recent models that have a considerably more complex nonlinear structure) in a variety of homogeneous turbulent flows. Some deficiencies still remain for the description of rotating turbulent shear flows that are intrinsic to this general hierarchy of models and, hence, cannot be overcome by the mere introduction of more complex nonlinearities. It is thus argued that the recent trend of adding substantially more complex nonlinear terms containing the anisotropy tensor may be of questionable value in the modeling of the pressure-strain correlation. Possible alternative approaches are discussed briefly.

Speziale, Charles G.↗

NASA NTRS1993

Flight control application of new stability robustness bounds for linear uncertain systems

This paper addresses the issue of obtaining bounds on the real parameter perturbations of a linear state-space model for robust stability. Based on Kronecker algebra, new, easily computable sufficient bounds are derived that are much less conservative than the existing bounds since the technique is meant for only real parameter perturbations (in contrast to specializing complex variation case to real parameter case). The proposed theory is illustrated with application to several flight control examples.

Yedavalli, Rama K.↗

NASA NTRS1996

Chebyshev polynomials in the spectral Tau method and applications to Eigenvalue problems

Chebyshev Spectral methods have received much attention recently as a technique for the rapid solution of ordinary differential equations. This technique also works well for solving linear eigenvalue problems. Specific detail is given to the properties and algebra of chebyshev polynomials; the use of chebyshev polynomials in spectral methods; and the recurrence relationships that are developed. These formula and equations are then applied to several examples which are worked out in detail. The appendix contains an example FORTRAN program used in solving an eigenvalue problem.

Johnson, Duane↗

DOE OSTI2014

Non-Galerkin Coarse Grids for Algebraic Multigrid

Algebraic multigrid (AMG) is a popular and effective solver for systems of linear equations that arise from discretized partial differential equations. And while AMG has been effectively implemented on large scale parallel machines, challenges remain, especially when moving to exascale. Particularly, stencil sizes (the number of nonzeros in a row) tend to increase further down in the coarse grid hierarchy, and this growth leads to more communication. Therefore, as problem size increases and the number of levels in the hierarchy grows, the overall efficiency of the parallel AMG method decreases, sometimes dramatically. This growth in stencil size is due to the standard Galerkin coarse grid operator, $P^T A P$, where $P$ is the prolongation (i.e., interpolation) operator. For example, the coarse grid stencil size for a simple three-dimensional (3D) seven-point finite differencing approximation to diffusion can increase into the thousands on present day machines, causing an associated increase in communication costs. We therefore consider algebraically truncating coarse grid stencils to obtain a non-Galerkin coarse grid. First, the sparsity pattern of the non-Galerkin coarse grid is determined by employing a heuristic minimal “safe” pattern together with strength-of-connection ideas. Second, the nonzero entries are determined by collapsing the stencils in the Galerkin operator using traditional AMG techniques. The result is a reduction in coarse grid stencil size, overall operator complexity, and parallel AMG solve phase times.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1982

Linear decentralized systems with special structure

Certain fundamental structures associated with linear systems having internal symmetries are outlined. It is shown that the theory of finite-dimensional algebras and their representations are closely related to such systems. It is also demonstrated that certain problems in the decentralized control of symmetric systems are equivalent to long-standing problems of linear systems theory. Even though the structure imposed arose in considering the problems of twin-lift helicopters, any large system composed of several identical intercoupled control systems can be modeled by a linear system that satisfies the constraints imposed. Internal symmetry can be exploited to yield new system-theoretic invariants and a better understanding of the way in which the underlying structure affects overall system performance.

Martin, C. F.↗

NASA NTRS1993

A least-squares finite element method for 3D incompressible Navier-Stokes equations

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations, and results in symmetric, positive definite algebraic system. An additional compatibility equation, i.e., the divergence of vorticity vector should be zero, is included to make the first-order system elliptic. The Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. The flow in a half of 3D cubic cavity is calculated at Re = 100, 400, and 1,000 with 50 x 52 x 25 trilinear elements. The Taylor-Gortler-like vortices are observed at Re = 1,000.

Jiang, Bo-Nan↗

DOE OSTI2020

Reducing communication in algebraic multigrid with multi-step node aware communication

Algebraic multigrid (AMG) is often viewed as a scalable [Formula: see text] solver for sparse linear systems. Yet, AMG lacks parallel scalability due to increasingly large costs associated with communication, both in the initial construction of a multigrid hierarchy and in the iterative solve phase. This work introduces a parallel implementation of AMG that reduces the cost of communication, yielding improved parallel scalability. It is common in Message Passing Interface (MPI), particularly in the MPI-everywhere approach, to arrange inter-process communication, so that communication is transported regardless of the location of the send and receive processes. Performance tests show notable differences in the cost of intra- and internode communication, motivating a restructuring of communication. In this case, the communication schedule takes advantage of the less costly intra-node communication, reducing both the number and the size of internode messages. Node-centric communication extends to the range of components in both the setup and solve phase of AMG, yielding an increase in the weak and strong scaling of the entire method.

Computer Science↗

DOE OSTI2015

Reconsidering harmonic and anharmonic coherent states: Partial differential equations approach

This article presents a new approach to dealing with time dependent quantities such as autocorrelation function of harmonic and anharmonic systems using coherent states and partial differential equations. The approach that is normally used to evaluate dynamical quantities involves formidable operator algebra. That operator algebra becomes insurmountable when employing Morse oscillator coherent states. This problem becomes even more complicated in case of Morse oscillator as it tends to exhibit divergent dynamics. This approach employs linear partial differential equations, some of which may be solved exactly and analytically, thereby avoiding the cumbersome noncommutative algebra required to manipulate coherent states of Morse oscillator. Additionally, the arising integrals while using the herein presented method feature stability and high numerical efficiency. The correctness, applicability, and utility of the above approach are tested by reproducing the partition and optical autocorrelation function of the harmonic oscillator. A closed-form expression for the equilibrium canonical partition function of the Morse oscillator is derived using its coherent states and partial differential equations. Also, a nonequilibrium autocorrelation function expression for weak electron–phonon coupling in condensed systems is derived for displaced Morse oscillator in electronic state. Finally, the utility of the method is demonstrated through further simplifying the Morse oscillator partition function or autocorrelation function expressions reported by other researchers in unevaluated form of second-order derivative exponential. Comparison with exact dynamics shows identical results.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2016

SU-G-BRA-08: Diaphragm Motion Tracking Based On KV CBCT Projections with a Constrained Linear Regression Optimization

Purpose: To develop a novel strategy to extract the respiratory motion of the thoracic diaphragm from kilovoltage cone beam computed tomography (CBCT) projections by a constrained linear regression optimization technique. Methods: A parabolic function was identified as the geometric model and was employed to fit the shape of the diaphragm on the CBCT projections. The search was initialized by five manually placed seeds on a pre-selected projection image. Temporal redundancies, the enabling phenomenology in video compression and encoding techniques, inherent in the dynamic properties of the diaphragm motion together with the geometrical shape of the diaphragm boundary and the associated algebraic constraint that significantly reduced the searching space of viable parabolic parameters was integrated, which can be effectively optimized by a constrained linear regression approach on the subsequent projections. The innovative algebraic constraints stipulating the kinetic range of the motion and the spatial constraint preventing any unphysical deviations was able to obtain the optimal contour of the diaphragm with minimal initialization. The algorithm was assessed by a fluoroscopic movie acquired at anteriorposterior fixed direction and kilovoltage CBCT projection image sets from four lung and two liver patients. The automatic tracing by the proposed algorithm and manual tracking by a human operator were compared in both space and frequency domains. Results: The error between the estimated and manual detections for the fluoroscopic movie was 0.54mm with standard deviation (SD) of 0.45mm, while the average error for the CBCT projections was 0.79mm with SD of 0.64mm for all enrolled patients. The submillimeter accuracy outcome exhibits the promise of the proposed constrained linear regression approach to track the diaphragm motion on rotational projection images. Conclusion: The new algorithm will provide a potential solution to rendering diaphragm motion and ultimately improving tumor motion management for radiation therapy of cancer patients.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2024

Constrained Local Approximate Ideal Restriction for Advection-Diffusion Problems

Herein this paper focuses on developing a reduction-based algebraic multigrid (AMG) method that is suitable for solving general (non)symmetric linear systems and is naturally robust from pure advection to pure diffusion. Initial motivation comes from a new reduction-based AMG approach, $\ell \text{AIR}$ (local approximate ideal restriction), that was developed for solving advection-dominated problems. Though this new solver is very effective in the advection-dominated regime, its performance degrades in cases where diffusion becomes dominant. This is consistent with the fact that in general, reduction-based AMG methods tend to suffer from growth in complexity and/or convergence rates as the problem size is increased, especially for diffusion-dominated problems in two or three dimensions. Motivated by the success of $\ell \text{AIR}$ in the advective regime, our aim in this paper is to generalize the AIR framework with the goal of improving the performance of the solver in diffusion-dominated regimes. To do so, we propose a novel way to combine mode constraints as used commonly in energy-minimization AMG methods with the local approximation of ideal operators used in $\ell \text{AIR}$. The resulting constrained $\ell \text{AIR}$ algorithm is able to achieve fast scalable convergence on advective and diffusive problems. In addition, it is able to achieve standard low complexity hierarchies in the diffusive regime through aggressive coarsening, something that was previously difficult for reduction-based methods.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Deconstructing supergravity: massive supermultiplets

Given the success of the deconstruction program in obtaining ghost-free massive gravity from 5-D Einstein gravity, we propose a modification of the deconstruction procedure that incorporates supersymmetry at the linear level. We discuss the relevant limits of a conjectured interacting theory of a massive spin 2 supermultiplet, and determine the linear theory to be the N=1 Zinoviev theory, a supersymmetric extension of Fierz-Pauli theory. We develop a family of 1-site deconstruction procedures for fermionic fields (yielding Dirac and Majorana mass terms). The deconstruction procedure appropriate for giving fermions a Dirac mass is found to preserve half of the supersymmetry of the 5-D theory. We explicitly check this by deconstructing 5-D N=2 super-Maxwell theory down to 4-D N=1 super-Proca theory, and deconstructing linear 5-D N=2 supergravity down to 4-D N=1 Zinoviev theory, and derive the full 4-D supersymmetry algebras and Stückelberg symmetries from the 5-D superalgebras and gauge symmetries, respectively. We conjecture that this procedure should admit a generalization to fully non-linear theories.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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 NTRS1993

Proteus two-dimensional Navier-Stokes computer code, version 2.0. Volume 1: Analysis description

A computer code called Proteus 2D was developed to solve the two-dimensional planar or axisymmetric, Reynolds-averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The objective in this effort was to develop a code for aerospace propulsion applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The governing equations are solved in generalized nonorthogonal body-fitted coordinates, by marching in time using a fully-coupled ADI solution procedure. The boundary conditions are treated implicitly. All terms, including the diffusion terms, are linearized using second-order Taylor series expansions. Turbulence is modeled using either an algebraic or two-equation eddy viscosity model. The thin-layer or Euler equations may also be solved. The energy equation may be eliminated by the assumption of constant total enthalpy. Explicit and implicit artificial viscosity may be used. Several time step options are available for convergence acceleration. The documentation is divided into three volumes. This is the Analysis Description, and presents the equations and solution procedure. The governing equations, the turbulence model, the linearization of the equations and boundary conditions, the time and space differencing formulas, the ADI solution procedure, and the artificial viscosity models are described in detail.

Towne, Charles E.↗

NASA NTRS1993

Proteus three-dimensional Navier-Stokes computer code, version 1.0. Volume 1: Analysis description

A computer code called Proteus 3D has been developed to solve the three dimensional, Reynolds averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The objective in this effort has been to develop a code for aerospace propulsion applications that is easy to use and easy to modify. Code readability, modularity, and documentation have been emphasized. The governing equations are solved in generalized non-orthogonal body-fitted coordinates by marching in time using a fully-coupled ADI solution procedure. The boundary conditions are treated implicitly. All terms, including the diffusion terms, are linearized using second-order Taylor series expansions. Turbulence is modeled using either an algebraic or two-equation eddy viscosity model. The thin-layer or Euler equations may also be solved. The energy equation may be eliminated by the assumption of constant total enthalpy. Explicit and implicit artificial viscosity may be used. Several time step options are available for convergence acceleration. The documentation is divided into three volumes. This is the Analysis Description, and presents the equations and solution procedure. It describes in detail the governing equations, the turbulence model, the linearization of the equations and boundary conditions, the time and space differencing formulas, the ADI solution procedure, and the artificial viscosity models.

Towne, Charles E.↗

DOE OSTI2015

Approximate Bisimulation-Based Reduction of Power System Dynamic Models

In this paper we propose approximate bisimulation relations and functions for reduction of power system dynamic models in differential- algebraic (descriptor) form. The full-size dynamic model is obtained by linearization of the nonlinear transient stability model. We generalize theoretical results on approximate bisimulation relations and bisimulation functions, originally derived for a class of constrained linear systems, to linear systems in descriptor form. An algorithm for transient stability assessment is proposed and used to determine whether the power system is able to maintain the synchronism after a large disturbance. Two benchmark power systems are used to illustrate the proposed algorithm and to evaluate the applicability of approximate bisimulation relations and bisimulation functions for reduction of the power system dynamic models.

Stankovic, AM↗

DOE OSTI2021

Learning an Algebriac Multrigrid Interpolation Operator Using a Modified GraphNet Architecture

This work, building on previous efforts, develops a suite of new graph neural network machine learning architectures that generate data-driven prolongators for use in Algebraic Multigrid (AMG). Algebraic Multigrid is a powerful and common technique for solving large, sparse linear systems. Its effectiveness is problem dependent and heavily depends on the choice of the prolongation operator, which interpolates the coarse mesh results onto a finer mesh. Previous work has used recent developments in graph neural networks to learn a prolongation operator from a given coefficient matrix. In this paper, we expand on previous work by exploring architectural enhancements of graph neural networks. A new method for generating a training set is developed which more closely aligns to the test set. Asymptotic error reduction factors are compared on a test suite of 3-dimensional Poisson problems with varying degrees of element stretching. Results show modest improvements in asymptotic error factor over both commonly chosen baselines and learning methods from previous work.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

A symbolic framework to obtain mid-fidelity models of flexible multibody systems with application to horizontal-axis wind turbines

Abstract. The article presents a symbolic framework (also called computer algebra program) that is used to obtain, in symbolic mathematical form, the linear and nonlinear equations of motion of a mid-fidelity multibody system including rigid and flexible bodies. Our approach is based on Kane's method and a nonlinear shape function representation for flexible bodies. The shape function approach does not represent the state of the art for flexible multibody dynamics but is an effective trade-off to obtain mid-fidelity models with few degrees of freedom, taking advantage of the separation of space and time. The method yields compact symbolic equations of motion with implicit account of the constraints. The general and automatic framework facilitates the creation and manipulation of models with various levels of complexity by adding or removing degrees of freedom. The symbolic treatment allows for analytical gradients and linearized equations of motion. The linear and nonlinear equations can be exported to Python code or dedicated software. There are multiple applications, such as time domain simulation, stability analyses, frequency domain analyses, advanced controller design, state observers, and digital twins. In this article, we describe the method we used to systematically generate the equations of motion of multibody systems and present the implementation of the framework using the Python package SymPy. We apply the framework to generate illustrative land-based and offshore wind turbine models. We compare our results with OpenFAST simulations and discuss the advantages and limitations of the method. The Python implementation is provided as an open-source project.

Branlard, Emmanuel (ORCID:0000000277506128)↗

NASA NTRS1972

Design of minimax output feedback controller for system with parameter uncertainty

The problem of controlling a time-invariant system with parameter uncertainty is considered with incomplete state feedback. The controller is designed by minimaximizing a quadratic performance criterion and a sensitivity (or loss) criterion, involving the state of the system, the control, and the uncertainty vector. The resulting optimal controller is linear and optimal feedback gain matrix must satisfy a set of nonlinear algebraic equations. some algorithms for algebraic minimax problems are presented.

Basuthakur, S.↗