Search NASA⌕ Search

SEARCH · Search NASA

Results for “Matrix exponential”

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

Vibration suppression using a constrained rate-feedback-threshold control strategy

A finite time, minimum force rate-feedback-threshold controller is developed to bring a system with or without known external disturbances back into an 'allowable' state bound in finite time. The disturbances are assumed to be expandable in terms of Fourier series. The optimal control is defined by a two-point boundary value problem coupled to a set of definite integral constraints. Quasi-closed form solutions are derived which replace the solution of the two-point boundary value problem and definite integral constraints with the solution of algebraic equations and the calculation of matrix exponentials. Examples are provided which demonstrate the threshold control technique and compare the quasi-closed form solutions with numerical and MACSYMA generated exact solutions.

Zimmerman, D. C.↗

Numerical methods for the analysis of sampled-data systems and for the computation of system zeros

MARSYAS is a computer aided control system design package for the simulation and analysis of open loop and closed loop dynamic systems. Outlined here is the numerical and theoretical basis of the MARSYAS functions developed during the summer of 1991. In particular, the numerical computation of the matrix exponential e(exp A) = I + A + A(exp 2)/2! + A(exp 3)/3! + ... and the numerical computation of the finite system zeros of a dynamic system (continuous time or discrete time) are presented.

Hodel, A. Scottedward↗

Programs Help Create And Evaluate Markov Models

Pade Approximation With Scaling (PAWS) and Scaled Taylor Exponential Matrix (STEM) computer programs provide flexible, user-friendly, language-based interface for creation and evaluation of Markov models describing behaviors of fault-tolerant reconfigurable computer systems. Produce exact solution for probabilities of system failures and provide conservative estimates of numbers of significant digits in solutions. Also offer as part of bundled package with SURE and ASSIST, two other reliable analysis programs developed by Systems Validation Methods group at Langley Research Center.

Butler, Ricky W.↗

Exact methods for modal transient response analysis including feedback control

This paper presents a modal method for the analysis of controlled structural systems that retains the uncoupled nature of the classical transient response analysis of a structure subjected to a prescribed time-varying load. The control force is expanded as a Taylor series that remains on the right side of the equations, and it does not lead to a computational approach that requires coupling between modes on the left side. Retaining a sufficient number of terms in the series produces a solution to the modal equations that is accurate to machine precision. The approach is particularly attractive for large problems in which standard matrix exponential methods become computationally prohibitive. Numerical results are presented to show the accuracy and efficiency of the proposed approach for dynamic feedback compensation of a truss structure with local member modes in the controller bandwidth.

Anderson, Melvin S.↗

A reliable algorithm for optimal control synthesis

In recent years, powerful design tools for linear time-invariant multivariable control systems have been developed based on direct parameter optimization. In this report, an algorithm for reliable optimal control synthesis using parameter optimization is presented. Specifically, a robust numerical algorithm is developed for the evaluation of the H(sup 2)-like cost functional and its gradients with respect to the controller design parameters. The method is specifically designed to handle defective degenerate systems and is based on the well-known Pade series approximation of the matrix exponential. Numerical test problems in control synthesis for simple mechanical systems and for a flexible structure with densely packed modes illustrate positively the reliability of this method when compared to a method based on diagonalization. Several types of cost functions have been considered: a cost function for robust control consisting of a linear combination of quadratic objectives for deterministic and random disturbances, and one representing an upper bound on the quadratic objective for worst case initial conditions. Finally, a framework for multivariable control synthesis has been developed combining the concept of closed-loop transfer recovery with numerical parameter optimization. The procedure enables designers to synthesize not only observer-based controllers but also controllers of arbitrary order and structure. Numerical design solutions rely heavily on the robust algorithm due to the high order of the synthesis model and the presence of near-overlapping modes. The design approach is successfully applied to the design of a high-bandwidth control system for a rotorcraft.

Vansteenwyk, Brett↗

Human motion planning based on recursive dynamics and optimal control techniques

This paper presents an efficient optimal control and recursive dynamics-based computer animation system for simulating and controlling the motion of articulated figures. A quasi-Newton nonlinear programming technique (super-linear convergence) is implemented to solve minimum torque-based human motion-planning problems. The explicit analytical gradients needed in the dynamics are derived using a matrix exponential formulation and Lie algebra. Cubic spline functions are used to make the search space for an optimal solution finite. Based on our formulations, our method is well conditioned and robust, in addition to being computationally efficient. To better illustrate the efficiency of our method, we present results of natural looking and physically correct human motions for a variety of human motion tasks involving open and closed loop kinematic chains.

Non-NASA Center↗

Electromagnetic Scattering by Discrete Random Media Illuminated by a Gaussian Beam II: Solution of the Radiative Transfer Equation

In this paper, we present numerical methods for solving the phenomenological scalar radiative transfer equation for a discrete random medium illuminated by a Gaussian beam. These rely on the Fourier transform method for the horizontal variables and the discrete ordinate method with matrix exponential for solving the underlying one-dimensional radiative transfer equation in the wavenumber domain. The problem of a Gaussian beam at oblique and normal incidence, as well as, the searchlight problem are treated. A complete description of the methods and the numerical algorithms is provided.

Gaussian beam↗

The adiabatic semiclassical perturbation theory for vibrationally inelastic scattering. I - Collinear calculations. II - Three-dimensional treatment

A semiclassical approximation to treat vibrationally inelastic scattering is developed. The vibrational basis set used is adiabatic with respect to a reference potential which is chosen to be as close as possible to the true potential and also gives easily obtainable solutions to the vibrational wave equation. The radial wave functions are obtained using the WKB approximation, and the coupled Schroedinger equations are solved by a first-order perturbation method to yield a phase shift matrix which is exponentiated to give the full scattering matrix. Results were obtained for all the cases computed by Secrest and Johnson and by Clark and Dickinson, and the agreement is better than 10% for half of the cross-sections and rarely off by more than a factor of 2.

Cross, R. J., Jr.↗

Refinement of the Robert-Bonamy Formalism: Considering Effects from the Line Coupling

Since it was developed in 1979, the Robert-Bonamy (RB) formalism has been widely used in calculating pressure broadened half-widths and induced shifts for many molecular systems. However, this formalism contains several approximations whose applicability has not been thoroughly justified. One of them is that lines of interest are well isolated. When these authors developed the formalism, they have relied on this assumption twice. First, in calculating the spectral density F(ω), they have only considered the diagonal matrix elements of the relaxation operator. Due to this simplification, effects from the line mixing are ignored. Second, when they applied the linked cluster theorem to remove the cutoff, they have assumed the matrix elements of the operator exp(-iS(sub 1) - S(sub 2)) can be replaced by the exponential of the matrix elements of -iS(sub 1) - S(sub 2). With this replacement, effects from the line coupling are also ignored. Although both these two simplifications relied on the same approximation, their validity criteria are completely different and the latter is more stringent than the former. As a result, in many cases where the line mixing becomes negligible, significant effects from the line coupling have been completely missed. In the present study, we have developed a new method to evaluate the matrix elements of exp(-iS(sub 1) - S(sub 2)) and have refined the RB formalism such that line coupling can be taken into account. Our numerical calculations of the half-widths for Raman Q lines of the N(sub 2)-N(sub 2) pair have demonstrated that effects from the line coupling are important. In comparison with values derived from the RB formalism, new calculated values for these lines are significantly reduced. A recent study has shown that in comparison with the measurements and the most accurate close coupling calculations, the RB formalism overestimates the half-widths by a large amount. As a result, the refinement of the RB formalism goes in the right direction and these new calculated half-widths become closer to the "true" values.

spectra↗

Matrix elements in the coupled-cluster approach - With application to low-lying states in Li

A procedure is suggested for evaluating matrix elements of an operator between wavefunctions in the coupled-cluster form. The use of the exponential ansatz leads to compact exponential expressions also for matrix elements. Algorithms are developed for summing all effects of one-particle clusters and certain chains of two-particle clusters (containing the well-known random-phase approximation as a subset). The treatment of one-particle perturbations in single valence states is investigated in detail. As examples the oscillator strength for the 2s-2p transition in Li as well as the hyperfine structure for the two states are studied and compared to earlier work.

Martensson-Pendrill, Ann-Marie↗

Theoretical Studies of Spectroscopic Line Mixing in Remote Sensing Applications

The phenomenon of collisional transfer of intensity due to line mixing has an increasing importance for atmospheric monitoring. From a theoretical point of view, all relevant information about the collisional processes is contained in the relaxation matrix where the diagonal elements give half-widths and shifts, and the off-diagonal elements correspond to line interferences. For simple systems such as those consisting of diatom-atom or diatom-diatom, accurate fully quantum calculations based on interaction potentials are feasible. However, fully quantum calculations become unrealistic for more complex systems. On the other hand, the semi-classical Robert-Bonamy (RB) formalism, which has been widely used to calculate half-widths and shifts for decades, fails in calculating the off-diagonal matrix elements. As a result, in order to simulate atmospheric spectra where the effects from line mixing are important, semi-empirical fitting or scaling laws such as the ECS (Energy-Corrected Sudden) and IOS (Infinite-Order Sudden) models are commonly used. Recently, while scrutinizing the development of the RB formalism, we have found that these authors applied the isolated line approximation in their evaluating matrix elements of the Liouville scattering operator given in exponential form. Since the criterion of this assumption is so stringent, it is not valid for many systems of interest in atmospheric applications. Furthermore, it is this assumption that blocks the possibility to calculate the whole relaxation matrix at all. By eliminating this unjustified application, and accurately evaluating matrix elements of the exponential operators, we have developed a more capable formalism. With this new formalism, we are now able not only to reduce uncertainties for calculated half-widths and shifts, but also to remove a once insurmountable obstacle to calculate the whole relaxation matrix. This implies that we can address the line mixing with the semi-classical theory based on interaction potentials between molecular absorber and molecular perturber. We have applied this formalism to address the line mixing for Raman and infrared spectra of molecules such as N2, C2H2, CO2, NH3, and H2O. By carrying out rigorous calculations, our calculated relaxation matrices are in good agreement with both experimental data and results derived from the ECS model.

Formalism↗

Quantum Search in Hilbert Space

A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task. The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of N complex orthonormal vectors, each of N dimensions (where N can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step. One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.

Zak, Michail↗

Closed-form solutions for a class of optimal quadratic tracking problems

Closed-form solutions are derived for a class of tracking problems including a linear optimal regulator and a prefilter for a time-invariant plant. The solutions for the prefilter equation and state trajectory coupled by the Riccati equation are exponentially related to the stability matrix of the plant. A computational procedure is presented in recursive form when the desired output state dynamics is assumed linear and time-invariant. Several examples are given for illustration.

Turner, J. D.↗

Space Mathematics: A Resource for Secondary School Teachers

A collection of mathematical problems related to NASA space science projects is presented. In developing the examples and problems, attention was given to preserving the authenticity and significance of the original setting while keeping the level of mathematics within the secondary school curriculum. Computation and measurement, algebra, geometry, probability and statistics, exponential and logarithmic functions, trigonometry, matrix algebra, conic sections, and calculus are among the areas addressed.

Kastner, Bernice↗

Quantum theory of an optical maser. VI - Transient behavior.

The transient behavior of a laser is discussed using the quantum theory as did Scully and Lamb. The formal solution of the density-matrix equation is expressed in terms of exponentially decaying eigenmodes. Some of the lower decay constants are obtained numerically. The equations for the moments of the density matrix are then derived and solved by a truncation method. The equations of motion are integrated numerically for the case where the average number of photons in a laser cavity has the realistically large value 1.3 x 100,000. An alternative Fokker-Planck-equation approach is discussed.

Wang, Y. K.↗

Doubly differential cross sections for galactic heavy-ion fragmentation

An abrasion-ablation T-matrix formulation is applied to the calculation of double differential-cross sections in projectile fragmentation of 2.1 GeV/nucleon O-16 on Be-9 and 86 MeV/nucleon C-12 on C-12 and Ag-108. An exponential parameterization of the ablation T-matrix is used and the total width of the intermediate states is taken as a parameter. Fitted values of the total width to experimental results are used to predict the lifetime of the ablation stage and indicate a decay time on the order of 10 to the -19th power sec.

Cucinotta, Francis A.↗

Multiprocessor sparse L/U decomposition with controlled fill-in

Generation of the maximal compatibles of pivot elements for a class of small sparse matrices is studied. The algorithm involves a binary tree search and has a complexity exponential in the order of the matrix. Different strategies for selection of a set of compatible pivots based on the Markowitz criterion are investigated. The competing issues of parallelism and fill-in generation are studied and results are provided. A technque for obtaining an ordered compatible set directly from the ordered incompatible table is given. This technique generates a set of compatible pivots with the property of generating few fills. A new hueristic algorithm is then proposed that combines the idea of an ordered compatible set with a limited binary tree search to generate several sets of compatible pivots in linear time. Finally, an elimination set to reduce the matrix is selected. Parameters are suggested to obtain a balance between parallelism and fill-ins. Results of applying the proposed algorithms on several large application matrices are presented and analyzed.

Alaghband, G.↗