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 NTRS1985

A method to stabilize linear systems using eigenvalue gradient information

Formal optimization methods and eigenvalue gradient information are used to develop a stabilizing control law for a closed loop linear system that is initially unstable. The method was originally formulated by using direct, constrained optimization methods with the constraints being the real parts of the eigenvalues. However, because of problems in trying to achieve stabilizing control laws, the problem was reformulated to be solved differently. The method described uses the Davidon-Fletcher-Powell minimization technique to solve an indirect, constrained minimization problem in which the performance index is the Kreisselmeier-Steinhauser function of the real parts of all the eigenvalues. The method is applied successfully to solve two different problems: the determination of a fourth-order control law stabilizes a single-input single-output active flutter suppression system and the determination of a second-order control law for a multi-input multi-output lateral-directional flight control system. Various sets of design variables and initial starting points were chosen to show the robustness of the method.

Wieseman, C. D.↗
NASA NTRS1978

CAVE3: A general transient heat transfer computer code utilizing eigenvectors and eigenvalues

The method of solution is a hybrid analytical numerical technique which utilizes eigenvalues and eigenvectors. The method is inherently stable, permitting large time steps even with the best of conductors with the finest of mesh sizes which can provide a factor of five reduction in machine time compared to conventional explicit finite difference methods when structures with small time constants are analyzed over long time periods. This code will find utility in analyzing hypersonic missile and aircraft structures which fall naturally into this class. The code is a completely general one in that problems involving any geometry, boundary conditions and materials can be analyzed. This is made possible by requiring the user to establish the thermal network conductances between nodes. Dynamic storage allocation is used to minimize core storage requirements. This report is primarily a user's manual for CAVE3 code. Input and output formats are presented and explained. Sample problems are included which illustrate the usage of the code as well as establish the validity and accuracy of the method.

Palmieri, J. V.↗
NASA NTRS1978

Extension of the tridiagonal reduction (FEER) method for complex eigenvalue problems in NASTRAN

As in the case of real eigenvalue analysis, the eigensolutions closest to a selected point in the eigenspectrum were extracted from a reduced, symmetric, tridiagonal eigenmatrix whose order was much lower than that of the full size problem. The reduction process was effected automatically, and thus avoided the arbitrary lumping of masses and other physical quantities at selected grid points. The statement of the algebraic eigenvalue problem admitted mass, damping, and stiffness matrices which were unrestricted in character, i.e., they might be real, symmetric or nonsymmetric, singular or nonsingular.

Newman, M.↗
NASA NTRS1975

Numerical methods for evaluating the derivatives of eigenvalues and eigenvectors

Two numerical methods are presented for computing the derivatives of eigenvalues and eigenvectors which do not require complete solution of the eigenvalue problem if only a few derivatives are sought. The 'iterative' method may be used to find the first derivative of one or all of the eigenvectors together with the second derivative of their eigenvalues in a self-adjoint system. If the left- and right-hand eigenvectors are known, the first derivative of the eigenvector corresponding to the largest eigenvalue and the second derivative of the largest eigenvalue may be obtained for a nonself-adjoint system. The 'algebraic' method may be used to find all orders of the derivatives, provided they exist, without requiring the left-hand eigenvectors.

Rudisill, C. S.↗
NASA NTRS1976

Real eigenvalue analysis in NASTRAN by the tridiagonal reduction (FEER) method

Implementation of the tridiagonal reduction method for real eigenvalue extraction in structural vibration and buckling problems is described. The basic concepts underlying the method are summarized and special features, such as the computation of error bounds and default modes of operation are discussed. In addition, the new user information and error messages and optional diagnostic output relating to the tridiagonal reduction method are presented. Some numerical results and initial experiences relating to usage in the NASTRAN environment are provided, including comparisons with other existing NASTRAN eigenvalue methods.

Newman, M.↗
NASA NTRS1996

Implicity restarted Arnoldi/Lanczos methods for large scale eigenvalue calculations

Eigenvalues and eigenfunctions of linear operators are important to many areas of applied mathematics. The ability to approximate these quantities numerically is becoming increasingly important in a wide variety of applications. This increasing demand has fueled interest in the development of new methods and software for the numerical solution of large-scale algebraic eigenvalue problems. In turn, the existence of these new methods and software, along with the dramatically increased computational capabilities now available, has enabled the solution of problems that would not even have been posed five or ten years ago. Until very recently, software for large-scale nonsymmetric problems was virtually non-existent. Fortunately, the situation is improving rapidly. The purpose of this article is to provide an overview of the numerical solution of large-scale algebraic eigenvalue problems. The focus will be on a class of methods called Krylov subspace projection methods. The well-known Lanczos method is the premier member of this class. The Arnoldi method generalizes the Lanczos method to the nonsymmetric case. A recently developed variant of the Arnoldi/Lanczos scheme called the Implicitly Restarted Arnoldi Method is presented here in some depth. This method is highlighted because of its suitability as a basis for software development.

Sorensen, Danny C.↗
NASA NTRS1990

Elimination of spurious eigenvalues in the Chebyshev tau spectral method

A very simple modification is presented for the Chebyshev tau method which can eliminate spurious eigenvalues, proceeding from a consideration of the vorticity-streamfunction reformulation of the Chebyshev tau method and the Chebyshev-Galerkin method, which have no spurious modes. Consideration of a model problem indicates that these two approaches are equivalent, and that they reduce to the present modification of the tau method. This modified tau method also eliminates spurious eigenvalues from the Orr-Sommerfeld equation.

Mcfadden, G. B.↗
NASA NTRS1991

Eigenvalue and eigenvector sensitivity and approximate analysis for repeated eigenvalue problems

A set of computationally efficient equations for eigenvalue and eigenvector sensitivity analysis are derived, and a method for eigenvalue and eigenvector approximate analysis in the presence of repeated eigenvalues is presented. The method developed for approximate analysis involves a reparamaterization of the multivariable structural eigenvalue problem in terms of a single positive-valued parameter. The resulting equations yield first-order approximations of changes in both the eigenvalues and eigenvectors associated with the repeated eigenvalue problem. Examples are given to demonstrate the application of such equations for sensitivity and approximate analysis.

Hou, Gene J. W.↗
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↗
DOE OSTI2018

Variance Estimation in Monte Carlo Eigenvalue Simulations Using Spectral Analysis Method

Monte Carlo (MC) simulation is widely used to solve the eigenvalue form of the Boltzmann transport equation that mathematically represents the neutron transport process through complex multiplying (fissionable) systems. Monte Carlo eigenvalue simulation starts with an assumed fission source distribution and uses the fission sites from the previous iteration (cycle) as the starting source in the current iteration. Important system parameters (MC tallies) such as fuel pin-power distribution are estimated over several cycles after the convergence of the fission source distribution to a stationary distribution. However, the MC fission source iteration algorithm that uses fission source sites from the previous cycle introduces a cycle-to-cycle correlation. Monte Carlo simulations that do not account for the cycle-to-cycle correlation systematically underestimate the variance of the estimated system parameters (sample mean). This paper presents the relationship between the spectral density in the frequency domain at frequency zero and the variance of the sample mean. This paper introduces a novel method in the frequency domain for the MC variance estimation. For the three test problems used in this paper, researchers have observed that the new method results in an improvement of more than one order of magnitude to the standard deviation of the sample mean. The new method also compares favorably with the previously introduced batch, bootstrap, and covariance-adjusted methods when applied to the three test problems investigated in this paper. This new method does not require modification of the MC eigenvalue algorithm (power iteration), is code agnostic, and is therefore easy to use when implementing in any existing MC code. In conclusion, the new estimate can be calculated without saving tally results of all active/stationary cycles.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗