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 217 records · Page 12

Finite-Difference Algorithms For Computing Sound Waves

Governing equations considered as matrix system. Method variant of method described in "Scheme for Finite-Difference Computations of Waves" (ARC-12970). Present method begins with matrix-vector formulation of fundamental equations, involving first-order partial derivatives of primitive variables with respect to space and time. Particular matrix formulation places time and spatial coordinates on equal footing, so governing equations considered as matrix system and treated as unit. Spatial and temporal discretizations not treated separately as in other finite-difference methods, instead treated together by linking spatial-grid interval and time step via common scale factor related to speed of sound.

Davis, Sanford

Numerical solution of the state dependent noise problem

A numerical technique is given for solving the matrix quadratic equation that arises in the optimal stationary control of linear systems with state (and/or control) dependent noise. The technique exploits fully existing, efficient algorithms for the matrix Lyapunov and Ricatti equations. The computational requirements are discussed, with an associated example.

Kleinman, D. L.

Comparison of some optimal control methods for the design of turbine blades

This paper attempts a comparative study of some numerical methods for the optimal control design of turbine blades whose vibration characteristics are approximated by Timoshenko beam idealizations with shear and incorporating simple boundary conditions. The blade was synthesized using the following methods: (1) conjugate gradient minimization of the system Hamiltonian in function space incorporating penalty function transformations, (2) projection operator methods in a function space which includes the frequencies of vibration and the control function, (3) epsilon-technique penalty function transformation resulting in a highly nonlinear programming problem, (4) finite difference discretization of the state equations again resulting in a nonlinear program, (5) second variation methods with complex state differential equations to include damping effects resulting in systems of inhomogeneous matrix Riccatti equations some of which are stiff, (6) quasi-linear methods based on iterative linearization of the state and adjoint equation. The paper includes a discussion of some substantial computational difficulties encountered in the implementation of these techniques together with a resume of work presently in progress using a differential dynamic programming approach.

Desilva, B. M. E.

Automatic Overset Grid Generation with Heuristic Feedback Control

An advancing front grid generation system for structured Overset grids is presented which automatically modifies Overset structured surface grids and control lines until user-specified grid qualities are achieved. The system is demonstrated on two examples: the first refines a space shuttle fuselage control line until global truncation error is achieved; the second advances, from control lines, the space shuttle orbiter fuselage top and fuselage side surface grids until proper overlap is achieved. Surface grids are generated in minutes for complex geometries. The system is implemented as a heuristic feedback control (HFC) expert system which iteratively modifies the input specifications for Overset control line and surface grids. It is developed as an extension of modern control theory, production rules systems and subsumption architectures. The methodology provides benefits over the full knowledge lifecycle of an expert system for knowledge acquisition, knowledge representation, and knowledge execution. The vector/matrix framework of modern control theory systematically acquires and represents expert system knowledge. Missing matrix elements imply missing expert knowledge. The execution of the expert system knowledge is performed through symbolic execution of the matrix algebra equations of modern control theory. The dot product operation of matrix algebra is generalized for heuristic symbolic terms. Constant time execution is guaranteed.

Robinson, Peter I.

Research on the application of a decoupling algorithm for structure analysis

The mathematical theory for decoupling mth-order matrix differential equations is presented. It is shown that the decoupling precedure can be developed from the algebraic theory of matrix polynomials. The role of eigenprojectors and latent projectors in the decoupling process is discussed and the mathematical relationships between eigenvalues, eigenvectors, latent roots, and latent vectors are developed. It is shown that the eigenvectors of the companion form of a matrix contains the latent vectors as a subset. The spectral decomposition of a matrix and the application to differential equations is given.

Denman, E. D.

Integration-free interval doubling for Riccati equation solutions

Starting with certain identities obtained by Reid (1972) and Redheffer (1962) for general matrix Riccati equations (RE's), we give various algorithms for the case of constant coefficients. The algorithms are based on two ideas - first, relate the RE solution with general initial conditions to anchored RE solutions; and second, when the coefficients are constant, the anchored solutions have a basic shift-invariance property. These ideas are used to construct an integration-free, superlinearly convergent iterative solution to the algebraic RE. Preliminary numerical experiments show that our algorithms, arranged in square-root form, provide a method that is numerically stable and appears to be competitive with other methods of solving the algebraic RE.

Sidhu, G. S.

The solution of variable-step implicit difference equations for dynamic systems analysis

A semi-implicit iterative technique is given for the solution of implicit matrix difference equations which arise in variable-step direct time integration of dynamic systems equations. For all practical purposes, the technique avoids repeated refactoring of the stepsize-dependent solution matrix and achieves the solution convergence for engineering accuracy requirements within a permissible number of iterations. Extension of the present method to nonlinear problems treated by the pseudo-force procedure is straightforward. For nonlinear solution procedures based on the tangent modulus formulation, the technique requires modification to make use of the tangent stiffness matrix. It is noted that the question of whether to include the nonlinear terms within the iteration loop has not yet been resolved.

Park, K. C.

Stabilization of computational procedures for constrained dynamical systems

A new stabilization method of treating constraints in multibody dynamical systems is presented. By tailoring a penalty form of the constraint equations, the method achieves stabilization without artificial damping and yields a companion matrix differential equation for the constraint forces; hence, the constraint forces are obtained by integrating the companion differential equation for the constraint forces in time. A principal feature of the method is that the errors committed in each constraint condition decay with its corresponding characteristic time scale associated with its constraint force. Numerical experiments indicate that the method yields a marked improvement over existing techniques.

Park, K. C.

User's Manual for PCSMS (Parallel Complex Sparse Matrix Solver)

PCSMS (Parallel Complex Sparse Matrix Solver) is a computer code written to make use of the existing real sparse direct solvers to solve complex, sparse matrix linear equations. PCSMS converts complex matrices into real matrices and use real, sparse direct matrix solvers to factor and solve the real matrices. The solution vector is reconverted to complex numbers. Though, this utility is written for Silicon Graphics (SGI) real sparse matrix solution routines, it is general in nature and can be easily modified to work with any real sparse matrix solver. The User's Manual is written to make the user acquainted with the installation and operation of the code. Driver routines are given to aid the users to integrate PCSMS routines in their own codes.

Reddy, C. J.

Buckling and vibration of periodic lattice structures

Lattice booms and platforms composed of flexible members or large diameter rings which may be stiffened by cables in order to support membrane-like antennas or reflector surfaces are the main components of some large space structures. The nature of these structures, repetitive geometry with few different members, makes possible relatively simple solutions for buckling and vibration of a certain class of these structures. Each member is represented by a stiffness matrix derived from the exact solution of the beam column equation. This transcendental matrix gives the current member stiffness at any end load or frequency. Using conventional finite element techniques, equilibrium equations can be written involving displacements and rotations of a typical node and its neighbors. The assumptions of a simple trigonometric mode shape is found to satisfy these equations exactly; thus the entire problem is governed by just one 6 x 6 matrix equation involving the amplitude of the displacement and rotation mode shapes. The boundary conditions implied by this solution are simple supported ends for the column type configurations.

Anderson, M. S.

An efficient approximate factorization implicit scheme for the equations of gasdynamics

An efficient implicit finite-difference algorithm for the gas dynamic equations utilizing matrix reduction techniques is presented. A significant reduction in arithmetic operations is achieved while maintaining the same favorable stability characteristics and generality found in the Beam and Warming approximate factorization algorithm. Steady-state solutions to the conservative Euler equations in generalized coordinates are obtained for transonic flows about a NACA 0012 airfoil. The theoretical extension of the matrix reduction technique to the full Navier-Stokes equations in Cartesian coordinates is presented in detail. Linear stability, using a Fourier stability analysis, is demonstrated and discussed for the one-dimensional Euler equations. It is shown that the method offers advantages over the conventional Beam and Warming scheme and can retrofit existing Beam and Warming codes with minimal effort.

Barth, T. J.

Attitude control of a spinning Skylab.

Active attitude control of a spinning Skylab is analyzed to determine a simple control law that will provide a satisfactory response, considering the dynamics of attached flexible appendages. A simplified model of the complex Skylab vehicle is selected to make it analytically tractable. The vehicle is modeled as a single rigid-core body with two attached flexible massless booms having masses on their tips. The equations of motion describing the attitude dynamics of the model are presented as a linear matrix-differential equation. The states of the vehicle are small perturbations about its steady-state spin. An analysis is performed to determine the domain of stability. Next, attitude dynamics are analyzed; both frequency domain (parameter plane) and time domain (an optimal linear quadratic loss program) techniques are compared. An analysis of the nonlinear effect of control torque saturation of Skylab's control moment gyroscopes is discussed. The results of the analysis compare favorably with a large-scale digital simulation of the Skylab.

Seltzer, S. M.

Efficient Sequential Attitude Estimation from Vector Observations

This paper presents a computationally efficient, sequential method for attitude matrix estimation using gyro and vector measurements. The method is based on a recently introduced, minimal-parameter third-order method for solving the orthogonal matrix differential equation in R(sup n). In the three-dimensional case, these third-order attitude parameters can be interpreted as temporal-integrals of the body-frame angular velocity components. A nonlinear algorithm is developed, which uses this minimal set of three parameters to estimate the nine-parameter direction-cosine matrix. Having an extremely simple kinematic equation, these parameters render the resulting estimator highly computationally efficient. An orthogonalization procedure, incorporated into the measurement processing stage, enhances the accuracy and stability of the resulting algorithm, yet retains reasonable simplicity. The performance of the estimator is demonstrated via a Monte Carlo simulation study.

Oshman, Yaakov

Integrating matrix solution of the hybrid state vector equations for beam vibration

A simple, versatile, and efficient computational technique has been developed for dynamic analysis of linear elastic beam and rod type of structures. Moreover, the method provides a rather general solution approach for two-point boundary value problems that are described by a single independent spatial variable. For structural problems, the method is implemented by a mixed state vector formulation of the differential equations, combined with an integrating matrix solution procedure. Highly accurate solutions are easily achieved with this approach. Example solutions are given for beam vibration problems including discontinuous stiffness and mass parameters, elastic restraint boundary conditions, concentrated inertia loading, and rigid body modes

Lehman, L. L.

Adaptive Filtering for Large Space Structures: A Closed-Form Solution

In a previous paper Schaechter proposes using an extended Kalman filter to estimate adaptively the (slowly varying) frequencies and damping ratios of a large space structure. The time varying gains for estimating the frequencies and damping ratios can be determined in closed form so it is not necessary to integrate the matrix Riccati equations. After certain approximations, the time varying adaptive gain can be written as the product of a constant matrix times a matrix derived from the components of the estimated state vector. This is an important savings of computer resources and allows the adaptive filter to be implemented with approximately the same effort as the nonadaptive filter. The success of this new approach for adaptive filtering was demonstrated using synthetic data from a two mode system.

Rauch, H. E.

LU and Cholesky decomposition on an optical systolic array processor

Direct solutions of matrix-vector equations on an optical systolic array processor are considered. The solutions are discussed and a parallel algorithm for LU matrix decomposition that is very attractive for an optical realization is formulated. It is noted that when direct techniques are used, it is preferable to realize the matrix decomposition on an optical system and to utilize a digital processor for the solution of the simplified resultant matrix-vector problem. One method of realizing LU matrix decomposition on a new frequency-multiplexed optical systolic array matrix-matrix processor is described. A simple method for extending the process of LU decomposition to Cholesky decomposition on the optical processor is discussed.

Casasent, D.