Search NASASearch

SEARCH · Search NASA

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 235 records · Page 13

A Hybrid Parallel Preconditioning Algorithm For CFD

A new hybrid preconditioning algorithm will be presented which combines the favorable attributes of incomplete lower-upper (ILU) factorization with the favorable attributes of the approximate inverse method recently advocated by numerous researchers. The quality of the preconditioner is adjustable and can be increased at the cost of additional computation while at the same time the storage required is roughly constant and approximately equal to the storage required for the original matrix. In addition, the preconditioning algorithm suggests an efficient and natural parallel implementation with reduced communication. Sample calculations will be presented for the numerical solution of multi-dimensional advection-diffusion equations. The matrix solver has also been embedded into a Newton algorithm for solving the nonlinear Euler and Navier-Stokes equations governing compressible flow. The full paper will show numerous examples in CFD to demonstrate the efficiency and robustness of the method.

Barth,Timothy J.

ORACLS: A system for linear-quadratic-Gaussian control law design

A modern control theory design package (ORACLS) for constructing controllers and optimal filters for systems modeled by linear time-invariant differential or difference equations is described. Numerical linear-algebra procedures are used to implement the linear-quadratic-Gaussian (LQG) methodology of modern control theory. Algorithms are included for computing eigensystems of real matrices, the relative stability of a matrix, factored forms for nonnegative definite matrices, the solutions and least squares approximations to the solutions of certain linear matrix algebraic equations, the controllability properties of a linear time-invariant system, and the steady state covariance matrix of an open-loop stable system forced by white noise. Subroutines are provided for solving both the continuous and discrete optimal linear regulator problems with noise free measurements and the sampled-data optimal linear regulator problem. For measurement noise, duality theory and the optimal regulator algorithms are used to solve the continuous and discrete Kalman-Bucy filter problems. Subroutines are also included which give control laws causing the output of a system to track the output of a prescribed model.

Armstrong, E. S.

Equations for the angles of arrival and departure for multivariable root loci using frequency-domain methods

Frequency domain methods are developed to obtain explicit equations for the angles of arrival and departure for multivariable root loci. The techniques involve an evaluation of polynomials formulated within the transfer function matrix. The equations defined require simpler computations than the state-space results of Shaked (1976). A class of higher order poles and zeros is formulated in terms of simpler equations than Shaked's, and the equations are shown to be generalizations of the single-input-single-output root locus equations.

Yagle, A. E.

A diagonally inverted LU implicit multigrid scheme

A new Diagonally Inverted LU Implicit scheme is developed within the framework of the multigrid method for the 3-D unsteady Euler equations. The matrix systems that are to be inverted in the LU scheme are treated by local diagonalizing transformations that decouple them into systems of scalar equations. Unlike the Diagonalized ADI method, the time accuracy of the LU scheme is not reduced since the diagonalization procedure does not destroy time conservation. Even more importantly, this diagonalization significantly reduces the computational effort required to solve the LU approximation and therefore transforms it into a more efficient method of numerically solving the 3-D Euler equations.

Yokota, Jeffrey W.

A diagonally inverted LU implicit multigrid scheme

A new Diagonally Inverted LU Implicit scheme is developed within the framework of the multigrid method for the three-dimensional unsteady Euler equations. The matrix systems that are to be inverted in the LU scheme are treated by local diagonalizing transformations that decouple them into systems of scalar equations. Unlike the Diagonalized ADI method, the time accuracy of the LU scheme is not reduced since the diagonalizing procedure does not destroy time conservation. Even more importantly, this diagonalization significantly reduces the computational effort required to solve the LU approximation and therefore transforms it into a more efficient method of numerically solving the three-dimensional Euler equations.

Yokota, J. W.

Modal methods in optimal control synthesis

Efficient algorithms for solving linear smoother-follower problems with quadratic criteria are presented. For time-invariant systems, the algorithm consists of one backward integration of a linear vector equation and one forward integration of another linear vector equation. Furthermore, the backward and forward Riccati matrices can be expressed in terms of the eigenvalues and eigenvectors of the Euler-Lagrange equations. Hence, the gains of the forward and backward Kalman-Bucy filters and of the optimal state-feedback regulator can be determined without integration of matrix Riccati equations. A computer program has been developed, based on this method of determining the gains, to synthesize the optimal time-invariant compensator in the presence of random disturbance inputs and random measurement errors. The program also computes the rms state and control variables of the optimal closed-loop system.

Bryson, A. E., Jr.

Linearized ray-trace analysis

A new, coordinate-free version of the exact ray-trace equations for optical systems consisting of conic reflecting, refracting and reference surfaces is presented. These equations are differentiated to obtain closed-form optical sensitivity dyadics. For computation, the sensitivities are evaluated in a single global coordinate frame and combined in linearized ray-trace matrix difference equations that propagate the rays and the sensitivities from element to element. One purpose of this analysis is to create optical models that can be directly integrated with models of the instrument structure and control systems for dynamic simulation.

Redding, David C.

Large-angle slewing maneuvers for flexible spacecraft

A new class of closed-form solutions for finite-time linear-quadratic optimal control problems is presented. The solutions involve Potter's solution for the differential matrix Riccati equation, which assumes the form of a steady-state plus transient term. Illustrative examples are presented which show that the new solutions are more computationally efficient than alternative solutions based on the state transition matrix. As an application of the closed-form solutions, the neighboring extremal path problem is presented for a spacecraft retargeting maneuver where a perturbed plant with off-nominal boundary conditions now follows a neighboring optimal trajectory. The perturbation feedback approach is further applied to three-dimensional slewing maneuvers of large flexible spacecraft. For this problem, the nominal solution is the optimal three-dimensional rigid body slew. The perturbation feedback then limits the deviations from this nominal solution due to the flexible body effects. The use of frequency shaping in both the nominal and perturbation feedback formulations reduces the excitation of high-frequency unmodeled modes. A modified Kalman filter is presented for estimating the plant states.

Chun, Hon M.

A computer package for the design and eigenproblem solution of damped linear multidegree of freedom systems

Systems described by the matrix differental equation are considered. An interactive design routine is presented for positive definite mass, damping, and stiffness matrices. Designing is accomplished by adjusting the mass, damping, and stiffness matrices to obtain a desired oscillation behavior. The algorithm also features interactively modifying the physical structure of the system, obtaining the matrix structure and a number of other system properties. In case of a general system, where the M, C, and K matrices lack any special properties, a routine for the eigenproblem solution of the system is developed. The latent roots are obtained by computing the characteristic polynomial of the system and solving for its roots. The above routines are prepared in FORTRAN IV and prove to be usable for the machines with low core memory.

Ahmadian, M.

Laplace Transform–Based Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation

Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value transformations are well studied, eigenvalue transformations are distinct, especially for nonnormal matrices. Here, we propose an efficient quantum algorithm for performing a class of eigenvalue transformations that can be expressed as a certain type of matrix Laplace transformation. This allows us to significantly extend the recently developed linear combination of Hamiltonian simulation method [D. An, J.-P. Liu, and L. Lin, Phys. Rev. Lett., 131 (2023), 150603; D. An, A. M. Childs, and L. Lin, Commun. Math. Phys. 407, 19 (2026)] to represent a wider class of eigenvalue transformations, such as powers of the matrix inverse, 𝐴 −𝑘 , and the exponential of the matrix inverse, 𝑒 −𝐴 −1 . The latter can be interpreted as the solution of a mass-matrix differential equation of the form form 𝐴⁢𝑢′⁡⁡(𝑡) =−𝑢⁡(𝑡). We demonstrate that our eigenvalue transformation approach can solve this problem without explicitly inverting 𝐴, thereby reducing the computational complexity.

Laplace transform

Optimal filtering in the presence of unmodeled time correlated driving disturbances.

In many realistic data filtering problems, the cross correlation of the state estimation error and the state forcing function is unknown due to the poor knowledge of the time history of the forcing function. In this paper, the conservative and minimal approximation to the cross correlation terms is presented. It requires only the knowledge of the estimation error covariance and the forcing function covariance, with the choice of an associated free parameter left to the user. If the estimation error covariance and/or the forcing function covariance are bounded from above but not known exactly, the cross correlation approximation using those upper bounds remains conservative. This cross correlation approximation leads to a conservative approximation to the estimation error covariance matrix differential equation between measurement times. The free parameter is determined as the analytic solution to an associated optimal control problem. The procedure is expanded to include discrete linear measurement incorporation.

Fraser, D. C.

Perturbation guidance for minimum time flight paths of spacecraft.

The problem of transferring a rocket vehicle from a given circular orbit to a larger coplanar circular orbit in minimum time, using a constant low-thrust rocket engine, is considered. Parameters are chosen to correspond to a transfer from the earth's orbit in heliocentric space to the orbit of Mars. A path satisfying the first order necessary conditions of variational calculus is shown to be locally minimizing by application of a set of second order conditions. A physical explanation is offered to justify the retrothrust period occurring during the flight. A neighboring optimum feedback control law, based on estimated time-to-go, is applied to this problem. State variable and terminal constraint feedback gains are calculated while one of the second order conditions, involving the backward integration of a matrix Riccati equation, is being tested.

Wood, L. J.