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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1972

On the equinoctial orbit elements.

This paper investigates the equinoctial orbit elements for the two-body problem, showing that the associated matrices are free from singularities for zero eccentricities and zero and ninety degree inclinations. The matrix of the partial derivatives of the position and velocity vectors with respect to the orbit elements is given explicitly, together with the matrix of inverse partial derivatives, in order to facilitate construction of the matrizant (state transition matrix) corresponding to these elements. The Lagrange and Poisson bracket matrices are also given. The application of the equinoctial orbit elements to general and special perturbations is discussed.

Broucke, R. A.↗
NASA NTRS2011

Multi-Maneuver Clohessy-Wiltshire Targeting

Orbital rendezvous involves execution of a sequence of maneuvers by a chaser vehicle to bring the chaser to a desired state relative to a target vehicle while meeting intermediate and final relative constraints. Intermediate and final relative constraints are necessary to meet a multitude of requirements such as to control approach direction, ensure relative position is adequate for operation of space-to-space communication systems and relative sensors, provide fail-safe trajectory features, and provide contingency hold points. The effect of maneuvers on constraints is often coupled, so the maneuvers must be solved for as a set. For example, maneuvers that affect orbital energy change both the chaser's height and downrange position relative to the target vehicle. Rendezvous designers use experience and rules-of-thumb to design a sequence of maneuvers and constraints. A non-iterative method is presented for targeting a rendezvous scenario that includes a sequence of maneuvers and relative constraints. This method is referred to as Multi-Maneuver Clohessy-Wiltshire Targeting (MM_CW_TGT). When a single maneuver is targeted to a single relative position, the classic CW targeting solution is obtained. The MM_CW_TGT method involves manipulation of the CW state transition matrix to form a linear system. As a starting point for forming the algorithm, the effects of a series of impulsive maneuvers on the state are derived. Simple and moderately complex examples are used to demonstrate the pattern of the resulting linear system. The general form of the pattern results in an algorithm for formation of the linear system. The resulting linear system relates the effect of maneuver components and initial conditions on relative constraints specified by the rendezvous designer. Solution of the linear system includes the straight-forward inverse of a square matrix. Inversion of the square matrix is assured if the designer poses a controllable scenario - a scenario where the the constraints can be met by the sequence of maneuvers. Matrices in the linear system are dependent on selection of maneuvers and constraints by the designer, but the matrices are independent of the chaser's initial conditions. For scenarios where the sequence of maneuvers and constraints are fixed, the linear system can be formed and the square matrix inverted prior to real-time operations. Example solutions are presented for several rendezvous scenarios to illustrate the utility of the method. The MM_CW_TGT method has been used during the preliminary design of rendezvous scenarios and is expected to be useful for iterative methods in the generation of an initial guess and corrections.

Dannemiller, David P.↗
NASA NTRS2017

Relaxation Matrix for Symmetric Tops with Inversion Symmetry: Line Coupling and Line Mixing Effects on NH3 Lines in the V4 Band

Line shape parameters including the half-widths and the off-diagonal elements of the relaxation matrix have been calculated for self-broadened NH3 lines in the perpendicular v4 band. As in the pure rotational and the parallel v1 bands, the small inversion splitting in this band causes a complete failure of the isolated line approximation. As a result, one has to use formalisms not relying on this approximation. However, due to differences between parallel and perpendicular bands of NH3, the applicability of the formalism used in our previous studies of the v1 band and other parallel bands must be carefully verified. We have found that, as long as potential models only contain components with K1 equals K2 equals 0, whose matrix elements require the selection rule delta k equals 0, the formalism is applicable for the v4 band with some minor adjustments. Based on both theoretical considerations and results from numerical calculations, the non-diagonality of the relaxation matrices in all the PP, RP, PQ, RQ, PR, and RR branches is discussed. Theoretically calculated self-broadened half-widths are compared with measurements and the values listed in HITRAN 2012. With respect to line coupling effects, we have compared our calculated intra-doublet off-diagonal elements of the relaxation matrix with reliable measurements carried out in the PP branch where the spectral environment is favorable. The agreement is rather good since our results do well reproduce the observed k and j dependences of these elements, thus validating our formalism.

Absorption coefficient↗
NASA NTRS2016

The Relaxation Matrix for Symmetric Tops with Inversion Symmetry: Line Mixing Effects in the V1 Band of NH3 - II

Line mixing effects have been calculated in the ν1 parallel band of self-broadened NH3. The theoretical approach is an extension of a semi-classical model to symmetric-top molecules with inversion symmetry developed in the companion paper [Q. Ma and C. Boulet, J. Chem. Phys. 144, 224303 (2016)]. This model takes into account line coupling effects and hence enables the calculation of the entire relaxation matrix. A detailed analysis of the various coupling mechanisms is carried out for Q and R inversion doublets. The model has been applied to the calculation of the shape of the Q branch and of some R manifolds for which an obvious signature of line mixing effects has been experimentally demonstrated. Comparisons with measurements show that the present formalism leads to an accurate prediction of the available experimental line shapes. Discrepancies between the experimental and theoretical sets of first order mixing parameters are discussed as well as some extensions of both theory and experiment.

Boulet, C.↗
NASA NTRS1986

A fully redundant double difference algorithm for obtaining minimum variance estimates from GPS observations

In double differencing a regression system obtained from concurrent Global Positioning System (GPS) observation sequences, one either undersamples the system to avoid introducing colored measurement statistics, or one fully samples the system incurring the resulting non-diagonal covariance matrix for the differenced measurement errors. A suboptimal estimation result will be obtained in the undersampling case and will also be obtained in the fully sampled case unless the color noise statistics are taken into account. The latter approach requires a least squares weighting matrix derived from inversion of a non-diagonal covariance matrix for the differenced measurement errors instead of inversion of the customary diagonal one associated with white noise processes. Presented is the so-called fully redundant double differencing algorithm for generating a weighted double differenced regression system that yields equivalent estimation results, but features for certain cases a diagonal weighting matrix even though the differenced measurement error statistics are highly colored.

Melbourne, William G.↗
NASA NTRS2016

The Relaxation Matrix for Symmetric Tops with Inversion Symmetry. I. Effects of Line Coupling on Self-Broadened v (sub 1) and Pure Rotational Bands of NH3

The Robert-Bonamy formalism has been commonly used to calculate half-widths and shifts of spectral lines for decades. This formalism is based on several approximations. Among them, two have not been fully addressed: the isolated line approximation and the neglect of coupling between the translational and internal motions. Recently, we have shown that the isolated line approximation is not necessary in developing semi-classical line shape theories. Based on this progress, we have been able to develop a new formalism that enables not only to reduce uncertainties on calculated half-widths and shifts, but also to model line mixing effects on spectra starting from the knowledge of the intermolecular potential. In our previous studies, the new formalism had been applied to linear and asymmetric-top molecules. In the present study, the method has been extended to symmetric-top molecules with inversion symmetry. As expected, the inversion splitting induces a complete failure of the isolated line approximation. We have calculated the complex relaxation matrices of selfbroadened NH3. The half-widths and shifts in the ν1 and the pure rotational bands are reported in the present paper. When compared with measurements, the calculated half-widths match the experimental data very well, since the inapplicable isolated line approximation has been removed. With respect to the shifts, only qualitative results are obtained and discussed. Calculated off-diagonal elements of the relaxation matrix and a comparison with the observed line mixing effects are reported in the companion paper (Paper II).

Trajectory models↗
NASA NTRS1985

Adaptive Inverse Control for Rotorcraft Vibration Reduction

This thesis extends the Least Mean Square (LMS) algorithm to solve the mult!ple-input, multiple-output problem of alleviating N/Rev (revolutions per minute by number of blades) helicopter fuselage vibration by means of adaptive inverse control. A frequency domain locally linear model is used to represent the transfer matrix relating the higher harmonic pitch control inputs to the harmonic vibration outputs to be controlled. By using the inverse matrix as the controller gain matrix, an adaptive inverse regulator is formed to alleviate the N/Rev vibration. The stability and rate of convergence properties of the extended LMS algorithm are discussed. It is shown that the stability ranges for the elements of the stability gain matrix are directly related to the eigenvalues of the vibration signal information matrix for the learning phase, but not for the control phase. The overall conclusion is that the LMS adaptive inverse control method can form a robust vibration control system, but will require some tuning of the input sensor gains, the stability gain matrix, and the amount of control relaxation to be used. The learning curve of the controller during the learning phase is shown to be quantitatively close to that predicted by averaging the learning curves of the normal modes. For higher order transfer matrices, a rough estimate of the inverse is needed to start the algorithm efficiently. The simulation results indicate that the factor which most influences LMS adaptive inverse control is the product of the control relaxation and the the stability gain matrix. A small stability gain matrix makes the controller less sensitive to relaxation selection, and permits faster and more stable vibration reduction, than by choosing the stability gain matrix large and the control relaxation term small. It is shown that the best selections of the stability gain matrix elements and the amount of control relaxation is basically a compromise between slow, stable convergence and fast convergence with increased possibility of unstable identification. In the simulation studies, the LMS adaptive inverse control algorithm is shown to be capable of adapting the inverse (controller) matrix to track changes in the flight conditions. The algorithm converges quickly for moderate disturbances, while taking longer for larger disturbances. Perfect knowledge of the inverse matrix is not required for good control of the N/Rev vibration. However it is shown that measurement noise will prevent the LMS adaptive inverse control technique from controlling the vibration, unless the signal averaging method presented is incorporated into the algorithm.

Jacklin, Stephen A.↗
NASA NTRS2011

Graph Theory Roots of Spatial Operators for Kinematics and Dynamics

Spatial operators have been used to analyze the dynamics of robotic multibody systems and to develop novel computational dynamics algorithms. Mass matrix factorization, inversion, diagonalization, and linearization are among several new insights obtained using such operators. While initially developed for serial rigid body manipulators, the spatial operators and the related mathematical analysis have been shown to extend very broadly including to tree and closed topology systems, to systems with flexible joints, links, etc. This work uses concepts from graph theory to explore the mathematical foundations of spatial operators. The goal is to study and characterize the properties of the spatial operators at an abstract level so that they can be applied to a broader range of dynamics problems. The rich mathematical properties of the kinematics and dynamics of robotic multibody systems has been an area of strong research interest for several decades. These properties are important to understand the inherent physical behavior of systems, for stability and control analysis, for the development of computational algorithms, and for model development of faithful models. Recurring patterns in spatial operators leads one to ask the more abstract question about the properties and characteristics of spatial operators that make them so broadly applicable. The idea is to step back from the specific application systems, and understand more deeply the generic requirements and properties of spatial operators, so that the insights and techniques are readily available across different kinematics and dynamics problems. In this work, techniques from graph theory were used to explore the abstract basis for the spatial operators. The close relationship between the mathematical properties of adjacency matrices for graphs and those of spatial operators and their kernels were established. The connections hold across very basic requirements on the system topology, the nature of the component bodies, the indexing schemes, etc. The relationship of the underlying structure is intimately connected with efficient, recursive computational algorithms. The results provide the foundational groundwork for a much broader look at the key problems in kinematics and dynamics. The properties of general graphs and trees of nodes and edge were examined, as well as the properties of adjacency matrices that are used to describe graph connectivity. The nilpotency property of such matrices for directed trees was reviewed, and the adjacency matrices were generalized to the notion of block weighted adjacency matrices that support block matrix elements. This leads us to the development of the notion of Spatial Kernel Operator SKO kernels. These kernels provide the basis for the development of SKO resolvent operators.

Jain, Abhinandan↗
DOE OSTI2024

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Ramôa, Mafalda (ORCID:0000000302187801)↗
NASA NTRS1966

Computing the pseudo-inverse

Orthogonalization algorithm for producing pseudo inverse of matrix, and realization of algorithm with Fortran program

ORTHOGONAL FUNCTION↗
NASA NTRS1976

Canonical analysis for increased classification speed and channel selection

The quadratic form can be expressed as a monotonically increasing sum of squares when the inverse covariance matrix is represented in canonical form. This formulation has the advantage that, in testing a particular class hypothesis, computations can be discontinued when the partial sum exceeds the smallest value obtained for other classes already tested. A method for channel selection is presented which arranges the original input measurements in that order which minimizes the expected number of computations. The classification algorithm was tested on data from LARS Flight Line C1 and found to reduce the sum-of-products operations by a factor of 6.7 in comparison with the conventional approach. In effect, the accuracy of a twelve-channel classification was achieved using only that CPU time required for a conventional four-channel classification.

Eppler, W.↗
NASA NTRS1978

Further studies of trace elements in C3 chondrites

Five carbonaceous chondrites (Renazzo C2V, Allende C3V, Ornans C3O, Warrenton C3O, and Orgueil C1) were analyzed by radiochemical neutron activation analysis for 20 elements. Elements condensing between approximately 700 and 420 K are systematically more depleted than those condensing between 1000 and 900 K, and the depletion correlates inversely with matrix content and directly with degree of metamorphism. A model of gas-dust fractionation during condensation, by settling of dust to the median plane of the nebula, is proposed. Gas/dust ratios relative to the cosmic ratio ranged from 0.7 at 1000 K to 0.5 at 700 K for C3O chondrites that accreted first and from 1.3 to 0.6 for the last. No further gas/dust fractionation was indicated below 700 K

Takahashi, H.↗
NASA NTRS1978

On-line parameter estimation using a high sensitivity estimator

An on-line parameter identification method is presented. The method is based on a recursive formulation of the maximum likelihood method, with a significant modification on the gains of the state estimator. In the conventional maximum likelihood method, the Kalman gains are used in the state estimator. This produces unbiased, minimum variance parameter estimates in the presence of process noise and measurement noise, but it also slows the convergence rate when the identification is done on-line. Here we suggest choosing the gains to maximize a measure of the sensitivities of the state estimates to parameter variations. One such criterion is to minimize the trace of the inverse information matrix. This increases the convergence rate significantly. After one or two time constants, the gains are switched to the Kalman values to assure unbiased, minimum-variance estimates. The state estimate will initially be nonoptimal, and may not be adequate for control purposes. In this case, a parallel Kalman filter which uses the identifier's parameter estimates can be used. This method is applied here for the identification of a simple first-order system, and for the identification of short-period stability derivatives of an F-8 aircraft from simulated data.

Mishne, D.↗
NASA NTRS1981

Visual tracking in stereo

A method is described for visual object tracking by a computer vision system using TV cameras and special low-level image processing hardware. The tracker maintains an internal model of the location, orientation, and velocity of the object in three-dimensional space. This model is used to predict where features of the object will lie on the two-dimensional images produced by stereo TV cameras. The differences in the locations of features in the two-dimensional images as predicted by the internal model and as actually seen create an error signal in the two-dimensional representation. This is multiplied by a generalized inverse Jacobian matrix to deduce the error in the internal model. The procedure repeats to update the internal model of the object's location, orientation and velocity continuously.

Saund, E.↗
NASA NTRS1985

Algorithm Solves Constrained and Unconstrained Optimization Problems

Is quasi-Newton iteration utilizing Broyden/Fletcher/Goldfarb/Shanno update on inverse Hessian matrix. Capable of solving constrained optimization unconstrained optimization and constraints only problems with one to five independent variables from one to five constraint functions and one dependent function optimized.

Denson, M. A.↗