Search NASA⌕ Search

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 307 records · Page 17

The inversion of VLF-LF sounder data to obtain D-region electron-density distributions

The direct problem is to compute reflection coefficients for an assumed electron-density profile, using a full-wave solution. The inverse problem is treated numerically, using derivatives of the reflection matrix with respect to model parameters. A technique for the rapid computation of the derivatives is described. An algorithm for determining resolution in the profile is discussed.

Shellman, C. H.↗

Efficient control with an order (n) recursive inversion of the Jacobian for an n-link serial manipulator

A method is presented to order (n) recursively invert the Jacobian matrix for a serial n-link manipulator. By realizing that the Jacobian relationship involving accelerations is a special case for the forward dynamics problem, it is possible to obtain the Jacobian inverse by directly applying Rodriguez's (1987) recursive forward dynamics algorithm. In this technique, the n-link robot equation is formulated as a spatially recursive algorithm in the form of a filtering and smoothing problem. To compute the Jacobian inverse via this algorithm, the n-link manipulator is modeled with only a unit end-point mass and zero applied torques.

Meldrum, D. R.↗

Stability of matrix equations arising in electromagnetics

Many problems in electromagnetics can be formulated as a Fredholm equation of the first kind. In these problems it is desired to determine some function f(x) from its integral transform g(y). Except for special cases for which an explicit inverse operator is known, the equation is usually discretized by the method of moments into a matrix equation Af = g, which is then solved on a computer. A method of calculating the sensitivity of the solution of Af = g due to errors in either the vector g or the matrix A is developed. The usefulness of this method is demonstrated with problems from antenna theory, scattering theory, and remote sensing.

Klein, C.↗

Model-based VQ for image data archival, retrieval and distribution

An ideal image compression technique for image data archival, retrieval and distribution would be one with the asymmetrical computational requirements of Vector Quantization (VQ), but without the complications arising from VQ codebooks. Codebook generation and maintenance are stumbling blocks which have limited the use of VQ as a practical image compression algorithm. Model-based VQ (MVQ), a variant of VQ described here, has the computational properties of VQ but does not require explicit codebooks. The codebooks are internally generated using mean removed error and Human Visual System (HVS) models. The error model assumed is the Laplacian distribution with mean, lambda-computed from a sample of the input image. A Laplacian distribution with mean, lambda, is generated with uniform random number generator. These random numbers are grouped into vectors. These vectors are further conditioned to make them perceptually meaningful by filtering the DCT coefficients from each vector. The DCT coefficients are filtered by multiplying by a weight matrix that is found to be optimal for human perception. The inverse DCT is performed to produce the conditioned vectors for the codebook. The only image dependent parameter used in the generation of codebook is the mean, lambda, that is included in the coded file to repeat the codebook generation process for decoding.

Manohar, Mareboyana↗

Recursive partitioned inversion of large (1500 x 1500) symmetric matrices

A recursive algorithm was designed to invert large, dense, symmetric, positive definite matrices using small amounts of computer core, i.e., a small fraction of the core needed to store the complete matrix. The described algorithm is a generalized Gaussian elimination technique. Other algorithms are also discussed for the Cholesky decomposition and step inversion techniques. The purpose of the inversion algorithm is to solve large linear systems of normal equations generated by working geodetic problems. The algorithm was incorporated into a computer program called SOLVE. In the past the SOLVE program has been used in obtaining solutions published as the Goddard earth models.

Putney, B. H.↗

Fiber Sorbents – A Versatile Platform for Sorption-Based Gas Separations

Increasing demand for high-purity fine chemicals and a drive for process intensification of large-scale separations have driven significant work on the development of highly engineered porous materials with promise for sorption-based separations. While sorptive separations in porous materials offer energy-efficient alternatives to longstanding thermal-based methods, the particulate nature of many of these sorbents has sometimes limited their large-scale deployment in high-throughput applications such as gas separations, for which the necessary high feed flow rates and gas velocities accrue prohibitive operational costs. These processability limitations have been historically addressed through powder shaping methods aimed at the fabrication of structured sorbent contactors based on pellets, beads or monoliths, commonly obtained as extrudates. These structures overcome limitations such as elevated pressure drops commonly recorded across powder adsorption beds but often accrue thermal limitations arising from elevated particle density and aggregation, which ultimately cap their maximum separation performance. Furthermore, the harsh mechanical strain to which powder particles are subjected during contactor fabrication, in the form of extrusion/compression forces, can result in partial pore occlusion and framework degradation, further limiting their performance. Here, we present the development of porous fiber sorbents as an alternative sorbent contactor design capable of addressing sorbent processability limitations while enabling an array of performance-maximizing heat integration capabilities. This new sorbent form factor leverages pre-existing know-how from hollow fiber spinning to produce fiber-shaped sorbent contactors through the phase inversion of known polymers in a process known as dry-jet/wet quenching. The process of phase inversion allows microporous sorbent particles to be latched onto a macroporous polymer matrix under mild processing conditions, thus making it compatible with soft porous materials prone to amorphization under traditional pelletization conditions. Sorbent fibers can be created with different geometries through control of the spinning apparatus and process, offering the possibility to produce monolithic and hollow fibers alike, the latter of which can be integrated with thermalization fluid flows. In this Account, we summarize our progress in the field of fiber sorbents from both design and application standpoints. We further guide the reader through the evolution of this field from the early inceptive work on zeolite hollow fibers to recent developments on MOF fibers. We highlight the versatile nature of fiber sorbents, both from the composition, fabrication and structure points of view, and further demonstrate how fiber sorbents offer alternative paths in tackling new and challenging chemical separation challenges like direct air capture (DAC), with a final perspective on the future of the field.

36 MATERIALS SCIENCE↗

Reconfigurable Control with Neural Network Augmentation for a Modified F-15 Aircraft

This paper describes the performance of a simplified dynamic inversion controller with neural network supplementation. This 6 DOF (Degree-of-Freedom) simulation study focuses on the results with and without adaptation of neural networks using a simulation of the NASA modified F-15 which has canards. One area of interest is the performance of a simulated surface failure while attempting to minimize the inertial cross coupling effect of a [B] matrix failure (a control derivative anomaly associated with a jammed or missing control surface). Another area of interest and presented is simulated aerodynamic failures ([A] matrix) such as a canard failure. The controller uses explicit models to produce desired angular rate commands. The dynamic inversion calculates the necessary surface commands to achieve the desired rates. The simplified dynamic inversion uses approximate short period and roll axis dynamics. Initial results indicated that the transient response for a [B] matrix failure using a Neural Network (NN) improved the control behavior when compared to not using a neural network for a given failure, However, further evaluation of the controller was comparable, with objections io the cross coupling effects (after changes were made to the controller). This paper describes the methods employed to reduce the cross coupling effect and maintain adequate tracking errors. The IA] matrix failure results show that control of the aircraft without adaptation is more difficult [leas damped) than with active neural networks, Simulation results show Neural Network augmentation of the controller improves performance in terms of backing error and cross coupling reduction and improved performance with aerodynamic-type failures.

Burken, John J.↗

Inverse Method for Estimation of Composite Kink-Band Toughness from Open-Hole Compression Strength Data

Fiber-reinforced polymer matrix composite materials can fail by kink-band propagation mechanism when subjected to in-plane compressive loading. This mode of failure is especially prevalent in compressive loading of laminates with holes, cut-outs, or impact damage. Most of the successful models for predicting compressive strength of such laminates require “fracture” toughness associated with kink-band propagation under in-plane compression. However, this property is difficult to measure experimentally, limiting the use of such models in design practice. In this paper an inverse method is proposed to estimate the kink-band toughness of the laminate from its open-hole compression strength data, which is an easier property to measure experimentally. Furthermore, a scaling relationship is proposed to estimate kink-band toughness for other laminate configurations of the same material.

Luke Borkowski↗

Bayesian Approach to the Joint Inversion of Gravity and Magnetic Data, with Application to the Ismenius Area of Mars

This viewgraph presentation reviews a Bayesian approach to the inversion of gravity and magnetic data with specific application to the Ismenius Area of Mars. Many inverse problems encountered in geophysics and planetary science are well known to be non-unique (i.e. inversion of gravity the density structure of a body). In hopes of reducing the non-uniqueness of solutions, there has been interest in the joint analysis of data. An example is the joint inversion of gravity and magnetic data, with the assumption that the same physical anomalies generate both the observed magnetic and gravitational anomalies. In this talk, we formulate the joint analysis of different types of data in a Bayesian framework and apply the formalism to the inference of the density and remanent magnetization structure for a local region in the Ismenius area of Mars. The Bayesian approach allows prior information or constraints in the solutions to be incorporated in the inversion, with the "best" solutions those whose forward predictions most closely match the data while remaining consistent with assumed constraints. The application of this framework to the inversion of gravity and magnetic data on Mars reveals two typical challenges - the forward predictions of the data have a linear dependence on some of the quantities of interest, and non-linear dependence on others (termed the "linear" and "non-linear" variables, respectively). For observations with Gaussian noise, a Bayesian approach to inversion for "linear" variables reduces to a linear filtering problem, with an explicitly computable "error" matrix. However, for models whose forward predictions have non-linear dependencies, inference is no longer given by such a simple linear problem, and moreover, the uncertainty in the solution is no longer completely specified by a computable "error matrix". It is therefore important to develop methods for sampling from the full Bayesian posterior to provide a complete and statistically consistent picture of model uncertainty, and what has been learned from observations. We will discuss advanced numerical techniques, including Monte Carlo Markov

data analysis↗

Standard ozone profiles from balloon and satellite data sets

Standard profiles based on upper level averaged profiles from BUV and lower level averaged profiles from balloon measurements are presented in a parametric representation as a function of time of year and latitude. The representation is a simple 4-parameter function representing the ozone amount (m-atm-cm) in each of 12 atmospheric layers defined following the standard Umkehr convention. The same parameterization is applied to the Nimbus-7 SBUV data and is compared to the BUV/balloon parameterization. The ozone variance unaccounted for by the representation is presented and discussed. The season-latitude representation reduces considerably the ozone variance at all levels and explains much of the correlation between layers. This simple representation and corresponding covariance matrix have been used as a priori information in the ozone vertical profile inversion of the Nimbus-7 SBUV experimental measurements.

Klenk, K. F.↗

Parallel conjugate gradient algorithms for manipulator dynamic simulation

Parallel conjugate gradient algorithms for the computation of multibody dynamics are developed for the specialized case of a robot manipulator. For an n-dimensional positive-definite linear system, the Classical Conjugate Gradient (CCG) algorithms are guaranteed to converge in n iterations, each with a computation cost of O(n); this leads to a total computational cost of O(n sq) on a serial processor. A conjugate gradient algorithms is presented that provide greater efficiency using a preconditioner, which reduces the number of iterations required, and by exploiting parallelism, which reduces the cost of each iteration. Two Preconditioned Conjugate Gradient (PCG) algorithms are proposed which respectively use a diagonal and a tridiagonal matrix, composed of the diagonal and tridiagonal elements of the mass matrix, as preconditioners. Parallel algorithms are developed to compute the preconditioners and their inversions in O(log sub 2 n) steps using n processors. A parallel algorithm is also presented which, on the same architecture, achieves the computational time of O(log sub 2 n) for each iteration. Simulation results for a seven degree-of-freedom manipulator are presented. Variants of the proposed algorithms are also developed which can be efficiently implemented on the Robot Mathematics Processor (RMP).

Fijany, Amir↗

Solving sparse triangular linear systems on parallel computers

This paper describes and compares three parallel algorithms for solving sparse triangular systems of equations. These methods involve some preprocessing overhead and are primarily of interest in solving many systems with the same coefficient matrix. The first approach is to use a fixed blocksize and form the inverse of the diagonal blocks. The second approach is to use a variable blocksize and reorder the unknowns so that the diagonal blocks are diagonal matrices. The latter technique is called level scheduling because of how it is represented in the adjacency graph, and both row-wise and jagged diagonal storage for the off-diagonal blocks are considered. These techniques are analyzed for general parallel computers and experiments are presented for the eight-processor Alliant FX/8.

Anderson, Edward↗

Computation of steady and unsteady quasi-one-dimensional viscous/inviscid interacting internal flows at subsonic, transonic, and supersonic Mach numbers

Computations of viscous-inviscid interacting internal flowfields are presented for steady and unsteady quasi-one-dimensional (Q1D) test cases. The unsteady Q1D Euler equations are coupled with integral boundary-layer equations for unsteady, two-dimensional (planar or axisymmetric), turbulent flow over impermeable, adiabatic walls. The coupling methodology differs from that used in most techniques reported previously in that the above mentioned equation sets are written as a complete system and solved simultaneously; that is, the coupling is carried out directly through the equations as opposed to coupling the solutions of the different equation sets. Solutions to the coupled system of equations are obtained using both explicit and implicit numerical schemes for steady subsonic, steady transonic, and both steady and unsteady supersonic internal flowfields. Computed solutions are compared with measurements as well as Navier-Stokes and inverse boundary-layer methods. An analysis of the eigenvalues of the coefficient matrix associated with the quasi-linear form of the coupled system of equations indicates the presence of complex eigenvalues for certain flow conditions. It is concluded that although reasonable solutions can be obtained numerically, these complex eigenvalues contribute to the overall difficulty in obtaining numerical solutions to the coupled system of equations.

Swafford, Timothy W.↗

Accuracy and resolution of Earth Radiation Budget Estimates

A numerical filter inversion technique that reduces wide-angle satellite measurements to top-of-the-atmosphere radiant exitances has been proposed for the Earth Radiation Budget Experiment (ERBE). The matrix formulation of this technique is presented, and the design of the numerical filter is discussed. The filter is smoothed with a singular value decomposition. The inversion process is simulated by generating synthetic measurements from a 24 degree spherical harmonic radiation field derived from Nimbus 6 ERB data. The numerical filter is applied to these measurements after they are corrupted with instrument error. The results are curves of expected error versus resolution area.

Green, R. N.↗

Frequencies and modes for shells of revolution (FAMSOR)

Using stiffness matrix and lumped-mass representation specified number of natural frequencies are obtained using inverse iteration method. Mode shapes for each frequency are also obtained. These frequencies and mode shapes can be found in reasonable periods of computer time utilizing this code.

Mcwhorter, L. B.↗

An efficient numerical technique for calculating thermal spreading resistance

An efficient numerical technique for solving the equations resulting from finite difference analyses of fields governed by Poisson's equation is presented. The method is direct (noniterative)and the computer work required varies with the square of the order of the coefficient matrix. The computational work required varies with the cube of this order for standard inversion techniques, e.g., Gaussian elimination, Jordan, Doolittle, etc.

Gale, E. H., Jr.↗

Acoustic loading in planar networks

The acoustic loading in a complex planar network of ducts is determined by a method in which Green function surface elements are used. The network consists of straight ducts, elbows and branched ducts. A transfer matrix technique is developed in which each duct is treated separately and the matrix of the influence coefficients is transformed to tri-diagonal form allowing efficient inversion.

El-Raheb, M.↗