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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1998

Frequency-Domain Analysis of Diffusion-Cooled Hot-Electron Bolometer Mixers

A new theoretical model is introduced to describe heterodyne mixer conversion efficiency and noise (from thermal fluctuation effects) in diffusion-cooled superconducting hot-electron bolometers. The model takes into account the non-uniform internal electron temperature distribution generated by Wiedemann-Franz heat conduction, and accepts for input an arbitrary (analytical or experimental) superconducting resistance-versus- temperature curve. A non-linear large-signal solution is solved iteratively to calculate the temperature distribution, and a linear frequency-domain small-signal formulation is used to calculate conversion efficiency and noise. In the small-signal solution the device is discretized into segments, and matrix algebra is used to relate the heating modulation in the segments to temperature and resistance modulations. Matrix expressions are derived that allow single-sideband mixer conversion efficiency and coupled noise power to be directly calculated. The model accounts for self-heating and electrothermal feedback from the surrounding bias circuit.

Skalare, A.↗
NASA NTRS1982

A general algorithm for solving the algebraic Riccati equation

The generalized eigenvalue problem provides a suitable framework for reliable solutions of many system theoretic, control, and estimation problems. A general algorithm for solving the matrix algebraic Riccati equation (ARE) which utilizes a pencil structure is described here. This algorithm avoids unnecessary inversion of cost or transition matrices, making it a numerically sound way to solve for the gains and/or ARE with singular quadratic costs, for cases satisfying detectability and stabilizability conditions. Examples are solution with discrete dead-beat control, noiseless measurements in Kalman filters and time-delays in discrete-time systems, which cause difficulties in the Hamiltonian standard eigenvalue problem formulation. The ARE algorithm implementatiton and numerical examples are shown.

Walker, R. A.↗
NASA NTRS1978

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.↗
NASA NTRS1949

Response of a Rotating Propeller to Aerodynamic Excitation

The flexural vibration of a rotating propeller blade with clamped shank is analyzed with the object of presenting, in matrix form, equations for the elastic bending moments in forced vibration resulting from aerodynamic forces applied at a fixed multiple of rotational speed. Matrix equations are also derived which define the critical speeds end mode shapes for any excitation order and the relation between critical speed and blade angle. Reference is given to standard works on the numerical solution of matrix equations of the forms derived. The use of a segmented blade as an approximation to a continuous blade provides a simple means for obtaining the matrix solution from the integral equation of equilibrium, so that, in the numerical application of the method presented, the several matrix arrays of the basic physical characteristics of the propeller blade are of simple form, end their simplicity is preserved until, with the solution in sight, numerical manipulations well-known in matrix algebra yield the desired critical speeds and mode shapes frame which the vibration at any operating condition may be synthesized. A close correspondence between the familiar Stodola method and the matrix method is pointed out, indicating that any features of novelty are characteristic not of the analytical procedure but only of the abbreviation, condensation, and efficient organization of the numerical procedure made possible by the use of classical matrix theory.

Arnoldi, Walter E.↗
DOE OSTI2025

A Linear-Complexity Tensor Butterfly Algorithm for Compressing High-Dimensional Oscillatory Integral Operators

This paper presents a multilevel tensor compression algorithm called tensor butterfly algorithm for efficiently representing large-scale and high-dimensional oscillatory integral operators, including Green's functions for wave equations and integral transforms such as Radon transforms and Fourier transforms. The proposed algorithm leverages a tensor extension of the so-called complementary low-rank property of existing matrix butterfly algorithms. The algorithm partitions the discretized integral operator tensor into subtensors of multiple levels and factorizes each subtensor at the middle level as a Tucker-type interpolative decomposition, whose factor matrices are formed in a multilevel fashion. For a d-dimensional (d > 1) integral operator discretized into a 2d-mode tensor with n2d entries, the overall CPU time and memory requirement scale as O(nd), in stark contrast to the O(nd log n) complexity of existing matrix algorithms such as matrix butterfly algorithms and fast Fourier transforms (FFTs), where n is the number of points per direction. When comparing with other tensor algorithms such as quantized tensor train (QTT), the proposed algorithm also shows superior CPU and memory performance for tensor contraction. Remarkably, the tensor butterfly algorithm can efficiently model high-frequency Green's function interactions between two unit cubes, each spanning 512 wavelengths per direction, which represents problems of scale over 512× larger than that existing butterfly algorithms can handle, with the same amount of computation resources. On the other hand, for a problem representing 64 wavelengths per direction, which is the largest size existing algebraic matrix algorithms can handle, our tensor butterfly algorithm exhibits 200x speedups and 30× memory reduction compared with existing ones. Moreover, the tensor butterfly algorithm also permits O(nd)-complexity FFTs and Radon transforms up to d = 6 dimensions.

Kielstra, P Michael↗
DOE OSTI2024

MAGMA: Enabling exascale performance with accelerated BLAS and LAPACK for diverse GPU architectures

MAGMA (Matrix Algebra for GPU and Multicore Architectures) is a pivotal open-source library in the landscape of GPU-enabled dense and sparse linear algebra computations. With a repertoire of approximately 750 numerical routines across four precisions, MAGMA is deeply ingrained in the DOE software stack, playing a crucial role in high-performance computing. Notable projects such as ExaConstit, HiOP, MARBL, and STRUMPACK, among others, directly harness the capabilities of MAGMA. In addition, the MAGMA development team has been acknowledged multiple times for contributing to the vendors’ numerical software stacks. Looking back over the time of the Exascale Computing Project (ECP), we highlight how MAGMA has adapted to recent changes in modern HPC systems, especially the growing gap between CPU and GPU compute capabilities, as well as the introduction of low precision arithmetic in modern GPUs. We also describe MAGMA’s direct impact on several ECP projects. Maintaining portable performance across NVIDIA and AMD GPUs, and with current efforts toward supporting Intel GPUs, MAGMA ensures its adaptability and relevance in the ever-evolving landscape of GPU architectures.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1968

MOP /Matrix Operation Programs system/

MOP /Matrix Operation Programs/ system consists of a set of FORTRAN 4 subroutines which are related through a small common allocation. The system accomplishes all matrix algebra operations plus related input-output and housekeeping details.

Muller, P. M.↗
NASA NTRS1971

Study-simulation of space station dynamics

Matrix algebra translator and executor /MATE/ takes equations describing structural control system environmental interaction problem for flexible spacecraft components and loads them into self programming computer.

Gaitens, M. J.↗
NASA NTRS1972

A linear programming manual

Computer solutions of linear programming problems are outlined. Information covers vector spaces, convex sets, and matrix algebra elements for solving simultaneous linear equations. Dual problems, reduced cost analysis, ranges, and error analysis are illustrated.

Tuey, R. C.↗
NASA NTRS1976

On differential transformations between Cartesian and curvilinear (geodetic) coordinates

Differential transformations are developed between Cartesian and curvilinear orthogonal coordinates. Only matrix algebra is used for the presentation of the basic concepts. After defining the reference systems used the rotation (R), metric (H), and Jacobian (J) matrices of the transformations between cartesian and curvilinear coordinate systems are introduced. A value of R as a function of H and J is presented. Likewise an analytical expression for J(-1) as a function of H(-2) and R is obtained. Emphasis is placed on showing that differential equations are equivalent to conventional similarity transformations. Scaling methods are discussed along with ellipsoidal coordinates. Differential transformations between elipsoidal and geodetic coordinates are established.

Soler, T.↗
NASA NTRS1977

Control logic to track the outputs of a command generator or randomly forced target

A procedure is presented for synthesizing time-invariant control logic to cause the outputs of a linear plant to track the outputs of an unforced (or randomly forced) linear dynamic system. The control logic uses feed-forward of the reference system state variables and feedback of the plant state variables. The feed-forward gains are obtained from the solution of a linear algebraic matrix equation of the Liapunov type. The feedback gains are the usual regulator gains, determined to stabilize (or augment the stability of) the plant, possibly including integral control. The method is applied here to the design of control logic for a second-order servomechanism to follow a linearly increasing (ramp) signal, an unstable third-order system with two controls to track two separate ramp signals, and a sixth-order system with two controls to track a constant signal and an exponentially decreasing signal (aircraft landing-flare or glide-slope-capture with constant velocity).

Trankle, T. L.↗
NASA NTRS1978

Extending reliability: Transformational tailoring of abstract mathematical software

Methods for automatically constructing concrete executable programs from an abstract prototype program by applying transformations based on theorems of matrix algebra and on algebraic properties of programming languages are described. These methods provide a user with highly efficient programs tailored to his environment while maintaining the advantages of high reliability and low cost associated with routines from the best mathematical software libraries. Also, the transformations which produce such programs represent a formal codification of rules for writing linear algebra programs.

Boyle, J. M.↗
NASA NTRS1979

A general and computationally fast formulation for radiative transfer with scattering

A general formulation of monocromatic radiative transfer with scattering has been developed for plane-parallel geometry. The inhomogeneous and nonisothermal medium absorbs, emits, and anisotropically scatters radiation. Surfaces can emit and scatter radiation in any specified manner. The solution procedure uses the fact that phase incoherent scattering is linear in radiative sources. Certain basic scattering functions are then defined and calculated by an adding computer code using matrix algebra. These scattering functions are weighted by the temperature field and summed (superimposed) to obtain the solution for any specific problem. Numerical results for exiting intensities and one-sided heat fluxes from general media bound by one arbitrary surface are presented. These parametric studies demonstrate the effects of scattering particles and surfaces on radiative transfer from inhomogeneous and nonisothermal media. Application of the formulation to radiative equilibrium is also discussed. The conclusion is that all problems in plane-parallel radiative transfer with scattering can be solved by a common and computationally fast algorithm based on this formulation.

Cogley, A. C.↗
NASA NTRS1979

On the overlapping plate method in astrometry

A method is proposed for the simplification of the algorithms of Eichhorn and Russell (1976) for obtaining the solutions of astrometric problems using the overlapping plate method. The method provides the parameter vector (consisting of 'star constants' and plate constants) as well as the covariance matrix of the parameters. A considerable reduction in the amount of matrix algebra required is obtained with the present method.

Jefferys, W. H.↗
NASA NTRS1987

Interactive application of quadratic expansion of chi-square statistic to nonlinear curve fitting

This report contains a detailed theoretical description of an all-purpose, interactive curve-fitting routine that is based on P. R. Bevington's description of the quadratic expansion of the Chi-Square statistic. The method is implemented in the associated interactive, graphics-based computer program. Taylor's expansion of Chi-Square is first introduced, and justifications for retaining only the first term are presented. From the expansion, a set of n simultaneous linear equations is derived, then solved by matrix algebra. A brief description of the code is presented along with a limited number of changes that are required to customize the program of a particular task. To evaluate the performance of the method and the goodness of nonlinear curve fitting, two typical engineering problems are examined and the graphical and tabular output of each is discussed. A complete listing of the entire package is included as an appendix.

Badavi, F. F.↗