Search NASASearch

SEARCH · Search NASA

Results for “Matrix inversion”

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

Spatial operator approach to flexible manipulator inverse and forward dynamics

This study extends to flexible multibody manipulators the recent results of the author on the use of spatially recursive filtering and smoothing techniques for robot arm dynamics. The configuration analyzed is that of a mechanical system of flexible bodies joined together by articulated joints. The inverse and forward dynamics problems are solved using the techniques of spatially recursive Kalman filtering and smoothing. The algorithms are easily developed using a set of identities associated with mass matrix factorization and inversion. The identities are easily derived using a spatial operator algebra developed by the author.

Rodriguez, G.

Computationally Efficient Modeling and Simulation of Large Scale Systems

A system for simulating operation of a VLSI interconnect structure having capacitive and inductive coupling between nodes thereof, including a processor, and a memory, the processor configured to perform obtaining a matrix X and a matrix Y containing different combinations of passive circuit element values for the interconnect structure, the element values for each matrix including inductance L and inverse capacitance P, obtaining an adjacency matrix A associated with the interconnect structure, storing the matrices X, Y, and A in the memory, and performing numerical integration to solve first and second equations.

Jain, Jitesh

Spatial operator approach to flexible multibody system dynamics and control

The inverse and forward dynamics problems for flexible multibody systems were solved using the techniques of spatially recursive Kalman filtering and smoothing. These algorithms are easily developed using a set of identities associated with mass matrix factorization and inversion. These identities are easily derived using the spatial operator algebra developed by the author. Current work is aimed at computational experiments with the described algorithms and at modelling for control design of limber manipulator systems. It is also aimed at handling and manipulation of flexible objects.

Rodriguez, G.

Round-off errors in cutting plane algorithms based on the revised simplex procedure

This report statistically analyzes computational round-off errors associated with the cutting plane approach to solving linear integer programming problems. Cutting plane methods require that the inverse of a sequence of matrices be computed. The problem basically reduces to one of minimizing round-off errors in the sequence of inverses. Two procedures for minimizing this problem are presented, and their influence on error accumulation is statistically analyzed. One procedure employs a very small tolerance factor to round computed values to zero. The other procedure is a numerical analysis technique for reinverting or improving the approximate inverse of a matrix. The results indicated that round-off accumulation can be effectively minimized by employing a tolerance factor which reflects the number of significant digits carried for each calculation and by applying the reinversion procedure once to each computed inverse. If 18 significant digits plus an exponent are carried for each variable during computations, then a tolerance value of 0.1 x 10 to the minus 12th power is reasonable.

Moore, J. E.

Alternate Inversion Paradigm for Spectroheliogram Data

Over the past five years, new methods to reconstruct spectrally pure maps of the Sun from spectroheliogram data have emerged, essentially unlocking this long-abandoned method of obtaining both spatial and spectral information over a large field of view simultaneously. The original inversion method determined the plasma’s emission measure distribution as a function of temperature at every spatial location in the field of view. To complete this inversion, a response matrix had to be created mapping the emission measure in different (temperature, space) bins to detector, requiring assumptions on the thermal and ionization equilibrium and abundance state of the plasma. We have since derived a new method of the inversion that does not require these atomic assumptions to be made. Instead, we use only the different locations of spectral lines from the same ion species and the possible ratios of those single-species spectral lines, removing the need for a priori knowledge on the state of the emitting plasma. In this presentation, we demonstrate this method using observed data from the Marshall Grazing Incidence X-ray Spectrometer (MaGIXS) and simulated data from the EUV CME and Coronal Connectivity Observatory (ECCCO) investigation.

Amy Winebarger

Recursive Robot-Arm Dynamics via Filtering and Smoothing

Forward and inverse dynamics solved using Kalman filtering and Bryson-Frazier smoothing. Dynamics of serial-link robot arm solved by using recursive techniques from linear filtering and smoothing theory. Solutions of dynamical equations give forces, moments, and accelerations at joints between links, and multilink inertia matrix and its inverse. Theoretical developments lay foundation for use of filtering and smoothing techniques in design of robot controls.

Rodriguez, Guillermo

An Analytical State Transition Matrix for Orbits Perturbed by an Oblate Spheroid

An analytical state transition matrix and its inverse, which include the short period and secular effects of the second zonal harmonic, were developed from the nonsingular PS satellite theory. The fact that the independent variable in the PS theory is not time is in no respect disadvantageous, since any explicit analytical solution must be expressed in the true or eccentric anomaly. This is shown to be the case for the simple conic matrix. The PS theory allows for a concise, accurate, and algorithmically simple state transition matrix. The improvement over the conic matrix ranges from 2 to 4 digits accuracy.

Mueller, A. C.

Recursive dynamics of topological trees of rigid bodies via Kalman filtering and Bryson-Frazier smoothing

The inverse and forward dynamics problems for a set of rigid bodies connected by hinges to form a topological tree are solved by using recursive techniques from linear filtering and smoothing theory. An inward filtering sequence computes a set of constraint moments and forces. This is followed by an outward sequence to determine a corresponding set of angular and linear accelerations. An inward sequence begins at the tips of all of the terminal bodies of the tree and proceeds inwardly through all of the branches until it reaches the root. Similarly, an outward sequence begins at the root and propagates to all of the tree branches until it reaches the tips of the terminal bodies. The paper also provides an approach to evaluate recursively the composite multibody system inertia matrix and its inverse.

Rodriguez, G.

Kalman filtering, smoothing and recursive robot arm forward and inverse dynamics

The inverse and forward dynamics problems for multi-link serial manipulators are solved by using recursive techniques from linear filtering and smoothing theory. The pivotal step is to cast the system dynamics and kinematics as a two-point boundary-value problem. Solution of this problem leads to filtering and smoothing techniques identical to the equations of Kalman filtering and Bryson-Frazier fixed time-interval smoothing. The solutions prescribe an inward filtering recursion to compute a sequence of constraint moments and forces followed by an outward recursion to determine a corresponding sequence of angular and linear accelerations. In addition to providing techniques to compute joint accelerations from applied joint moments (and vice versa), the report provides an approach to evaluate recursively the composite multi-link system inertia matrix and its inverse. The report lays the foundation for the potential use of filtering and smoothing techniques in robot inverse and forward dynamics and in robot control design.

Rodriguez, G.

Control of a slow moving space crane as an adaptive structure

Assuming that the space crane is an adaptive structure with length-adjustable bars and taking as controls the length-adjustments of these bars, the computation of the incremental controls corresponding to the motion of a payload along its minimum-energy trajectory is given in terms of the inverse-transpose of matrix B of the joint equilibrium equations Bs = p, where s lists the bar forces and p lists the nodal loads. The compensation of the controls for elastic deformations and support movements are shown. It is also shown that the computations may be done automatically and in real time by an attached processor once the characteristics of the crane's maneuver are keyed in.

Utku, S.

A restricted signature normal form for Hermitian matrices, quasi-spectral decompositions, and applications

In recent years, a number of results on the relationships between the inertias of Hermitian matrices and the inertias of their principal submatrices appeared in the literature. We study restricted congruence transformation of Hermitian matrices M which, at the same time, induce a congruence transformation of a given principal submatrix A of M. Such transformations lead to concept of the restricted signature normal form of M. In particular, by means of this normal form, we obtain short proofs of most of the known inertia theorems and also derive some new results of this type. For some applications, a special class of almost unitary restricted congruence transformations turns out to be useful. We show that, with such transformations, M can be reduced to a quasi-diagonal form which, in particular, displays the eigenvalues of A. Finally, applications of this quasi-spectral decomposition to generalize inverses and Hermitian matrix pencils are discussed.

Freund, Roland W.

Performance of a focused cavity aerosol spectrometer for measurements in the stratosphere of particle size in the 0.06-2.0-micrometer-diameter range

A focused cavity aerosol spectrometer aboard a NASA ER-2 high-altitude aircraft provided high-resolution measurements of the size of the stratospheric particles in the 0.06-2.0-micrometer-diameter range in flights following the eruption of Mount Pinatubo in 1991. Effects of anisokinetic sampling and evaporation in the sampling system were accounted for by means adapted and specifically developed for this instrument. Calibrations with monodisperse aerosol particles provided the instrument's response matrix, which upon inversion during data reduction yielded the particle size distributions. The resultant dataset is internally consistent and generally shows agreement to within a factor of 2 with comparable measurements simultaneously obtained by a condensation nuclei counter, a forward-scattering spectrometer probe, and aerosol particle impactors, as well as with nearby extinction profiles obtained by satellite measurements and with lidar measurements of backscatter.

Jonsson, H. H.

Inverse Solution to the Electronic Crosstalk Correction of Bands 27-30 in Terra MODIS

In the Terra MODIS Collection 6.1 (C6.1) Level-1B (L1B) product, an electronic crosstalk correction is implemented for bands 27 30 using a linear algorithm. In this algorithm, the measured (contaminated) signal from the detectors in the bands was used as a reference signal for deriving the correction coefficients from lunar images and for applying the correction to the calibration and L1B data. As the mission progressed, the level of contamination steadily increased in each detector, with an additional large increase associated with the Terra MODIS safe-mode anomaly in February of 2016. In this work, we developed a modified algorithm for deriving the crosstalk coefficients and applying the correction which uses the inverse crosstalk coefficient matrix in order to remove the contamination from the reference signal. We apply the coefficients using this modified algorithm to calibration and Earth-view data in order to assess the difference with the data in C6.1. We also perform calculations using simulated contamination to show the difference in the recovery of the corrected signal between the C6.1 algorithm and the modified algorithm. We will show, that although the current levels of contamination are much higher than early in the mission, the overall impact of having contamination on the reference signal for the correction is small. However, this impact is non-linear as a function of the magnitude of the contamination level, so it should be monitored as the mission continues.

Truman Wilson

Kinematic equations for control of the redundant eight-degree-of-freedom advanced research manipulator 2

The forward position and velocity kinematics for the redundant eight-degree-of-freedom Advanced Research Manipulator 2 (ARM2) are presented. Inverse position and velocity kinematic solutions are also presented. The approach in this paper is to specify two of the unknowns and solve for the remaining six unknowns. Two unknowns can be specified with two restrictions. First, the elbow joint angle and rate cannot be specified because they are known from the end-effector position and velocity. Second, one unknown must be specified from the four-jointed wrist, and the second from joints that translate the wrist, elbow joint excluded. There are eight solutions to the inverse position problem. The inverse velocity solution is unique, assuming the Jacobian matrix is not singular. A discussion of singularities is based on specifying two joint rates and analyzing the reduced Jacobian matrix. When this matrix is singular, the generalized inverse may be used as an alternate solution. Computer simulations were developed to verify the equations. Examples demonstrate agreement between forward and inverse solutions.

Williams, Robert L., II

The updated statistical inversion technique to the evaluation of Umkehr observations

In the present study the standard retrieval Umkehr method to estimate the vertical distribution of ozone was updated using a statistical approach to the mathematical inversion scheme. The vertical ozone profile covariance matrix was used as a priori information for the inverse problem. A new method of the ozonesonde data organization according to air mass types helped to improve the covariance matrix quality. A retrieval method was developed using eigenvector technique. An optimal vertical ozone profile resolution was determined from the mathematical inversion scheme analysis based on the same technique. The sun radiation transfer was accounted for multiple scattering and atmospheric sphericity in this calculation. The retrievals using actual Umkehr Dobson spectrophotometer observations were also performed to provide the comparison of the standard and updated methods with concurrent ozone sound data at Boulder U.S. The comparison has revealed that the present method has some advantages in both resolution and accuracy, as compared to the standard one, especially for the atmospheric layers below ozone maximum.

Frolov, Alexander D.

Parallel Preconditioning for CFD Problems on the CM-5

Up to today, preconditioning methods on massively parallel systems have faced a major difficulty. The most successful preconditioning methods in terms of accelerating the convergence of the iterative solver such as incomplete LU factorizations are notoriously difficult to implement on parallel machines for two reasons: (1) the actual computation of the preconditioner is not very floating-point intensive, but requires a large amount of unstructured communication, and (2) the application of the preconditioning matrix in the iteration phase (i.e. triangular solves) are difficult to parallelize because of the recursive nature of the computation. Here we present a new approach to preconditioning for very large, sparse, unsymmetric, linear systems, which avoids both difficulties. We explicitly compute an approximate inverse to our original matrix. This new preconditioning matrix can be applied most efficiently for iterative methods on massively parallel machines, since the preconditioning phase involves only a matrix-vector multiplication, with possibly a dense matrix. Furthermore the actual computation of the preconditioning matrix has natural parallelism. For a problem of size n, the preconditioning matrix can be computed by solving n independent small least squares problems. The algorithm and its implementation on the Connection Machine CM-5 are discussed in detail and supported by extensive timings obtained from real problem data.

Simon, Horst D.