Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvalue method”

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 NTRS2001

Discontinuous Galerkin Methods for NonLinear Differential Systems

This talk considers simplified finite element discretization techniques for first-order systems of conservation laws equipped with a convex (entropy) extension. Using newly developed techniques in entropy symmetrization theory, simplified forms of the discontinuous Galerkin (DG) finite element method have been developed and analyzed. The use of symmetrization variables yields numerical schemes which inherit global entropy stability properties of the PDE (partial differential equation) system. Central to the development of the simplified DG methods is the Eigenvalue Scaling Theorem which characterizes right symmetrizers of an arbitrary first-order hyperbolic system in terms of scaled eigenvectors of the corresponding flux Jacobian matrices. A constructive proof is provided for the Eigenvalue Scaling Theorem with detailed consideration given to the Euler equations of gas dynamics and extended conservation law systems derivable as moments of the Boltzmann equation. Using results from kinetic Boltzmann moment closure theory, we then derive and prove energy stability for several approximate DG fluxes which have practical and theoretical merit.

Barth, Timothy↗
NASA NTRS1986

Solution of the symmetric eigenproblem AX=lambda BX by delayed division

Delayed division is an iterative method for solving the linear eigenvalue problem AX = lambda BX for a limited number of small eigenvalues and their corresponding eigenvectors. The distinctive feature of the method is the reduction of the problem to an approximate triangular form by systematically dropping quadratic terms in the eigenvalue lambda. The report describes the pivoting strategy in the reduction and the method for preserving symmetry in submatrices at each reduction step. Along with the approximate triangular reduction, the report extends some techniques used in the method of inverse subspace iteration. Examples are included for problems of varying complexity.

Thurston, G. A.↗
NASA NTRS1986

Methods for the solution of radiative transfer equation

To obtain an exact solution of the radiative-transfer equation in media where both absorption and scattering are significant, the usual approach is to use a numerical method. Three methods are known in the literature: invariant imbedding, eigenvalue-eigenfunction, and matrix doubling. This paper examines the practical application of these methods to the problem of emission from an inhomogeneous (Rayleigh) layer, the effects of layer parameters on the stability. It is found that invariant imbedding is most suitable for computing emission from an inhomogeneous layer with a temperature profile but tends to be unstable as the optical thickness of the layer increases beyond 0.5. On the other hand, the matrix-doubling method is stable for arbitrary optical thickness but is not suitable for handling multilayers. The eigenvalue-eigenfunction method is more stable than the invariant imbedding as optical thickness increases up to 2.0. It also permits temperature profile in the layer, but the computation is much more complicated. It is less stable than the matrix-doubling method when optical thickness is larger than 2.0. In general, the choice of a method is dependent on the nature of the problem.

Chen, M. F.↗
NASA NTRS1977

Numerical determination of the fundamental eigenvalue for the Laplace operator on a spherical domain

Methods for obtaining approximate solutions for the fundamental eigenvalue of the Laplace-Beltrami operator (i.e., the membrane eignevalue problem for the vibration equation) on the unit spherical surface are developed. Two types of spherical surface domains are considered: the interior of a spherical triangle, and the exterior of a great circle arc extending for less than pi radians (a spherical surface with a slit). In both cases, zero boundary conditions are imposed. In order to solve the resulting second-order elliptic partial differential equations in two independent variables, a finite difference approximation is employed. The fundamental eigenvalue is approximated by iteration utilizing the power method and point successive overrelaxation. Some numerical results are given and compared, in certain special cases, with analytical solutions to the eigenvalue problem. The significance of the numerical eigenvalue results is discussed in terms of the singularities in the solution of three-dimensional boundary-value problems near a polyhedral corner of the domain.

Walden, H.↗
NASA NTRS1990

The kink instability in infinite cylindrical flux tubes - Eigenvalues for power-law twist profiles

Simple, accurate methods of calculating ideal MHD instability eigenvalues for infinitely long cylindrical tubes with twist function T(r) are developed. The results show that the most rapidly growing and energetic instabilities occur in the Gold-Hoyle v = 0 field, with the instability progressively weakening with increasing v. However, the maximum force eigenvalue is always small, so that even in the Gold-Hoyle case only a small proportion of the available magnetic energy can be released in the linear phase. The results also confirm that the linear pinch is remarkably weak yet relatively resistant to line-tying. It is shown that the weakness of the force eigenvalue implies that the influence of uniform gas pressure on stability is negligible. Implications for the energy-release mechanism in solar flares are discussed.

Craig, I. J. D.↗
NASA NTRS1982

Evaluation and reduction of errors induced by the Guyan transformation

The Guyan reduction refers to a method used to reduce the number of degrees of freedom in a structural model for dynamic analysis. Experience shows that, if the method is properly employed, then this reduction method does in fact provide a "reasonably" accurate approximation of the dynamic characteristics of the unreduced model. A method that provides an accurate estimate of the error in each mode of the reduced eigenvalue problem and, in addition, gives first order correction terms that greatly improve the accuracy of the eigenvectors and eigenvalues is presented. The method is demonstrated by standard COSMIC NASTRAN DAMP alters to rigid format 3, real normal mode analysis. Comparative computer time of modal extraction versus error analysis is discussed for the VAX-11/780 version of COSMIC NASTRAN.

Fox, G. L.↗
NASA NTRS1987

Robust eigensystem assignment for flexible structures

An improved method is developed for eigenvalues and eigenvectors placement of a closed-loop control system using either state or output feedback. The method basically consists of three steps. First, the singular value of QR decomposition is used to generate an orthonormal basis that spans admissible eigenvector space corresponding to each assigned eigenvalue. Secondly, given a unitary matrix, the eigenvector set which best approximates the given matrix in the least-square sense and still satisfy eigenvalue cosntraints is determined. Thirdly, a unitary matrix is sought to minimize the error between the unitary matrix and the assignable eigenvector matrix. For use as the desired eigenvector set, two matrices, namely, the open-loop eigenvector matrix and its closest unitary matrix are proposed. The latter matrix generally encourages both minimum conditioning and control gains. In addition, the algorithm is formulated in real arithmetic for efficient implementation. To illustrate the basic concepts, numerical examples are included.

Juang, Jer-Nan↗
NASA NTRS1986

Simultaneous iterations algorithm for general eigenvalue problems on parallel processors

The method of simultaneous iteration with shift is extended to extraction of m-eigenpairs of a general eigenvalue problem of large order n in a parallel processing environment. The algorithm combines the power method and the Jacobi technique, and reduces to performing four basic operations. Parallel implementation of the algorithm is discussed in detail. The analysis accounts for computation and communication costs, and utilizes a parallel processing architecture of the ensemble type. Expressions for the computational efficiency and speedup are defined as a function of the problem and hardware parameters. Selected representative problems exhibit efficiencies ranging from 60 to 98 percent.

Utku, S.↗
NASA NTRS1979

A finite element formulation of the eigenvalue problem in lined ducts with flow

A finite element method is used to formulate the eigenvalue problem for a lined duct with flow. Either two dimensional or axially symmetric ducts with sheared flows can be studied, although the examples cited are two dimensional. The primitive variables of velocity and pressure are used with quadratic shape functions in each element. Results indicate that a useful level of accuracy can be achieved with a modest number of elements. Spurious eigenvalues, easily identified by obviously inconsistent eigenvectors, occur in certain instances. If the number of elements is not too small, these spurious modes are among the higher order eigenvalues of otherwise questionable accuracy. The possibility of using higher order elements which have slope continuity is proposed for future investigations to eliminate the spurious results.

Astley, R. J.↗
NASA NTRS1991

Acceleration of convergence by shifting the spectrum of implicit finite difference operators associated with the equations of gas dynamics

Eigensystem analysis techniques are applied to finite difference formulations of the Navier-Stokes equations in one dimension. Spectra of the resulting implicit difference operators are computed. The largest eigenvalues are calculated by using a combination of the Frechet derivative of the operators and Arnoldi's method. The accuracy of Arnoldi's method is tested by comparing the rate of convergence of the iterative method with the dominant eigenvalue of the original iteration matrix. On the basis of the pattern of eigenvalue distributions for various flow configurations, a shifting of the implicit operators in question is devised. This procedure has improved the rates of convergence of CFD codes by 20 - 50 percent.

Cheer, A.↗
NASA NTRS1988

Derivatives of eigenvalues and eigenvectors of a general complex matrix

A survey of methods for sensitivity analysis of the algebraic eigenvalue problem for non-Hermitian matrices is presented. In addition, a modification of one method based on a better normalizing condition is proposed. Methods are classified as Direct or Adjoint and are evaluated for efficiency. Operation counts are presented in terms of matrix size, number of design variables and number of eigenvalues and eigenvectors of interest. The effect of the sparsity of the matrix and its derivatives is also considered, and typical solution times are given. General guidelines are established for the selection of the most efficient method.

Murthy, Durbha V.↗
NASA NTRS1978

The stability of an asymmetric rotor in damped supports

A general-purpose method of evaluating the stability of an asymmetric flexible rotor, mounted in symmetric damped bearings, is defined. This method evaluates the complex eigenvalues of the rotor system by solving the equations of motion in a rotating coordinate frame. The application of this method to a rotor mounted in tilting-pad bearings is demonstrated. The observed behavior of a number of different rotor configurations is compared with corresponding predictions of stability. For the configurations predicted to be unstable, a distinct and unnegotiable threshold of instability is encountered. The sharpness of this threshold is emphasized by careful balancing at speeds fractionally below the threshold. In a final configuration predicted to be marginally stable, lightly damped resonant behavior, negotiable by balancing, is encountered in the region of the first critical speed.

Smalley, A. J.↗
NASA NTRS1987

Improvement of modal scaling factors using mass additive technique

A general investigation into the improvement of modal scaling factors of an experimental modal model using additive technique is discussed. Data base required by the proposed method consists of an experimental modal model (a set of complex eigenvalues and eigenvectors) of the original structure and a corresponding set of complex eigenvalues of the mass-added structure. Three analytical methods,i.e., first order and second order perturbation methods, and local eigenvalue modification technique, are proposed to predict the improved modal scaling factors. Difficulties encountered in scaling closely spaced modes are discussed. Methods to compute the necessary rotational modal vectors at the mass additive points are also proposed to increase the accuracy of the analytical prediction.

Zhang, Qiang↗
DOE OSTI2024

Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method

Quantum phase estimation is one of the most powerful quantum primitives. This work proposes a new approach for the problem of multiple eigenvalue estimation: Quantum Multiple Eigenvalue Gaussian filtered Search (QMEGS). QMEGS leverages the Hadamard test circuit structure and only requires simple classical postprocessing. QMEGS is the first algorithm to simultaneously satisfy the following two properties: (1) It can achieve the Heisenberg-limited scaling without relying on any spectral gap assumption. (2) With a positive energy gap and additional assumptions on the initial state, QMEGS can estimate all dominant eigenvalues to ϵ accuracy utilizing a significantly reduced circuit depth compared to the standard quantum phase estimation algorithm. In the most favorable scenario, the maximal runtime can be reduced to as low as log(1/ϵ). This implies that QMEGS serves as an efficient and versatile approach, achieving the best-known results for both gapped and gapless systems. Numerical results validate the efficiency of our proposed algorithm in various regimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1993

Eigenvalue routines in NASTRAN: A comparison with the Block Lanczos method

The NASA STRuctural ANalysis (NASTRAN) program is one of the most extensively used engineering applications software in the world. It contains a wealth of matrix operations and numerical solution techniques, and they were used to construct efficient eigenvalue routines. The purpose of this paper is to examine the current eigenvalue routines in NASTRAN and to make efficiency comparisons with a more recent implementation of the Block Lanczos algorithm by Boeing Computer Services (BCS). This eigenvalue routine is now available in the BCS mathematics library as well as in several commercial versions of NASTRAN. In addition, CRAY maintains a modified version of this routine on their network. Several example problems, with a varying number of degrees of freedom, were selected primarily for efficiency bench-marking. Accuracy is not an issue, because they all gave comparable results. The Block Lanczos algorithm was found to be extremely efficient, in particular, for very large size problems.

Tischler, V. A.↗
NASA NTRS1965

Lower Bounds to Energy Eigenvalues for the Stark Effect in a Rigid Rotator

Upper and lower bounds have been calculated for the energy levels of a rigid rotator in an electric field, in order to study the problems associated with the use of the partitioning method for bracketing an eigenvalue of the Schrödinger equation. Results of arbitrarily high accuracy are possible in this example.

Choi, Jong H.↗
DOE OSTI2024

Reducing Operator Complexity of Galerkin Coarse-grid Operators with Machine Learning

Here, we propose a data-driven and machine-learning-based approach to compute non-Galerkin coarse-grid operators in multigrid (MG) methods, addressing the well-known issue of increasing operator complexity. Guided by the MG theory on spectrally equivalent coarse-grid operators, we have developed novel machine learning algorithms that utilize neural networks combined with smooth test vectors from multigrid eigenvalue problems. The proposed method demonstrates promise in reducing the complexity of coarse-grid operators while maintaining overall MG convergence for solving parametric partial differential equation problems. Numerical experiments on anisotropic rotated Laplacian and linear elasticity problems are provided to showcase the performance and comparison with existing methods for computing non-Galerkin coarse-grid operators.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1973

Eigenvalue uncertainty in stressed structures.

A method is presented for calculating the statistics of the natural frequencies and mode shapes of vibration for a structure acted upon by an external static loading which results in the structure being stressed for eigenvalue analysis. The analytical tools presented apply to the probabilistic eigenvalue problem, and it is apparent that structural parameter uncertainty will significantly influence all aspects of the structure's response. The treatment of a sample problem serves the purpose of furthering understanding for the importance of considering structural parameters as random variables.

Hart, G. C.↗