Search NASA⌕ Search

SEARCH · Search NASA

Results for “MATRIX 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.

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

At least 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Compliance matrices for cracked bodies

An algorithm is developed to construct the compliance matrix for a cracked solid in the integral-equation formulation of two-dimensional linear-elastic fracture mechanics. The integral equation is reduced to a system of algebraic equations for unknown values of the dislocation-density function at discrete points on the interval from -1 to 1, using the numerical procedure described by Gerasoulis (1982). Sample numerical results are presented, and it is suggested that the algorithm is especially useful in cases where iterative solutions are required; e.g., models of fiber-reinforced concrete, rocks, or ceramics where microcracking, fiber bridging, and other nonlinear effects are treated as nonlinear springs along the crack surfaces (Ballarini et al., 1984).

Ballarini, R.↗
NASA NTRS1987

Grid adaption for hypersonic flow

The methods of grid adaption are reviewed and a method is developed with the capability of adaption to several flow variables. This method is based on a variational approach and is an algebraic method which does not require the solution of partial differential equations. Also the method has been formulated in such a way that there is no need for any matrix inversion. The method is used in conjunction with the calculation of hypersonic flow over a blunt nose body. The equations of motion are the compressible Navier-Stokes equations where all viscous terms are retained. They are solved by the MacCormack time-splitting method. A movie has been produced which shows simultaneously the transient behavior of the solution and the grid adaption.

Abolhassani, Jamshid S.↗
NASA NTRS1986

Numerical solutions of three-dimensional Navier-Stokes equations for closed-bluff bodies

Methods of grid adaption are reviewed and a method is developed with the capability of adaption to several flow variables. This method is based on a variational approach and is an algebraic method which does not require the solution of partial differential equations. The method has also been formulated in such a way that there is no need for any matrix inversion. The method is used in conjunction with the calculation of hypersonic flow over a blunt nose. The equations of motion are the compressible Navier-Stokes equations where all viscous terms are retained. They are solved by the MacCormack time-splitting method and a movie has been produced which shows simultaneously the transient behavior of the solution and the grid adaption. The results are compared with the experimental and other numerical results.

Abolhassani, Jamshid S.↗
NASA NTRS1991

Closed-form solutions for linear regulator design of mechanical systems including optimal weighting matrix selection

Vibration in modern structural and mechanical systems can be reduced in amplitude by increasing stiffness, redistributing stiffness and mass, and/or adding damping if design techniques are available to do so. Linear Quadratic Regulator (LQR) theory in modern multivariable control design, attacks the general dissipative elastic system design problem in a global formulation. The optimal design, however, allows electronic connections and phase relations which are not physically practical or possible in passive structural-mechanical devices. The restriction of LQR solutions (to the Algebraic Riccati Equation) to design spaces which can be implemented as passive structural members and/or dampers is addressed. A general closed-form solution to the optimal free-decay control problem is presented which is tailored for structural-mechanical system. The solution includes, as subsets, special cases such as the Rayleigh Dissipation Function and total energy. Weighting matrix selection is a constrained choice among several parameters to obtain desired physical relationships. The closed-form solution is also applicable to active control design for systems where perfect, collocated actuator-sensor pairs exist.

Hanks, Brantley R.↗
NASA NTRS1989

Solution of steady-state one-dimensional conservation laws by mathematical programming

Solution techniques for a class of steady-state scalar conservation laws are developed analytically. Discretization by finite-volume formulas is employed to obtain an overdetermined system of algebraic equations, which are then perturbed nonsingularly (with perturbation coefficient = epsilon) and solved using the l(1) mathematical-programming algorithm of Seneta and Steiger (1984); this approach limits the matrix bandwidth to two, so that an explicit solution can be found efficiently. It is shown that, for small values of epsilon, the l(1) solutions exhibit sharp correctly located shocks and are nonoscillatory O(epsilon) approximations of the physically relevant solutions.

Lavery, J. E.↗
NASA NTRS1978

Structural Dynamics, Stability, and Control of Helicopters

The dynamic synthesis of gyroscopic structures consisting of point-connected substructures is investigated. The objective is to develop a mathematical model capable of an adequate simulation of the modal characteristics of a helicopter using a minimum number of degrees of freedom. The basic approach is to regard the helicopter structure as an assemblage of flexible substructures. The variational equations for the perturbed motion about certain equilibrium solutions are derived. The discretized variational equations can be conveniently exhibited in matrix form, and a great deal of information about the system modal characteristics can be extracted from the coefficient matrices. The derivation of the variational equations requires a monumental amount of algebraic operations. To automate this task a symbolic manipulation program on a digital computer is developed.

Meirovitch, L.↗
NASA NTRS1990

Partitioning sparse matrices with eigenvectors of graphs

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

Pothen, Alex↗
NASA NTRS1977

A finite element algorithm for sound propagation in axisymmetric ducts containing compressible mean flow

The described investigation is concerned with he development of a finite element scheme which can be used in a study of the acoustics of aircraft-engine ducts. In the absence of suitable variational principles for acoustic fluctuations within an aircraft fan engine, an acoustic analysis must proceed directly from the differential equations which describe compressible flow. The derived equations cannot be solved algebraically. The numerical technique used for solving them makes use of a linear rectangular element of a type considered by Zienkiewicz (1971). Attention is given to aspects of element derivation, the global matrix assembly, the solution of the matrix equation, questions of acoustic attenuation, and illustrations of the potential of the current model in duct optimization.

Abrahamson, A. L.↗
NASA NTRS1972

The k-space formulation of the n-dimensional scattering problem

The n-dimensional scattering problem is solved by means of a k-space formulation of the field equations, thereby replacing the conventional integral equation formulation by a set of two algebraic equations in two unknowns in two spaces (the constitutive equation being an algebraic equation in x-space). These equations are solved by an iterative method with the aid of the fast Fourier transform (FFT) algorithm connecting the two spaces, requiring very simple initial approximations. Since algebraic and FFT equations are used, the number of arithmetic multiple-add operations and storage allocations required for a numerical solution are reduced from the order of N sq (for solving the matrix equations resulting from the conventional integral equations) to the order of N(log base 2 of N) and N, respectively (where N is the number of data points required for the specification of the problem). The advantage gained in speed and storage is thus of the order of N/log base 2 of N and N, respectively. This method is thus considerably more efficient than the conventional matrix method, and permits exact numerical solutions for much larger problems. Arguments are presented toward the view that the field equations are more fundamental in k-space. The details and some numerical results of the application of this method to the three-dimensional electromagnetic scattering problems are presented as an example.

Bojarski, N. N.↗
NASA NTRS1975

Multidimensional Hermite-Gaussian quadrature formulae and their application to nonlinear estimation

A simplified technique is proposed for calculating multidimensional Hermite-Gaussian quadratures that involves taking the square root of a matrix by the Cholesky algorithm rather than computation of the eigenvectors of the matrix. Ways of reducing the dimension, number, and order of the quadratures are set forth. If the function f(x) under the integral sign is not well approximated by a low-order algebraic expression, the order of the quadrature may be reduced by factoring f(x) into an expression that is nearly algebraic and one that is Gaussian.

Mcreynolds, S. R.↗
NASA NTRS1983

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problems preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗
NASA NTRS1986

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problem preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗
NASA NTRS1990

Application of symbolic computations to the constitutive modeling of structural materials

In applications involving elevated temperatures, the derivation of mathematical expressions (constitutive equations) describing the material behavior can be quite time consuming, involved and error-prone. Therefore intelligent application of symbolic systems to faciliate this tedious process can be of significant benefit. Presented here is a problem oriented, self contained symbolic expert system, named SDICE, which is capable of efficiently deriving potential based constitutive models in analytical form. This package, running under DOE MACSYMA, has the following features: (1) potential differentiation (chain rule), (2) tensor computations (utilizing index notation) including both algebraic and calculus; (3) efficient solution of sparse systems of equations; (4) automatic expression substitution and simplification; (5) back substitution of invariant and tensorial relations; (6) the ability to form the Jacobian and Hessian matrix; and (7) a relational data base. Limited aspects of invariant theory were also incorporated into SDICE due to the utilization of potentials as a starting point and the desire for these potentials to be frame invariant (objective). The uniqueness of SDICE resides in its ability to manipulate expressions in a general yet pre-defined order and simplify expressions so as to limit expression growth. Results are displayed, when applicable, utilizing index notation. SDICE was designed to aid and complement the human constitutive model developer. A number of examples are utilized to illustrate the various features contained within SDICE. It is expected that this symbolic package can and will provide a significant incentive to the development of new constitutive theories.

Arnold, Steven M.↗
DOE OSTI2024

U(1) fields from qubits: An approach via D-theory algebra

A new quantum link microstructure was proposed for the lattice quantum chromodynamics (QCD) Hamiltonian, replacing the Wilson gauge links with a bilinear of fermionic qubits, later generalized to D-theory. This formalism provides a general framework for building lattice field theory algorithms for quantum computing. We focus mostly on the simplest case of a quantum rotor for a single compact U(1) field. We also make some progress for non-Abelian setups, making it clear that the ideas developed in the U(1) case extend to other groups. These in turn are building blocks for 1 + 0 -dimensional ( 1 + 0 -D) matrix models, 1 + 1 -D sigma models and non-Abelian gauge theories in 2 + 1 and 3 + 1 dimensions. By introducing multiple flavors for the U(1) field, where the flavor symmetry is gauged, we can efficiently approach the infinite-dimensional Hilbert space of the quantum O(2) rotor with increasing flavors. The emphasis of the method is on preserving the symplectic algebra exchanging fermionic qubits by sigma matrices (or hard bosons) and developing a formal strategy capable of generalization to a SU ( 3 ) field for lattice QCD and other non-Abelian 1 + 1 -D sigma models or 3 + 1 -D gauge theories. For U(1), we discuss briefly the qubit algorithms for the study of the discrete 1 + 1 -D sine-Gordon equation. Published by the American Physical Society 2024

Astronomy & Astrophysics↗
NASA NTRS1976

Computation and sensitivity considerations of the Ricatti equation in spacecraft CMG steering laws

The steady-state matrix Ricatti equation is studied with respect to sensitivity and computational burden for a linear regulator controller in spacecraft. The class of systems studied use control moment gyros (CMGs) as the torque driver, assuming that the CMGs are free of gimbal stops. Different solution techniques are evaluated relative to computation time and accuracy to determine which solution method is most acceptable with respect to the prescribed requirements. It is shown that it is not feasible to eliminate off-diagonal Ricatti equation terms in the relevent updata equation due to their high sensitivity, that Potter's algebraic technique requires the least computation time of the methods studied, and that the simple Euler method yields the best results when accuracy and computation time are equally weighted. If an optimal linear regulator formulation is employed, a full Ricatti equation solution of n(n + 1)2 elements of the symmetric positive definite gain matrix which is the solution to the matrix Ricatti equation must be computed at each update cycle.

Colburn, B. K.↗
DOE OSTI2026

SCF Framework, HF Stability, and RPA Correlation for Jordan–Wigner-Transformed Spin Hamiltonians on Arbitrary Coupling Topologies

Mapping spins to fermions via the Jordan–Wigner (JW) transformation can render mean-field (Hartree–Fock, HF) descriptions effective for strongly correlated spin systems. As established in recent work, the application of such approaches is not limited by the nonlocal structure of JW strings or by site ordering because string operators can be absorbed into Thouless rotations of a Slater determinant, and the variational optimization of a unitary Lie-algebraic similarity transformation removes any ordering dependence. Leveraging these ideas, we develop a self-consistent field (SCF) scheme that expresses the mean-field energy as a functional of the single-particle density matrix, providing an alternative to gradient-based optimization of Thouless parameters. We derive the analytical orbital Hessian to diagnose HF stability and compute the ground-state correlation energy through the random-phase approximation (RPA). Benchmark results for the XXZ and J 1 –J 2 model on one- and two-dimensional lattices demonstrate that RPA significantly improves mean-field accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1977

On the representation matrices of the spin permutation group

A method is presented for the determination of the representation matrices of the spin permutation group (symmetric group), a detailed knowledge of these matrices being required in the study of the electronic structure of atoms and molecules. The method is characterized by the use of two different coupling schemes. Unlike the Yamanouchi spin algebraic scheme, the method is not recursive. The matrices for the fundamental transpositions can be written down directly in one of the two bases. The method results in a computationally significant reduction in the number of matrix elements that have to be stored when compared with, say, the standard Young tableaux group theoretical approach.

Wilson, S.↗