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 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Colloquium: Eigenvector continuation and projection-based emulators

Eigenvector continuation is a computational method for parametric eigenvalue problems that uses subspace projection with a basis derived from eigenvector snapshots from different parameter sets. It is part of a broader class of subspace-projection techniques called reduced-basis methods. In this Colloquium, the development, theory, and applications of eigenvector continuation and projection-based emulators are presented. In conclusion, the basic concepts are introduced, the underlying theory and convergence properties are discussed, and recent applications for quantum systems and future prospects are presented.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1987

A new method of imposing boundary conditions for hyperbolic equations

A new method to impose boundary conditions for pseudospectral approximations to hyperbolic equations is suggested. This method involves the collocation of the equation at the boundary nodes as well as satisfying boundary conditions. Stability and convergence results are proven for the Chebyshev approximation of linear scalar hyperbolic equations. The eigenvalues of this method applied to parabolic equations are shown to be real and negative.

Funaro, D.↗
NASA NTRS1988

A new method of imposing boundary conditions in pseudospectral approximations of hyperbolic equations

A new method to impose boundary conditions for pseudospectral approximations to hyperbolic equations is suggested. This method involves the collocation of the equation at the boundary nodes as well as satisfying boundary conditions. Stability and convergence results are proven for the Chebyshev approximation of linear scalar hyperbolic equations. The eigenvalues of this method applied to parabolic equations are shown to be real and negative.

Funaro, D.↗
NASA NTRS1988

An O(N squared) method for computing the eigensystem of N by N symmetric tridiagonal matrices by the divide and conquer approach

An efficient method is proposed to solve the eigenproblem of N by N Symmetric Tridiagonal (ST) matrices. Unlike the standard eigensolvers which necessitate O(N cubed) operations to compute the eigenvectors of such ST matrices, the proposed method computes both the eigenvalues and eigenvectors with only O(N squared) operations. The method is based on serial implementation of the recently introduced Divide and Conquer (DC) algorithm. It exploits the fact that by O(N squared) of DC operations, one can compute the eigenvalues of N by N ST matrix and a finite number of pairs of successive rows of its eigenvector matrix. The rest of the eigenvectors--all of them or one at a time--are computed by linear three-term recurrence relations. Numerical examples are presented which demonstrate the superiority of the proposed method by saving an order of magnitude in execution time at the expense of sacrificing a few orders of accuracy.

Gill, Doron↗
NASA NTRS1972

A NASTRAN correlation study for vibrations of a cross-stiffened ship's deck

To evaluate the effectiveness of NASTRAN for predicting the vibration modes of panels with bending-membrane coupling, a cross-stiffened ship deck was analyzed. In correlation with experimental data, one NASTRAN finite element representation gave results slightly more accurate than a previous analytical solution. Computational time was excessively long, due to the Guyan method of reducing the eigenvalue problem. It is recommended that a more efficient method of matrix reduction be implemented for the lumped mass formulation.

Thornton, E. A.↗
DOE OSTI2019

Identification of important error fields in stellarators using the Hessian matrix method

Error fields are predominantly attributed to inevitable coil imperfections. Controlling error fields during coil fabrication and assembly is crucial for stellarators. Excessively tight coil tolerance increases time and cost, and, in part, led to the cancellation of the National Compact Stellarator Experiment and delay of W7-X. In this paper, we improve the recently proposed Hessian matrix method to rapidly identify important coil deviations. Two of the most common figures of merit, magnetic island size and quasi-symmetry, are analytically differentiated over coil parameters. By extracting the eigenvectors of the Hessian matrix, we can directly identify sensitive coil deviations in the order of the eigenvalues. The new method is applied to the upcoming Chinese First Quasi-axisymmetric Stellarator configuration. Important perturbations that enlarge n/m = 4/11 islands and deteriorate quasi-axisymmetry of the magnetic field are successfully determined. The results suggest each modular coil should have separate tolerance and some certain perturbation combinations will produce significant error fields. By relaxing unnecessary coil tolerance, this method will hopefully lead to a substantial reduction in time and cost.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Block Lanczos algorithm for lattice QCD spectroscopy and matrix elements

Recent work introduced a new framework for analyzing correlation functions with improved convergence and signal-to-noise properties, as well as rigorous quantification of excited-state effects, based on the Lanczos algorithm and spurious eigenvalue filtering with the Cullum-Willoughby test. Here, we extend this framework to the analysis of correlation-function matrices built from multiple interpolating operators in lattice quantum chromodynamics (QCD) by constructing an oblique generalization of the block Lanczos algorithm, as well as a new physically motivated reformulation of the Cullum-Willoughby test that generalizes to block Lanczos straightforwardly. The resulting block Lanczos method directly extends generalized eigenvalue problem (GEVP) methods, which can be viewed as applying a single iteration of block Lanczos. Block Lanczos provides qualitative and quantitative advantages over GEVP methods analogous to the benefits of Lanczos over the standard effective mass, including faster convergence to ground- and excited-state energies, explicitly computable two-sided error bounds, straightforward extraction of matrix elements of external currents, and asymptotically constant signal-to-noise. No fits or statistical inference are required. Proof-of-principle calculations are performed for noiseless mock-data examples as well as two-by-two proton correlation-function matrices in lattice QCD.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1984

A new method for determining acoustic-liner admittance in a rectangular duct with grazing flow from experimental data

A method is developed for determining acoustic liner admittance in a rectangular duct with grazing flow. The axial propagation constant, cross mode order, and mean flow profile is measured. These measured data are then input into an analytical program which determines the unknown admittance value. The analytical program is based upon a finite element discretization of the acoustic field and a reposing of the unknown admittance value as a linear eigenvalue problem on the admittance value. Gaussian elimination is employed to solve this eigenvalue problem. The method used is extendable to grazing flows with boundary layers in both transverse directions of an impedance tube (or duct). Predicted admittance values are compared both with exact values that can be obtained for uniform mean flow profiles and with those from a Runge Kutta integration technique for cases involving a one dimensional boundary layer.

Watson, W. R.↗
NASA NTRS1989

The use of Lanczos's method to solve the large generalized symmetric definite eigenvalue problem

The generalized eigenvalue problem, Kx = Lambda Mx, is of significant practical importance, especially in structural enginering where it arises as the vibration and buckling problem. A new algorithm, LANZ, based on Lanczos's method is developed. LANZ uses a technique called dynamic shifting to improve the efficiency and reliability of the Lanczos algorithm. A new algorithm for solving the tridiagonal matrices that arise when using Lanczos's method is described. A modification of Parlett and Scott's selective orthogonalization algorithm is proposed. Results from an implementation of LANZ on a Convex C-220 show it to be superior to a subspace iteration code.

Jones, Mark T.↗
DOE OSTI2022

Rethinking the ill-posedness of the spectral function reconstruction — Why is it fundamentally hard and how Artificial Neural Networks can help

Reconstructing hadron spectral functions through Euclidean correlation functions are of the important missions in lattice QCD calculations. However, in a Källen–Lehmann (KL) spectral representation, the reconstruction is observed to be ill-posed in practice. It is usually ascribed to the fewer observation points compared to the number of points in the spectral function. In this paper, by solving the eigenvalue problem of continuous KL convolution, we show analytically that the ill-posedness of the inversion is fundamental and it exists even for continuous correlation functions. We discussed how to introduce regulators to alleviate the predicament, in which include the Artificial Neural Networks (ANNs) representations recently proposed by the Authors in another study. The uniqueness of solutions using ANNs representations is manifested analytically and validated numerically. Reconstructed spectral functions using different regularization schemes are also demonstrated, together with their eigen-mode decomposition. We observe that components with large eigenvalues can be reliably reconstructed by all methods, whereas those with low eigenvalues need to be constrained by regulators.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1992

The eigenvalue spectrum of the Rayleigh equation for a plane shear layer

The eigenvalue spectrum of the Rayleigh equation is examined using three different solution techniques. In particular, a simple second-order finite difference scheme and two spectral methods, the Chebyshev tau and Chebyshev collocation methods, are used to discretize the equation. All of the approximation methods are shown to be capable of predicting the discrete spectrum as well as the continuous spectrum associated with the critical point singularity for the Rayleigh equation. The global eigenvalue methods considered here provide an efficient way of obtaining either an approximation to the complete eigenvalue spectrum or initial guesses for a local shooting procedure for the discrete part of the spectrum.

Liou, William W.-W.↗
DOE OSTI2023

Ballooning theory for micro-tearing mode in tokamak

This paper aims to investigate the impact of magnetic drift on the linear micro-tearing mode by using a kinetic approach to derive a reduced two-field eigen system in real space. Here, since the magnetic drift in real space has derivatives, it is more efficient to solve the mode equations in a Fourier-ballooning representation using the two-dimensional (2D) ballooning transform. The lowest-order eigen system in the Fourier-ballooning representation consists of two integral equations, which are numerically solved using the finite difference method for both eigenvalues and wave functions. The main results will be presented through graphical eigenvalue scans for each parameter. Furthermore, we present a graphical comparison between the predictions of the ballooning theory and GENE gyrokinetic code simulation in the pedestal region.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Polynomial Preconditioned Arnoldi with Stability Control

Polynomial preconditioning can improve the convergence of the Arnoldi method for computing eigenvalues. Such preconditioning significantly reduces the cost of orthogonalization; for difficult problems, it can also reduce the number of matrix-vector products. Parallel computations can particularly benefit from the reduction of communication-intensive operations. Additoinally, the GMRES algorithm provides a simple and effective way of generating the preconditioning polynomial. For some problems high degree polynomials are especially effective, but they can lead to stability problems that must be mitigated. A two-level “double polynomial preconditioning” strategy provides an effective way to generate high-degree preconditioners.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A State-Space Model of an Inverter-Based Microgrid for Multivariable Feedback Control Analysis and Design

In this work, a synchronous model for grid-connected and islanded microgrids is presented. The grid-connected model is based on the premise that the reference frame is synchronized with the AC bus. The quadrature component of the AC bus voltage can be cancelled, which allows to express output power as a linear equation for nominal values in the AC bus amplitude voltage. The model for the islanded microgrid is developed by integrating all the inverter dynamics using a state-space model for the load currents. This model is presented in a comprehensive way such that it could be scalable to any number of inverter-based generators using inductor–capacitor–inductor (LCL) output filters. The use of these models allows designers to assess microgrid stability and robustness using modern control methods such as eigenvalue analysis and singular value diagrams. Both models were tested and validated in an experimental setup to demonstrate their accuracy in describing microgrid dynamics. In addition, three scenarios are presented: non-controlled model, Linear-Quadratic Integrator (LQI) power control, and Power-Voltage (PQ/Vdq) droop–boost controller. Experimental results demonstrate the effectiveness of the control strategies and the accuracy of the models to describe microgrid dynamics.

24 POWER TRANSMISSION AND DISTRIBUTION↗