Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized eigenvalues”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Optimal control of large space structures via generalized inverse matrix

Independent Modal Space Control (IMSC) is a control scheme that decouples the space structure into n independent second-order subsystems according to n controlled modes and controls each mode independently. It is well-known that the IMSC eliminates control and observation spillover caused when the conventional coupled modal control scheme is employed. The independent control of each mode requires that the number of actuators be equal to the number of modelled modes, which is very high for a faithful modeling of large space structures. A control scheme is proposed that allows one to use a reduced number of actuators to control all modeled modes suboptimally. In particular, the method of generalized inverse matrices is employed to implement the actuators such that the eigenvalues of the closed-loop system are as closed as possible to those specified by the optimal IMSC. Computer simulation of the proposed control scheme on a simply supported beam is given.

Nguyen, Charles C.↗
NASA NTRS1989

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

A numerical method for systems of conservation laws of mixed type admitting hyperbolic flux splitting

The present treatment of elliptic regions via hyperbolic flux-splitting and high order methods proposes a flux splitting in which the corresponding Jacobians have real and positive/negative eigenvalues. While resembling the flux splitting used in hyperbolic systems, the present generalization of such splitting to elliptic regions allows the handling of mixed-type systems in a unified and heuristically stable fashion. The van der Waals fluid-dynamics equation is used. Convergence with good resolution to weak solutions for various Riemann problems are observed.

Shu, Chi-Wang↗
NASA NTRS1983

Population Control of Self-Replicating Systems: Option C

From the conception and development of the theory of self-replicating automata by John von Neumann, others have expanded on his theories. In 1980, Georg von Tiesenhausen and Wesley A. Darbro developed a report which is a "first' in presenting the theories in a conceptualized engineering setting. In that report several options involving self-replicating systems are presented. One of the options allows each primary to generate n replicas, one in each sequential time frame after its own generation. Each replica is limited to a maximum of m ancestors. This study involves determining the state vector of the replicas in an efficient manner. The problem is cast in matrix notation, where F = fij is a non-diagonalizable matrix. Any element fij represents the number of elements of type j = (c,d) in time frame k+1 generated from type i = (a,b) in time frame k. It is then shown that the state vector is: bar F(k)=bar F (non-zero) X F sub K = bar F (non-zero) xmx J sub kx m sub-1 where J is a matrix in Jordan form having the same eigenvalues as F. M is a matrix composed of the eigenvectors and the generalized eigenvectors of F.

Mccord, R. L.↗
NASA NTRS1993

Implicit treatment of diffusion terms in lower-upper algorithms

A method is presented which allows diffusion terms to be treated implicitly in the lower-upper (LU) algorithm (which is a commonly used method for solving 'compressible' Euler and Navier-Stokes equations) so that the algorithm's good stability properties will not be impaired. The new method generalizes the concept of LU factorization from that associated with the sign of eigenvalues to that associated with backward- and forward-difference operators without regard to eigenvalues. The method is verified in a turbulent boundary layer study.

Shih, T. I.-P.↗
DOE OSTI2025

Status of GPU capabilities within the Shift Monte Carlo radiation transport code

Shift is a general-purpose Monte Carlo (MC) radiation transport code for fission, fusion, and national security applications. Shift has been adapted to efficiently run on GPUs in order to leverage leadership-class supercomputers. This work presents Shift’s current GPU capabilities. These include core radiation transport capabilities for eigenvalue and fixed-source simulations, and support for non-uniform domain decomposition, Doppler broadening, free-gas elastic scattering, general-purpose geometry, hybrid MC/deterministic transport, and depletion. Transport results demonstrate a 2–5× GPU-to-CPU speedup on a per-node basis for an eigenvalue problem on the Frontier supercomputer and a 28× speedup for a fixed-source problem on the Summit supercomputer.

Biondo, Elliott [ORNL] (ORCID:0000000290881360)↗
NASA NTRS1994

Rapid solution of large-scale systems of equations

The analysis and design of complex aerospace structures requires the rapid solution of large systems of linear and nonlinear equations, eigenvalue extraction for buckling, vibration and flutter modes, structural optimization and design sensitivity calculation. Computers with multiple processors and vector capabilities can offer substantial computational advantages over traditional scalar computer for these analyses. These computers fall into two categories: shared memory computers and distributed memory computers. This presentation covers general-purpose, highly efficient algorithms for generation/assembly or element matrices, solution of systems of linear and nonlinear equations, eigenvalue and design sensitivity analysis and optimization. All algorithms are coded in FORTRAN for shared memory computers and many are adapted to distributed memory computers. The capability and numerical performance of these algorithms will be addressed.

Storaasli, Olaf O.↗
NASA NTRS1991

A look-ahead variant of the Lanczos algorithm and its application to the quasi-minimal residual method for non-Hermitian linear systems

The Lanczos algorithm can be used both for eigenvalue problems and to solve linear systems. However, when applied to non-Hermitian matrices, the classical Lanczos algorithm is susceptible to breakdowns and potential instabilities. In addition, the biconjugate gradient (BCG) algorithm, which is the natural generalization of the conjugate gradient algorithm to non-Hermitian linear systems, has a second source of breakdowns, independent of the Lanczos breakdowns. Here, we present two new results. We propose an implementation of a look-ahead variant of the Lanczos algorithm which overcomes the breakdowns by skipping over those steps where a breakdown or a near-breakdown would occur. The new algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products per step as the classical Lanczos algorithm without look-ahead. Based on the proposed look-ahead Lanczos algorithm, we then present a novel BCG-like approach, the quasi-minimal residual (QMR) method, which avoids the second source of breakdowns in the BCG algorithm. We present details of the new method and discuss some of its properties. In particular, we discuss the relationship between QMR and BCG, showing how one can recover the BCG iterates, when they exist, from the QMR iterates. We also present convergence results for QMR, showing the connection between QMR and the generalized minimal residual (GMRES) algorithm, the optimal method in this class of methods. Finally, we give some numerical examples, both for eigenvalue computations and for non-Hermitian linear systems.

Nachtigal, Noel M.↗
NASA NTRS1989

The inviscid axisymmetric stability of the supersonic flow along a circular cylinder

The supersonic flow past a thin straight circular cylinder is investigated. The associated boundary layer flow (i.e., the velocity and temperature field) is computed; the asymptotic, far downstream solution is obtained, and compared with the full numerical results. The inviscid, linear, axisymmetric (temporal) stability of this boundary layer is also studied. A so called doubly generalized inflexion condition is derived, which is a condition for the existence of so called subsonic neutral modes. The eigenvalue problem (for the complex wavespeed) is computed for two freestream Mach numbers (2.8 and 3.8), and this reveals that curvature has a profound effect on the stability of the flow. The first unstable inviscid mode is seen to rapidly disappear as curvature is introduced, while the second (and generally the most important) mode suffers a substantially reduced amplification rate.

Duck, Peter W.↗
NASA NTRS1973

An automated procedure for computing flutter eigenvalues.

A new, fast and economical automated procedure for implementing the traditional V-g method of flutter solution is described. The procedure requires as input the generalized aerodynamic forces for a range of reduced frequencies obtained from an aerodynamic program. These aerodynamic forces are interpolated with respect to reduced frequency using a newly developed, partially tabulated cubic spline that is both fast in execution and economical in storage. The flutter solution is then obtained using an eigenvalue routine that has been developed to take advantage of the parametric nature of the V-g type of solution. Furthermore, the routine takes care of the fundamental and troublesome problem of properly sorting the output eigenvalues. By solving the root-sorting problem, the interpolation for flutter crossings and automatic plotting are accomplished efficiently. The computational techniques used in this new program are described and some sample results are given.

Desmarais, R. N.↗
NASA NTRS1987

On the acceleration of charged particles at relativistic shock fronts

The diffusive acceleration of highly relativistic particles at a shock is reconsidered. Using the same physical assumptions as Blandford and Ostriker (1978), but dropping the restriction to nonrelativistic shock velocities, the authors find approximate solutions of the particle kinetic equation by generalizing the diffusion approximation to higher order terms in the anisotropy of the particle distribution. The general solution of the transport equation on either side of the shock is constructed, which involves the solution of an eigenvalue problem. By matching the two solutions at the shock, the spectral index of the resulting power law is found by taking into account a sufficiently large number of eigenfunctions. Low-order truncation corresponds to the standard diffusion approximation and to a somewhat more general method described by Peacock (1981). In addition to the energy spectrum, the method yields the angular distribution of the particles and its spatial dependence.

Kirk, J. G.↗
NASA NTRS1985

Convergence acceleration of iterative solutions of Euler equations for transonic flow computations

In this paper, two acceleration techniques for Euler calculations are investigated. The first technique is an extrapolation procedure based on the Power Method; it is applicable when the iterative matrix has dominant eigenvalues. Both real and complex conjugate roots are allowed. The second technique is a generalization of the Minimal Residual Method, where the extrapolation step consists of a weighted combination of the corrections at different iteration levels and the weights are chosen to minimize the Lz norm of the residual. Numerical results, using Jameson's Runge-Kutta Multigrid Code, are presented. The extra computational work to apply either technique is negligible and the extra storage is not a problem on current supercomputers.

Hafez, M.↗
NASA NTRS1987

Computational procedures for evaluating the sensitivity derivatives of vibration frequencies and Eigenmodes of framed structures

Computational procedures are presented for evaluating the sensitivity derivatives of the vibration frequencies and eigenmodes of framed structures. Both a displacement and a mixed formulation are used. The two key elements of the computational procedure are: (a) Use of dynamic reduction techniques to substantially reduce the number of degrees of freedom; and (b) Application of iterative techniques to improve the accuracy of the derivatives of the eigenmodes. The two reduction techniques considered are the static condensation and a generalized dynamic reduction technique. Error norms are introduced to assess the accuracy of the eigenvalue and eigenvector derivatives obtained by the reduction techniques. The effectiveness of the methods presented is demonstrated by three numerical examples.

Fetterman, Timothy L.↗
NASA NTRS1990

The inviscid axisymmetric stability of the supersonic flow along a circular cylinder

The supersonic flow past a thin straight circular cylinder is investigated. The associated boundary-layer flow (i.e. the velocity and temperature field) is computed; the asymptotic, far downstream solution is obtained, and compared with the full numerical results. The inviscid, linear, axisymmetric (temporal) stability of this boundary layer is also studied. A so-called 'doubly generalized' inflexion condition is derived, which is a condition for the existence of so-called 'subsonic' neutral modes. The eigenvalue problem (for the complex wavespeed) is computed for two free-stream Mach numbers (2.8 and 3.8), and this reveals that curvature has a profound effect on the stability of the flow. The first unstable inviscid mode is seen to disappear rapidly as curvature is introduced, while the second (and generally the most important) mode suffers a substantially reduced amplification rate.

Duck, Peter W.↗
DOE OSTI2024

Geometric Interpretation of a Non-Linear Extension of Quantum Mechanics

We recently introduced a particular non-linear generalization of quantum mechanics that has the property that it is exactly solvable in terms of the eigenvalues and eigenfunctions of the Hamiltonian of the usual linear quantum mechanics problem. In this paper, we suggest that the two components of the wave function represent the system described by the Hamiltonian H in two different asymptotic regions of spacetime and we show that the non-linear terms can be viewed as giving rise to gravitational effects.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1982

Constrained multibody system dynamics: An automated approach

The governing equations for constrained multibody systems are formulated in a manner suitable for their automated, numerical development and solution. The closed loop problem of multibody chain systems is addressed. The governing equations are developed by modifying dynamical equations obtained from Lagrange's form of d'Alembert's principle. The modifications is based upon a solution of the constraint equations obtained through a zero eigenvalues theorem, is a contraction of the dynamical equations. For a system with n-generalized coordinates and m-constraint equations, the coefficients in the constraint equations may be viewed as constraint vectors in n-dimensional space. In this setting the system itself is free to move in the n-m directions which are orthogonal to the constraint vectors.

Kamman, J. W.↗
NASA NTRS1984

Optical systolic solutions of linear algebraic equations

The philosophy and data encoding possible in systolic array optical processor (SAOP) were reviewed. The multitude of linear algebraic operations achievable on this architecture is examined. These operations include such linear algebraic algorithms as: matrix-decomposition, direct and indirect solutions, implicit and explicit methods for partial differential equations, eigenvalue and eigenvector calculations, and singular value decomposition. This architecture can be utilized to realize general techniques for solving matrix linear and nonlinear algebraic equations, least mean square error solutions, FIR filters, and nested-loop algorithms for control engineering applications. The data flow and pipelining of operations, design of parallel algorithms and flexible architectures, application of these architectures to computationally intensive physical problems, error source modeling of optical processors, and matching of the computational needs of practical engineering problems to the capabilities of optical processors are emphasized.

Neuman, C. P.↗