Search NASA⌕ Search

SEARCH · Search NASA

Results for “Matrix differential equation”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Differentiating matrices for arbitrarily spaced grid points

Differentiating matrices allow the numerical differentiation of functions defined at points of a discrete grid. A type of differentiating matrix based on local approximation on a sequence of sliding subgrids is considered. Previous derivations of this type of matrix have been restricted to grids with uniformly spaced points, and the resulting derivative approximations have lacked precision, especially at endpoints. The new formulation allows grids which have arbitrarily space points. It is shown that high accuracy can be achieved through use of differentiating matrices on non-uniform grids which include near-boundary points. Use of the differentiating matrix as an operator to solve eigenvalue problems involving ordinary differential equations is also considered.

Lakin, W. D.↗
NASA NTRS1990

Efficient parallel solution of parabolic equations - Implicit methods on the Cedar multicluster

A class of implicit methods for the parallel solution of linear parabolic differential equations based on Pade and Chebyshev rational approximations to the matrix exponential are presented. It is pointed out that this approach incorporates both natural hierarchical parallelism, improved intrinsic efficiency, and fewer timesteps. These advantages lead to an extremely fast family of methods for the solution of certain time-dependent problems. These techniques are illustrated with numerical experiments on the University of Illinois Cedar multicluster architecture. The experiments indicate that implicit methods of very high degree offer great promise for the solution of certain parabolic problems when in computational environment with parallel resources. Hierarchically organized parallel computers, such as the Cedar multicluster, are found to be especially attractive for these schemes.

Gallopoulos, E.↗
NASA NTRS1991

Modeling of linear isentropic flow systems

A modeling approach for linear isentropic flow systems based on the quasi-one-dimensional Euler equations of non-viscous, compressible flow are presented. Such systems are representative of certain high speed propulsion systems. Accurate models useful in control system studies are developed. A supersonic inlet is considered, and the resulting set of partial differential equations with boundary conditions is solved for a linear transfer matrix using Laplace transforms.

Sarantopoulos, Athan D.↗
NASA NTRS1991

Modeling of linear isentropic flow systems

A modeling approach for linear isentropic flow systems based on the quasi-one-dimensional Euler equations of non-viscous, compressible flow are presented. Such systems are representative of certain high speed propulsion systems. Accurate models useful in control system studies are developed. A supersonic inlet is considered, and the resulting set of partial differential equations with boundary conditions is solved for a linear transfer matrix using Laplace transforms.

Sarantopoulos, Athan D.↗
NASA NTRS1993

The use of linked lists in the simulation of controller-structure interaction

An algorithm for the computer simulation of large space structures under active control is considered. Linked lists are used in a matrix data structure to implement the trapezoidal rule on system differential equations. The use of the trapezoidal rule ensures that the numerical stability is equivalent to the system stability, which is essential for this type of simulation. The sparsity of the system matrices is exploited by the linked lists, and the algorithm efficiently steps through the lists in an orderly fashion. Results of simulations on a NASA large space structure experiment are reported.

Quan, R.↗
NASA NTRS1995

CCD/CID Processors Would Offer Greater Precision

Charge-coupled-device/charge-injection-device (CCD/CID) data processors of proposed type offer advantages of massively parallel computational architecture and high computational speed typical of older CCD/CID data processors, but with increased precision. Useful in performing matrix vector multiplications in variety of applications, including solving partial differential equations, processing signal and image data, control computations, and neural-network simulations. Greater precision of proposed devices help to ensure accuracy in CCD/CID implementations of pseudospectral neural networks - particular class of artificial neural networks especially suited to solving nonlinear differential equations.

Barhen, Jacob↗
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↗
NASA NTRS1988

Optical matrix-vector processing for computational fluid dynamics

An optical processor to solve partial differential equations for computational fluid dynamics applications is considered. This application is new and original for optical processors. The algorithms that are used are optical realizations of the Newton-Raphson method for nonlinear equations and a new optical LU direct decomposition and Gauss-Seidel iterative solution to the resultant linear algebraic equations. These algorithms are used to solve Burger's equation (a specific form of the momentum equation in fluid dynamics). The nonlinear equations provide 1-D velocity data at each time step. Simulation results of optical processing with these algorithms on computational fluid dynamics data is included.

Perlee, Caroline J.↗
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 NTRS1990

Development of a model of space station solar array

Space structures, such as the space station solar arrays, must be extremely lightweight, flexible structures. Accurate prediction of the natural frequencies and mode shapes is essential for determining the structural adequacy of components, and designing a control system. The tension preload in the blanket of photovoltaic solar collectors, and the free/free boundary conditions of a structure in space, causes serious reservations on the use of standard finite element techniques of solution. In particular, a phenomena known as grounding, or false stiffening, of the stiffness matrix occurs during rigid body rotation. The grounding phenomena is examined in detail. Numerous stiffness matrices developed by others are examined for rigid body rotation capability, and found lacking. Various techniques are used for developing new stiffness matrices from the rigorous solutions of the differential equations, including the solution of the directed force problem. A new directed force stiffness matrix developed by the author provides all the rigid body capabilities for the beam in space.

Bosela, Paul A.↗
NASA NTRS1978

On least squares approximations to indefinite problems of the mixed type

A least squares method is presented for computing approximate solutions of indefinite partial differential equations of the mixed type such as those that arise in connection with transonic flutter analysis. The method retains the advantages of finite difference schemes namely simplicity and sparsity of the resulting matrix system. However, it offers some great advantages over finite difference schemes. First, the method is insensitive to the value of the forcing frequency, i.e., the resulting matrix system is always symmetric and positive definite. As a result, iterative methods may be successfully employed to solve the matrix system, thus taking full advantage of the sparsity. Furthermore, the method is insensitive to the type of the partial differential equation, i.e., the computational algorithm is the same in elliptic and hyperbolic regions. In this work the method is formulated and numerical results for model problems are presented. Some theoretical aspects of least squares approximations are also discussed.

Fix, G. J.↗
NASA NTRS1973

Mixed finite-difference scheme for analysis of simply supported thick plates.

A mixed finite-difference scheme is presented for the stress and free vibration analysis of simply supported nonhomogeneous and layered orthotropic thick plates. The analytical formulation is based on the linear, three-dimensional theory of orthotropic elasticity and a Fourier approach is used to reduce the governing equations to six first-order ordinary differential equations in the thickness coordinate. The governing equations possess a symmetric coefficient matrix and are free of derivatives of the elastic characteristics of the plate. In the finite difference discretization two interlacing grids are used for the different fundamental unknowns in such a way as to reduce both the local discretization error and the bandwidth of the resulting finite-difference field equations. Numerical studies are presented for the effects of reducing the interior and boundary discretization errors and of mesh refinement on the accuracy and convergence of solutions. It is shown that the proposed scheme, in addition to a number of other advantages, leads to highly accurate results, even when a small number of finite difference intervals is used.

Noor, A. K.↗
NASA NTRS1980

Steady, Oscillatory, and Unsteady Subsonic and Supersonic Aerodynamics, production version (SOUSSA-P 1.1). Volume 1: Theoretical manual

Recent developments of the Green's function method and the computer program SOUSSA (Steady, Oscillatory, and Unsteady Subsonic and Supersonic Aerodynamics) are reviewed and summarized. Applying the Green's function method to the fully unsteady (transient) potential equation yields an integro-differential-delay equation. With spatial discretization by the finite-element method, this equation is approximated by a set of differential-delay equations in time. Time solution by Laplace transform yields a matrix relating the velocity potential to the normal wash. Premultiplying and postmultiplying by the matrices relating generalized forces to the potential and the normal wash to the generalized coordinates one obtains the matrix of the generalized aerodynamic forces. The frequency and mode-shape dependence of this matrix makes the program SOUSSA useful for multiple frequency and repeated mode-shape evaluations.

Morino, L.↗
NASA NTRS1986

Differentiating matrices for arbitrarily spaced grid points

Differentiating matrices allow the numerical differentiation of functions defined at points of a discrete grid. Previous derivations of these matrices have been restricted to grids with uniformly spaced points, and the resulting derivative approximations have lacked precision, especially at endpoints. The present work derives differentiating matrices on grids with arbitrarily spaced points. It is shown that high accuracy can be achieved through use of differentiating matrices on non-uniform grids through the expedient of including 'near boundary' points. Use of the differentiating matrix as an operator in the solution of problems involving ordinary differential equations is also considered.

Lakin, W. D.↗
NASA NTRS1993

The use of linked lists in the simulation of controller-structure interaction

An algorithm for the computer simulation of large space structures under active control is considered. Linked lists are used in a matrix data structure to implement the trapezoidal rule on the system differential equations. The use of the trapezoidal rule ensures that the numerical stability is equivalent to the system stability, which is essential for this type of simulation. The sparsity of the system matrices is exploited by the linked lists, and the algorithm efficiently steps through the lists in an orderly fashion. Results of simulations on a NASA large space structure experiment are reported.

Quan, Ralph↗
NASA NTRS1972

Space shuttle guidance, navigation and control equation document no. 4: Precision state and filter weighting matrix extrapolation

The Precision State and Filter Weighting Matrix Extrapolation Routine is described which provides the capability to extrapolate any spacecraft geocentric state vector either backwards or forwards in time through a force field consisting of the earth's primary central-force gravitational attraction and a superimposed perturbing acceleration. The routine also provides the capability of extrapolating the filter-weighting matrix along the precision trajectory. This matrix is a square root form of the error covariance matrix and contains statistical information relative to the accuracies of the state vectors and certain other optionally estimated quantities. The routine is a cooled algorithm for the numerical solution of modified forms of the basic differential equations which are satisfied by the geocentric state vector of the spacecraft's center of mass and by the filter-weighting matrix.

Robertson, W. M.↗
NASA NTRS1975

Relaxation methods in fluid mechanics

The present work considers the iterative solution of a coupled set of difference equations and examines methods that carry successive approximates to a state that is invariant with further iteration and independent of the initial guess. Methods are studied with regard to their efficiency and economy of computer resources. The basic principles of classical relaxation are set forth, with attention confined to linear elliptic equations. This discussion involves the evaluation of the spectral radius that is the magnitude of the eigenvalue with largest modulus. The subject of relaxation is then related to the study of ordinary differential equations and hyperbolic partial differential equations. Problems that occur when linearly dependent eigenvectors appear in the relaxation matrix are discussed, leading to multiply connected eigenvalues in the Jordan canonical form. Finally, a brief survey of relaxation methods used in aerodynamics is given.

Lomax, H.↗