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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Approximate analysis for repeated eigenvalue problems with applications to controls-structure integrated design

A method for eigenvalue and eigenvector approximate analysis for the case of repeated eigenvalues with distinct first derivatives is presented. The approximate analysis method developed involves a reparameterization of the multivariable structural eigenvalue problem in terms of a single positive-valued parameter. The resulting equations yield first-order approximations to changes in the eigenvalues and the eigenvectors associated with the repeated eigenvalue problem. This work also presents a numerical technique that facilitates the definition of an eigenvector derivative for the case of repeated eigenvalues with repeated eigenvalue derivatives (of all orders). Examples are given which demonstrate the application of such equations for sensitivity and approximate analysis. Emphasis is placed on the application of sensitivity analysis to large-scale structural and controls-structures optimization problems.

Kenny, Sean P.↗
NASA NTRS1972

Eigenvalues of singular differential operators by finite difference methods. I.

Approximation of the eigenvalues of certain self-adjoint operators defined by a formal differential operator in a Hilbert space. In general, two problems are studied. The first is the problem of defining a suitable Hilbert space operator that has eigenvalues. The second problem concerns the finite difference operators to be used.

Baxley, J. V.↗
DOE OSTI2024

On the convergence of the fixed point method for solving neutron transport alpha eigenvalue problems

It was shown that the Fixed Point Method (also known as the Rayleigh Quotient Method) is several times faster than the Critical Search Method for solving neutron transport alpha eigenvalue problems. It was also shown that the Fixed Point Method is able to determine the alpha eigenvalues of sub-critical systems that are beyond the reach of the Critical Search Method. Despite these significant advances, the Fixed Point Method remains an unproven algorithm. Here, this report provides a proof.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1989

Elimination of spurious eigenvalues in the Chebyshev tau spectral method

Spectral methods have been used to great advantage in hydrodynamic stability calculations; the concepts are described in Orszag's seminal application of the Chebyshev tau method to the Orr-Sommerfeld equation for plane Poiseuille flow in 1971. Orszag discusses both the Chebyshev Galerkin and the Chebyshev tau methods, but presents results for the tau method, which is easier to implement than the Galerkin method. The tau method has the disadvantage that two unstable eigenvalues are produced that are artifacts of the discretization. An extremely simple modification to the Chebyshev tau method is presented which eliminates the spurious eigenvalues. First a simplified model of the Orr-Sommerfeld equation discussed by Gottlieb and Orszag was studied. Then the Chebyshev tau method is considered, which has two spurious eigenvalues, and then a modification which eliminates them is described. Finally, results for the Orr-Sommerfeld equation are considered where the modified tau method also eliminates the spurious eigenvalues. The simplicity of the modification makes it a convenient alternative to other approaches to the problem.

Mcfadden, G. B.↗
NASA NTRS1997

The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian

We introduce the path resistance method for lower bounds on the smallest nontrivial eigenvalue of the Laplacian matrix of a graph. The method is based on viewing the graph in terms of electrical circuits; it uses clique embeddings to produce lower bounds on lambda(sub 2) and star embeddings to produce lower bounds on the smallest Rayleigh quotient when there is a zero Dirichlet boundary condition. The method assigns priorities to the paths in the embedding; we show that, for an unweighted tree T, using uniform priorities for a clique embedding produces a lower bound on lambda(sub 2) that is off by at most an 0(log diameter(T)) factor. We show that the best bounds this method can produce for clique embeddings are the same as for a related method that uses clique embeddings and edge lengths to produce bounds.

Guattery, Stephen↗
NASA NTRS1980

Comments on numerical solution of boundary value problems of the Laplace equation and calculation of eigenvalues by the grid method

The mathematics involved in numerically solving for the plane boundary value of the Laplace equation by the grid method is developed. The approximate solution of a boundary value problem for the domain of the Laplace equation by the grid method consists of finding u at the grid corner which satisfies the equation at the internal corners (u=Du) and certain boundary value conditions at the boundary corners.

Lyusternik, L. A.↗
NASA NTRS1977

Complex eigenvalue extraction in NASTRAN by the tridiagonal reduction (FEER) method

An extension of the Tridiagonal Reduction (FEER) method to complex eigenvalue analysis in NASTRAN is described. As in the case of real eigenvalue analysis, the eigensolutions closest to a selected point in the eigenspectrum are extracted from a reduced, symmetric, tridiagonal eigenmatrix whose order is much lower than that of the full size problem. The reduction process is effected automatically, and thus avoids the arbitrary lumping of masses and other physical quantities at selected grid points. The statement of the algebraic eigenvalue problem admits mass, damping and stiffness matrices which are unrestricted in character, i.e., they may be real, complex, symmetric or unsymmetric, singular or non-singular.

Newman, M.↗
NASA NTRS1973

Eigenvalue routine by Sturm sequence method

Computer program has been generated for efficient solution of certain broad classes of eigenvalue problems. Procedure fully exploits banded nature of associated matrices and further enables user to compute either all roots or any specific ones desired. Special storage options enable storing only nonzero elements of associated main matrix of eigenvalue problem.

Gupta, K. K.↗
NASA NTRS1976

Alternative methods for the design of jet engine control systems

Various alternatives to linear quadratic design methods for jet engine control systems are discussed. The main alternatives are classified into two broad categories: nonlinear global mathematical programming methods and linear local multivariable frequency domain methods. Specific studies within these categories include model reduction, the eigenvalue locus method, the inverse Nyquist method, polynomial design, dynamic programming, and conjugate gradient approaches.

Sain, M. K.↗
NASA NTRS1985

A control system design approach for flexible spacecraft

A control system design approach for flexible spacecraft is presented. The control system design is carried out in two steps. The first step consists of determining the ideal control system in terms of a desirable dynamic performance. The second step consists of designing a control system using a limited number of actuators that possess a dynamic performance that is close to the ideal dynamic performance. The effects of using a limited number of actuators is that the actual closed-loop eigenvalues differ from the ideal closed-loop eigenvalues. A method is presented to approximate the actual closed-loop eigenvalues so that the calculation of the actual closed-loop eigenvalues can be avoided. Depending on the application, it also may be desirable to apply the control forces as impulses. The effect of digitizing the control to produce the appropriate impulses is also examined.

Silverberg, L. M.↗
NASA NTRS1991

A comparison of numerical methods for the Rayleigh equation in unbounded domains

A second-order finite difference and two spectral methods, including a Chebyshev tau and a Chebyshev collocation method were implemented to determine the linear hydrodynamic stability of an unbounded shear flow. The velocity profile of the basic flow in the stability analysis mimicks that of a one-stream free mixing layer. Local and global eigenvalue solution methods are used to determine individual eigenvalues and the eigenvalue spectrum, respectively. The calculated eigenvalue spectrum includes a discrete mode, a continuous spectrum associated with the equation singularity and a continuous spectrum associated with the domain unboundedness. The efficiency and the accuracy of these discretization methods in the prediction of the eigensolutions of the discrete mode were evaluated by comparison with a conventional shooting procedure. Their capabilities in mapping out the continuous eigenvalue spectra are also discussed.

Liou, W. W.↗
NASA NTRS1977

Determination of pole sensitivities by Danilevskii's method

In control theory, a synonymous term for pole sensitivity is eigenvalue sensitivity. Existing methods of calculating eigenvalues are cumbersome, and cannot be trusted for systems roughly greater than tenth order. The method proposed in the present paper is applicable to high-order system. (It has been routinely used to generate eigenvalue sensitivities for systems up to 26th order, using a UNIVAC 1106.) Danilevskii's method is shown to be suitable for performing the necessary evaluations. The result is a rational function that can be used to evaluate the sensitivities for all distinct poles.

Nail, J. B.↗
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.↗
NASA NTRS1988

Numerical solution of large nonsymmetric eigenvalue problems

Several methods are discribed for combinations of Krylov subspace techniques, deflation procedures and preconditionings, for computing a small number of eigenvalues and eigenvectors or Schur vectors of large sparse matrices. The most effective techniques for solving realistic problems from applications are those methods based on some form of preconditioning and one of several Krylov subspace techniques, such as Arnoldi's method or Lanczos procedure. Two forms of preconditioning are considered: shift-and-invert and polynomial acceleration. The latter presents some advantages for parallel/vector processing but may be ineffective if eigenvalues inside the spectrum are sought. Some algorithmic details are provided that improve the reliability and effectiveness of these techniques.

Saad, Youcef↗
NASA NTRS1992

Eigenvalue error analysis of viscously damped structures using a Ritz reduction method

The efficient solution of the eigenvalue problem that results from inserting passive dampers with variable stiffness and damping coefficients into a structure is addressed. Eigenanalysis of reduced models obtained by retaining a number of normal modes augmented with Ritz vectors corresponding to the static solutions resulting from the load patterns introduced by the dampers has been empirically shown to yield excellent approximations to the full eigenvalue problem. An analysis of this technique in the case of a single damper is presented. A priori and a posteriori error estimates are generated and tested on numerical examples. Comparison theorems with modally truncated models and a Markov parameter matching reduced-order model are derived. These theorems corroborate the heuristic that residual flexibility methods improve low-frequency approximation of the system. The analysis leads to other techniques for eigenvalue approximation. Approximate closed-form solutions are derived that include a refinement to eigenvalue derivative methods for approximation. An efficient Newton scheme is also developed. A numerical example is presented demonstrating the effectiveness of each of these methods.

Chu, Cheng-Chih↗