Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized eigenvalue problem”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Fast calculation of the tokamak vertical instability

There has been recent interest in fast calculations of the tokamak axisymmetric vertical instability for real time feedback control purposes. It is shown that the maximum eigenvalue for the basic rigid version of this stability problem can be obtained by finding the positive root to a simple scalar function. This function can be generalized to include plasma mass and has complexity linear in the number of conductive elements. The formulation is based on standard matrix decompositions of the fixed-geometry part of the eigenproblem. The calculation bottleneck is the summary of mutual inductances from the reconstructed equilibrium current density. The with-mass spectrum can be made fully real-valued by the addition of a critical amount of damping with negligible effect on the vertical growth rate. Furthermore, the calculation has been implemented in the plasma control system at the DIII-D tokamak and used in experiments.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2023

Boson star normal modes

Boson stars are gravitationally bound objects that arise in ultralight dark matter models and form in the centers of galactic halos or axion miniclusters. We systematically study the excitations of a boson star, taking into account the mixing between positive and negative frequencies introduced by gravity. We show that the spectrum contains zero-energy modes in the monopole and dipole sectors resulting from spontaneous symmetry breaking by the boson star background. We analyze the general properties of the eigenmodes and derive their orthogonality and completeness conditions which have non-standard form due to the positive-negative frequency mixing. The eigenvalue problem is solved numerically for the first few energy levels in different multipole sectors and the results are compared to the solutions of the Schrödinger equation in fixed boson star gravitational potential. The two solutions differ significantly for the lowest modes, but get close for higher levels. We further confirm the normal mode spectrum in 3D wave simulations where we inject perturbations with different multipoles. As an application of the normal mode solutions, we compute the matrix element entering the evaporation rate of a boson star immersed in a hot axion gas. The computation combines the use of exact wavefunctions for the low-lying bound states and of the Schrödinger approximation for the high-energy excitations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
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 NTRS1972

A fast numerical method for determining the optimum SNR of an array subject to a Q factor constraint.

The problem of finding the optimum current excitations for a point-detector array which extracts a signal from background noise using the criterion of maximizing the SNR subject to a constraint on the supergain ratio (or Q factor) has recently been solved. The formulation reduced the problem to one of solving for the roots of a polynomial whose coefficients are, in general, complex. We demonstrate that by making a certain transformation, it becomes possible to employ a state variable technique which changes the problem into one of finding the eigenvalues of a real matrix which is considerably faster to do.

Winkler, L. P.↗
NASA NTRS1978

Aircraft model prototypes which have specified handling-quality time histories

Several techniques for obtaining linear constant-coefficient airplane models from specified handling-quality time histories are discussed. The pseudodata method solves the basic problem, yields specified eigenvalues, and accommodates state-variable transfer-function zero suppression. The algebraic equations to be solved are bilinear, at worst. The disadvantages are reduced generality and no assurance that the resulting model will be airplane like in detail. The method is fully illustrated for a fourth-order stability-axis small motion model with three lateral handling quality time histories specified. The FORTRAN program which obtains and verifies the model is included and fully documented.

Johnson, S. H.↗
NASA NTRS1982

Application of matrix singular value properties for evaluating gain and phase margins of multiloop systems

A stability margin evaluation method in terms of simultaneous gain and phase changes in all loops of a multiloop system is presented. A universal gain-phase margin evaluation diagram is constructed by generalizing an existing method using matrix singular value properties. Using this diagram and computing the minimum singular value of the system return difference matrix over the operating frequency range, regions of guaranteed stability margins can be obtained. Singular values are computed for a wing flutter suppression and a drone lateral attitude control problem. The numerical results indicate that this method predicts quite conservative stability margins. In the second example if the eigenvalue magnitude is used instead of the singular value, as a measure of nearness to singularity, more realistic stability margins are obtained. However, this relaxed measure generally cannot guarantee global stability.

Mukhopadhyay, V.↗
NASA NTRS1981

Two-dimensional integrating matrices on rectangular grids

The use of integrating matrices in solving differential equations associated with rotating beam configurations is examined. In vibration problems, by expressing the equations of motion of the beam in matrix notation, utilizing the integrating matrix as an operator, and applying the boundary conditions, the spatial dependence is removed from the governing partial differential equations and the resulting ordinary differential equations can be cast into standard eigenvalue form. Integrating matrices are derived based on two dimensional rectangular grids with arbitrary grid spacings allowed in one direction. The derivation of higher dimensional integrating matrices is the initial step in the generalization of the integrating matrix methodology to vibration and stability problems involving plates and shells.

Lakin, W. D.↗
DOE OSTI2025

Ensemble Simulation Techniques and Fast Randomized Algorithms

The major goals of the project were to develop and analyze new ensemble simulation techniques, including trajectory stratification and preconditioned MCMC techniques, as well as develop fast numerical linear algebra techniques closely related to ensemble simulation ideas. The trajectory stratification techniques involve simulating in parallel short trajectory fragments of a Markov process confined to a specific region of space‐time and then patching together the statistics gathered to assemble estimates of very general dynamical properties. We have also developed this approach for rare event simulation and extended the techniques to applications requiring a more general framework (such as electronic structure calculations). The preconditioned MCMC techniques involve simulating multiple Markov chains in parallel and then using information from the ensemble to speed the mixing of each individual chain. The fast randomized linear algebra methods are motivated by the diffusion Monte Carlo technique, but are applicable to finding the dominant eigenvalue of (almost) general matrices. For most non‐negative matrices, the schemes result in an error (compared to the power method) that is constant in the dimension of the problem. For more general matrices, we see a very clear sublinear cost trend in computational tests.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1992

Application of vector-valued rational approximations to the matrix eigenvalue problem and connections with Krylov subspace methods

Let F(z) be a vectored-valued function F: C approaches C sup N, which is analytic at z=0 and meromorphic in a neighborhood of z=0, and let its Maclaurin series be given. We use vector-valued rational approximation procedures for F(z) that are based on its Maclaurin series in conjunction with power iterations to develop bona fide generalizations of the power method for an arbitrary N X N matrix that may be diagonalizable or not. These generalizations can be used to obtain simultaneously several of the largest distinct eigenvalues and the corresponding invariant subspaces, and present a detailed convergence theory for them. In addition, it is shown that the generalized power methods of this work are equivalent to some Krylov subspace methods, among them the methods of Arnoldi and Lanczos. Thus, the theory provides a set of completely new results and constructions for these Krylov subspace methods. This theory suggests at the same time a new mode of usage for these Krylov subspace methods that were observed to possess computational advantages over their common mode of usage.

Sidi, Avram↗
DOE OSTI2022

Computational Aspects of Single-Molecule Kinetics for Coupled Catalytic Cycles: A Spectral Analysis

Catalysis from single active sites is analyzed using methods developed from single molecule kinetics. Using a stochastic Markov state description, the observable properties of general catalytic networks of reactions are expressed using an eigenvalue decomposition of the transition matrix for the Markov process. By the use of a sensitivity analysis, the necessary eigenvalues and eigenvectors are related to the energies of controlling barriers and wells located along the reaction routes. A generalization of the energetic span theory allows the eigenvalues to be computed from several activation energies corresponding to distinct barrier-well pairings. The formalism is demonstrated accurately for model problems for a physically realistic mechanism for an alkene hydrogenation reaction on a single atom catalyst.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1990

Interchange instability of the earth's plasmapause

The factors that affect the interchange instability of the earth's plasmapause are investigated using an extension of Richmond's (1973) procedure based on computing individual particle motions. The effects of particle inertia, centrifugal force, and gravity are estimated. A general differential equation is derived for the time variation of the perturbation potential characterizing an electrostatic ripple with no field-aligned potential drop, which can be solved as an eigenvalue problem to find the linear growth rate. Approximate analytic solutions to this equation were obtained from which it was deduced that the interchange instability is caused by the sharp change in plasma pressure at the plasmapause; its growth rate is limited by ionospheric conductivity and, for very short wavelengths, by the inertia of the magnetospheric particles.

Huang, T. S.↗
DOE OSTI2025

Lanczos Algorithm, the Transfer Matrix, and the Signal-to-Noise Problem

This Letter introduces a method for determining the energy spectrum of lattice quantum chromodynamics by applying the Lanczos algorithm to the transfer matrix and using a bootstrap generalization of the Cullum-Willoughby method to filter out spurious eigenvalues. Proof-of-principle analyses of the simple harmonic oscillator and the lattice quantum chromodynamics proton mass demonstrate that this method provides faster ground-state convergence than the “effective mass,” which is related to the power-iteration algorithm. Lanczos provides more accurate energy estimates than multistate fits to correlation functions with small imaginary times while achieving comparable statistical precision. Two-sided error bounds are computed for Lanczos results and guarantee that excited-state effects cannot shift Lanczos results far outside their statistical uncertainties.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1990

Spurious frequencies as a result of numerical boundary treatments

The stability theory for finite difference Initial Boundary-Value approximations to systems of hyperbolic partial differential equations states that the exclusion of eigenvalues and generalized eigenvalues is a sufficient condition for stability. The theory, however, does not discuss the nature of numerical approximations in the presence of such eigenvalues. In fact, as was shown previously, for the problem of vortex shedding by a 2-D cylinder in subsonic flow, stating boundary conditions in terms of the primitive (non-characteristic) variables may lead to such eigenvalues, causing perturbations that decay slowly in space and remain periodic time. Characteristic formulation of the boundary conditions avoided this problem. A more systematic study of the behavior of the (linearized) one-dimensional gas dynamic equations under various sets of oscillation-inducing legal boundary conditions is reported.

Abarbanel, Saul↗
NASA NTRS1991

A modal aeroelastic analysis scheme for turbomachinery blading

An aeroelastic analysis is developed which has general application to all types of axial-flow turbomachinery blades. The approach is based on linear modal analysis, where the blade's dynamic response is represented as a linear combination of contributions from each of its in-vacuum free vibrational modes. A compressible linearized unsteady potential theory is used to model the flow over the oscillating blades. The two-dimensional unsteady flow is evaluated along several stacked axisymmetric strips along the span of the airfoil. The unsteady pressures at the blade surface are integrated to result in the generalized force acting on the blade due to simple harmonic motions. The unsteady aerodynamic forces are coupled to the blade normal modes in the frequency domain using modal analysis. An iterative eigenvalue problem is solved to determine the stability of the blade when the unsteady aerodynamic forces are included in the analysis. The approach is demonstrated by applying it to a high-energy subsonic turbine blade from a rocket engine turbopump power turbine. The results indicate that this turbine could undergo flutter in an edgewise mode of vibration.

Smith, Todd E.↗
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 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 NTRS1991

The stability of numerical boundary treatments for compact high-order finite-difference schemes

The stability characteristics of various compact fourth and sixth order spatial operators are assessed using the theory of Gustafsson, Kreiss and Sundstrom (G-K-S) for the semi-discrete Initial Boundary Value Problem (IBVP). These results are then generalized to the fully discrete case using a recently developed theory of Kreiss. In all cases, favorable comparisons are obtained between the G-K-S theory, eigenvalue determination, and numerical simulation. The conventional definition of stability is then sharpened to include only those spatial discretizations that are asymptotically stable. It is shown that many of the higher order schemes which are G-K-S stable are not asymptotically stable. A series of compact fourth and sixth order schemes, which are both asymptotically and G-K-S stable for the scalar case, are then developed.

Carpenter, Mark H.↗
NASA NTRS1981

Multigrid solvers on parallel computers

Massively parallel computers, as considered in this investigation, are not yet available. However, a large-scale parallel computer cannot usefully be designed before the hypothetical algorithms which will employ it are studied. Most of the studies of parallel partial differential equations (PDE) solvers are based on solution techniques much slower (on sequential machines) than multigrid methods. Multigrid methods are highly parallelizable. Each of their processes can simultaneously be performed at all grid points. The present investigation is concerned with a preliminary exploration of the potential of multigrid, or, more generally, Multi-Level Adaptive Techniques (MLAT) on computers with many processors. Basic processes are considered, taking into account coarse-grid approximation, relaxation, coarse-grid corrections, full multigrid algorithms, nonlinear problems and eigenvalue problems, fine-to-coarse correction, and chains of problems. Details of parallel multigrid processing are also examined.

Brandt, A.↗