Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Matrix equations”

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 901 records · Page 50
All sourcesNASA NTRSDOE OSTI
NASA NTRS1995

Reliability enhancement of Navier-Stokes codes through convergence acceleration

Methods for enhancing the reliability of Navier-Stokes computer codes through improving convergence characteristics are presented. The improving of these characteristics decreases the likelihood of code unreliability and user interventions in a design environment. The problem referred to as a 'stiffness' in the governing equations for propulsion-related flowfields is investigated, particularly in regard to common sources of equation stiffness that lead to convergence degradation of CFD algorithms. Von Neumann stability theory is employed as a tool to study the convergence difficulties involved. Based on the stability results, improved algorithms are devised to ensure efficient convergence in different situations. A number of test cases are considered to confirm a correlation between stability theory and numerical convergence. The examples of turbulent and reacting flow are presented, and a generalized form of the preconditioning matrix is derived to handle these problems, i.e., the problems involving additional differential equations for describing the transport of turbulent kinetic energy, dissipation rate and chemical species. Algorithms for unsteady computations are considered. The extension of the preconditioning techniques and algorithms derived for Navier-Stokes computations to three-dimensional flow problems is discussed. New methods to accelerate the convergence of iterative schemes for the numerical integration of systems of partial differential equtions are developed, with a special emphasis on the acceleration of convergence on highly clustered grids.

Merkle, Charles L.↗
NASA NTRS1994

Optimization of Orifice Geometry for Cross-Flow Mixing in a Cylindrical Duct

Mixing of gaseous jets in a cross-flow has significant applications in engineering, one example of which is the dilution zone of a gas turbine combustor. Despite years of study, the design of jet injection in combustors is largely based on practical experience. A series of experiments was undertaken to delineate the optimal mixer orifice geometry. A cross-flow to core-flow momentum-flux ratio of 40 and a mass flow ratio of 2.5 were selected as representative of an advanced design. An experimental test matrix was designed around three variables: the number of orifices, the orifice aspect ratio (long-to-short dimension), and the orifice angle. A regression analysis was performed on the data to arrive at an interpolating equation that predicted the mixing performance of orifice geometry combinations within the range of the test matrix parameters. Results indicate that mixture uniformity is a non-linear function of the number of orifices, the orifice aspect ratio, and the orifice angle. Optimum mixing occurs when the asymptotic mean jet trajectories are in the range of 0.35 less than r/R less than 0.5 (where r = 0 is at the mixer wall) at z/R = 1.0. At the optimum number of orifices, the difference between shallow-angled slots with large aspect ratios and round holes is minimal and either approach will lead to good mixing performance. At the optimum number of orifices, it appears possible to have two local optimums where one corresponds to an aspect ratio of 1.0 and the other to a high aspect ratio.

Sowa, W. A.↗
DOE OSTI2022

Quantum-inspired method for solving the Vlasov-Poisson equations

Kinetic simulations of collisionless (or weakly collisional) plasmas using the Vlasov equation are often infeasible due to high-resolution requirements and the exponential scaling of computational cost with respect to dimension. Recently, it has been proposed that matrix product state (MPS) methods, a quantum-inspired but classical algorithm, can be used to solve partial differential equations with exponential speed-up, provided that the solution can be compressed and efficiently represented as a MPS within some tolerable error threshold. Here, in this work, we explore the practicality of MPS methods for solving the Vlasov-Poisson equations for systems with one coordinate in space and one coordinate in velocity, and find that important features of linear and nonlinear dynamics, such as damping or growth rates and saturation amplitudes, can be captured while compressing the solution significantly. Furthermore, by comparing the performance of different mappings of the distribution functions onto the MPS, we develop an intuition of the MPS representation and its behavior in the context of solving the Vlasov-Poisson equations, which will be useful for extending these methods to higher-dimensional problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1999

Rate Dependent Deformation and Strength Analysis of Polymer Matrix Composites

A research program is being undertaken to develop rate dependent deformation and failure models for the analysis of polymer matrix composite materials. In previous work in this program, strain-rate dependent inelastic constitutive equations used to analyze polymers have been implemented into a mechanics of materials based composite micromechanics method. In the current work, modifications to the micromechanics model have been implemented to improve the calculation of the effective inelastic strain. Additionally, modifications to the polymer constitutive model are discussed in which pressure dependence is incorporated into the equations in order to improve the calculation of constituent and composite shear stresses. The Hashin failure criterion is implemented into the analysis method to allow for the calculation of ply level failure stresses. The deformation response and failure stresses for two representative uniaxial polymer matrix composites, IM7/977-2 and AS4-PEEK, are predicted for varying strain rates and fiber orientations. The predicted results compare favorably to experimentally obtained values.

Goldberg, Robert K.↗
NASA NTRS1992

Initial value and two point boundary value solutions to the Clohessy-Wiltshire equations

The nonhomogeneous Clohessy-Wiltshire (C-W) equations are formulated and solved as an initial value problem in the form structure of linear systems theory. The state transition matrix (STM) and its inverse are obtained explicitly in both Newtonian and Hamiltonian form. It is shown that the STM for the C-2 equations possesses a special property making its inverse easily obtainable. Since solutions to the C-W equations are needed in two-point boundary value form to construct a good mission design tool for orbit transfer, the Lambert problem is solved in the context of the C-W equations.

Mullins, Larry D.↗
DOE OSTI2023

Binary operations on neuromorphic hardware with application to linear algebraic operations and stochastic equations

Abstract Non-von Neumann computational hardware, based on neuron-inspired, non-linear elements connected via linear, weighted synapses—so-called neuromorphic systems—is a viable computational substrate. Since neuromorphic systems have been shown to use less power than CPUs for many applications, they are of potential use in autonomous systems such as robots, drones, and satellites, for which power resources are at a premium. The power used by neuromorphic systems is approximately proportional to the number of spiking events produced by neurons on-chip. However, typical information encoding on these chips is in the form of firing rates that unarily encode information. That is, the number of spikes generated by a neuron is meant to be proportional to an encoded value used in a computation or algorithm. Unary encoding is less efficient (produces more spikes) than binary encoding. For this reason, here we present neuromorphic computational mechanisms for implementing binary two’s complement operations. We use the mechanisms to construct a neuromorphic, binary matrix multiplication algorithm that may be used as a primitive for linear differential equation integration, deep networks, and other standard calculations. We also construct a random walk circuit and apply it in Brownian motion simulations. We study how both algorithms scale in circuit size and iteration time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Quantum Algorithm for Linear Non-unitary Dynamics with Near-Optimal Dependence on All Parameters

We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.

Applied Dynamical Systems↗
DOE OSTI2025

RE-INTEGRATE EMT Simulation Software: Graph Convolutional Network for Sparse Matrix Pattern Detection

The increasing complexity of power networks, driven by proliferation of inverters, presents analytical challenges that simplified models often fail to capture, necessitating Electromagnetic Transient (EMT) simulations. EMT models are represented as discretized differential-algebraic equations (DAEs), forming a linear system Ax = b that is computationally intensive to solve. Due to inherent sparsity of adjacency matrix A, distinct patterns emerge that, when accurately identified, enable efficient solver selection to minimize computation time. However, identifying ideal pattern is complicated by numerous reordering algorithms and limited structural insights. To address this, we introduce a Graph Convolutional Network (GCN) model for classifying sparse matrix patterns common in power system analysis. The model, achieving 96% test accuracy, is validated using PV plant models of 125 MW capacities connected to New England 39-bus transmission system (TS), and further scaled to a 4,992-bus network with 384 PV plants, yielding 191, 616 × 191, 616 sized A matrix. For all cases, the GCN model accurately identifies the matrix’s intrinsic sparse pattern, demonstrating its potential to enhance solver performance in EMT analysis.

Hossain, Md Rifat [Florida International Universit↗
NASA NTRS2017

Comprehensive Thematic T-Matrix Reference Database: A 2015-2017 Update

The T-matrix method pioneered by Peter C. Waterman is one of the most versatile and efficient numerically exact computer solvers of the time-harmonic macroscopic Maxwell equations. It is widely used for the computation of electromagnetic scattering by single and composite particles, discrete random media, periodic structures (including metamaterials), and particles in the vicinity of plane or rough interfaces separating media with different refractive indices. This paper is the eighth update to the comprehensive thematic database of peer-reviewed T-matrix publications initiated in 2004 and lists relevant publications that have appeared since 2015. It also references a small number of earlier publications overlooked previously.

T-matrix method↗
NASA NTRS1994

Linear and nonlinear dynamic analysis of redundant load path bearingless rotor systems

The goal of this research is to develop the transfer matrix method to treat nonlinear autonomous boundary value problems with multiple branches. The application is the complete nonlinear aeroelastic analysis of multiple-branched rotor blades. Once the development is complete, it can be incorporated into the existing transfer matrix analyses. There are several difficulties to be overcome in reaching this objective. The conventional transfer matrix method is limited in that it is applicable only to linear branch chain-like structures, but consideration of multiple branch modeling is important for bearingless rotors. Also, hingeless and bearingless rotor blade dynamic characteristics (particularly their aeroelasticity problems) are inherently nonlinear. The nonlinear equations of motion and the multiple-branched boundary value problem are treated together using a direct transfer matrix method. First, the formulation is applied to a nonlinear single-branch blade to validate the nonlinear portion of the formulation. The nonlinear system of equations is iteratively solved using a form of Newton-Raphson iteration scheme developed for differential equations of continuous systems. The formulation is then applied to determine the nonlinear steady state trim and aeroelastic stability of a rotor blade in hover with two branches at the root. A comprehensive computer program is developed and is used to obtain numerical results for the (1) free vibration, (2) nonlinearly deformed steady state, (3) free vibration about the nonlinearly deformed steady state, and (4) aeroelastic stability tasks. The numerical results obtained by the present method agree with results from other methods.

Murthy, V. R.↗
NASA NTRS2006

Convergence Acceleration for Multistage Time-Stepping Schemes

The convergence of a Runge-Kutta (RK) scheme with multigrid is accelerated by preconditioning with a fully implicit operator. With the extended stability of the Runge-Kutta scheme, CFL numbers as high as 1000 could be used. The implicit preconditioner addresses the stiffness in the discrete equations associated with stretched meshes. Numerical dissipation operators (based on the Roe scheme, a matrix formulation, and the CUSP scheme) as well as the number of RK stages are considered in evaluating the RK/implicit scheme. Both the numerical and computational efficiency of the scheme with the different dissipation operators are discussed. The RK/implicit scheme is used to solve the two-dimensional (2-D) and three-dimensional (3-D) compressible, Reynolds-averaged Navier-Stokes equations. In two dimensions, turbulent flows over an airfoil at subsonic and transonic conditions are computed. The effects of mesh cell aspect ratio on convergence are investigated for Reynolds numbers between 5.7 x 10(exp 6) and 100.0 x 10(exp 6). Results are also obtained for a transonic wing flow. For both 2-D and 3-D problems, the computational time of a well-tuned standard RK scheme is reduced at least a factor of four.

Swanson, R. C.↗
NASA NTRS1989

An algorithm for the solution of dynamic linear programs

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Psiaki, Mark L.↗
DOE OSTI2020

Inertial dynamics of an interface with interfacial mass flux: Stability and flow fields’ structure, inertial stabilization mechanism, degeneracy of Landau’s solution, effect of energy fluctuations, and chemistry-induced instabilities

This work focuses on the long-standing problem of inertial dynamics of an interface with interfacial mass flux and reports new mechanisms for the interface stabilization and destabilization. The interface is a phase boundary separating fluids of different densities and having interfacial mass flux. To analyze the interface dynamics from a far field, we develop and apply the general matrix method to rigorously solve the boundary value problem involving the governing equations in the fluid bulk and the boundary conditions at the interface and at the outside boundaries of the domain. We find the fundamental solutions for the linearized system of equations and analyze the interplay of interface stability with flow fields’ structure by directly linking rigorous mathematical attributes to physical observables. We find that the interface is stable when the dynamics conserves the fluxes of mass, momentum, and energy; the stabilization is due to an inertial mechanism causing small oscillations of the interface velocity. In the classic Landau’s dynamics, the postulate of perfect constancy of the interface velocity leads to the development of Landau–Darrieus instability. This destabilization is also linked to the imbalance of the perturbed energy at the interface. The classic Landau’s solution is found to have degeneracy; lifting of the degeneracy may lead to singularity and self-similar dynamics. Our results compare well with traditional theories of combustion and propose new experiments to study the dynamics of the interface and the flow fields in combustible systems. We further conduct reactive molecular dynamics simulations to elucidate the complexity of chemical processes, to study the destabilizing effect of energy fluctuations on the interface stability, and to illustrate the chemistry-induced instabilities. In summary, we identify the extreme sensitivity of the interface dynamics to the interfacial boundary conditions, including the formal properties of fundamental solutions and the qualitative and quantitative properties of the flow fields. This provides new opportunities for studies, diagnostics, and control of multiphase flows in a broad range of processes in nature and technology.

42 ENGINEERING↗
NASA NTRS1972

Numerical stability in problems of linear algebra.

Mathematical problems are introduced as mappings from the space of input data to that of the desired output information. Then a numerical process is defined as a prescribed recurrence of elementary operations creating the mapping of the underlying mathematical problem. The ratio of the error committed by executing the operations of the numerical process (the roundoff errors) to the error introduced by perturbations of the input data (initial error) gives rise to the concept of lambda-stability. As examples, several processes are analyzed from this point of view, including, especially, old and new processes for solving systems of linear algebraic equations with tridiagonal matrices. In particular, it is shown how such a priori information can be utilized as, for instance, a knowledge of the row sums of the matrix. Information of this type is frequently available where the system arises in connection with the numerical solution of differential equations.

Babuska, I.↗
NASA NTRS1987

Application of a sensitivity analysis technique to high-order digital flight control systems

A sensitivity analysis technique for multiloop flight control systems is studied. This technique uses the scaled singular values of the return difference matrix as a measure of the relative stability of a control system. It then uses the gradients of these singular values with respect to system and controller parameters to judge sensitivity. The sensitivity analysis technique is first reviewed; then it is extended to include digital systems, through the derivation of singular-value gradient equations. Gradients with respect to parameters which do not appear explicitly as control-system matrix elements are also derived, so that high-order systems can be studied. A complete review of the integrated technique is given by way of a simple example: the inverted pendulum problem. The technique is then demonstrated on the X-29 control laws. Results show linear models of real systems can be analyzed by this sensitivity technique, if it is applied with care. A computer program called SVA was written to accomplish the singular-value sensitivity analysis techniques. Thus computational methods and considerations form an integral part of many of the discussions. A user's guide to the program is included. The SVA is a fully public domain program, running on the NASA/Dryden Elxsi computer.

Paduano, James D.↗
NASA NTRS1977

RMS massless arm dynamics capability in the SVDS

The equations of motion for the remote manipulator system, assuming that the masses and inertias of the arm can be neglected, are developed for implementation into the space vehicle dynamics simulation (SVDS) program for the Orbiter payload system. The arm flexibility is incorporated into the equations by the computation of flexibility terms for use in the joint servo model. The approach developed in this report is based on using the Jacobian transformation matrix to transform force and velocity terms between the configuration space and the task space to simplify the form of the equations.

Flanders, H. A.↗
NASA NTRS1983

Time-dependent response of filamentary composite spherical pressure vessels

A filamentary composite spherical pressure vessel is modeled as a pseudoisotropic (or transversely isotropic) composite shell, with the effects of the liner and fill tubes omitted. Equations of elasticity, macromechanical and micromechanical formulations, and laminate properties are derived for the application of an internally pressured spherical composite vessel. Viscoelastic properties for the composite matrix are used to characterize time-dependent behavior. Using the maximum strain theory of failure, burst pressure and critical strain equations are formulated, solved in the Laplace domain with an associated elastic solution, and inverted back into the time domain using the method of collocation. Viscoelastic properties of HBFR-55 resin are experimentally determined and a Kevlar/HBFR-55 system is evaluated with a FORTRAN program. The computed reduction in burst pressure with respect to time indicates that the analysis employed may be used to predict the time-dependent response of a filamentary composite spherical pressure vessel.

Dozier, J. D.↗