Search NASA⌕ Search

SEARCH · Search NASA

Results for “Eigenvalue”

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 199 records · Page 11

Space-Dependent Wielandt Shifts for Multigroup Diffusion Eigenvalue Problems

We present a new concept—the space-dependent Wielandt shift (SDWS)—for accelerating the convergence of the power iteration (PI) scheme for multigroup diffusion k-eigenvalue problems. The SDWS improves on standard Wielandt shift (WS) techniques, which are empirical in nature and are typically effective only when the current estimate of the solution is reasonably converged. By accounting for the physics of the problem through SDWS, we are able to improve the acceleration for the initial iterates when the current estimate of the solution is not close to convergence. Numerical results from one-dimensional problems suggest that, compared to standard WS techniques, the new SDWS techniques can provide upward of a 46% reduction in the number of PIs required for convergence and a 40% reduction in the computational time required. This improvement is sensitive to several problem-dependent factors, such as the geometry and energy-dependence of the problem, the spatial discretization, and the initial guess. The reduction in computational time is also dependent on the linear solver in the PI scheme, as it is well known that WSs can significantly worsen the conditioning of the diffusion linear system. In this paper, we provide a detailed study of the impact of WSs on the performance of several iterative linear solvers. Results from our implementation of SDWS in the three-dimensional (3D) code MPACT show that SDWS can provide similar speedups for 3D multigroup diffusion eigenvalue problems. These results also show that moderate speedups can be obtained by applying SDWS to the coarse mesh finite difference (CMFD) solver in a CMFD-accelerated transport scheme. However, the benefit of doing this may be limited because all but the first few CMFD solves are relatively easy to converge, regardless of the WS used.

Nuclear Science & Technology↗

Two transitions in complex eigenvalue statistics: Hermiticity and integrability breaking

Open quantum systems have complex energy eigenvalues which are expected to follow non-Hermitian random matrix statistics, when chaotic, or two-dimensional (2d) Poisson statistics, when integrable. We investigate the spectral properties of a many-body quantum spin chain, i.e., the Hermitian Heisenberg model with imaginary disorder. Its rich complex eigenvalue statistics is found to separately break both Hermiticity and integrability at different scales of the disorder strength. With no disorder, the system is integrable and Hermitian, with spectral statistics corresponding to the 1d Poisson point process. At very small disorder, we find a transition from 1d Poisson statistics to an effective D -dimensional Poisson point process, showing Hermiticity breaking. At intermediate disorder, we find integrability breaking, as inferred from the statistics matching that of non-Hermitian complex symmetric random matrices in class AI † . For large disorder, as the spins align, we recover the expected integrability (now in the non-Hermitian setup), indicated by 2d Poisson statistics. These conclusions are based on fitting the spin-chain data of numerically generated nearest- and next-to-nearest-neighbor spacing distributions to an effective 2d Coulomb gas description at inverse temperature β . We confirm that such an effective description of random matrices also applies in classes AI † and AII † up to next-to-nearest-neighbor spacings. Published by the American Physical Society 2025

Akemann, Gernot (ORCID:0000000217104258)↗

Uncertainty Underprediction in Monte Carlo Eigenvalue Calculations

It is well-known that statistical estimates obtained from Monte Carlo criticality simulations can be adversely affected by cycle-to-cycle correlations in the fission source, which can lead to estimates of statistical uncertainties that are lower than the true uncertainty by a factor of 5 or more. However, several other more fundamental issues such as adequate source sampling over the fissionable regions and source convergence can have a significant impact on the uncertainties for the calculated eigenvalue and localized tally means, and these issues may be mistaken for effects resulting from cycle-to-cycle correlations. In worst-case scenarios, the uncertainty may be underpredicted by a factor of 40 or more. Since Monte Carlo methods are widely used in criticality safety applications and are increasingly being used for benchmarking reactor analyses, an in-depth understanding of the effects of these issues must be developed in order to support the practical use of Monte Carlo software packages. A rigorous statistical analysis of eigenvalue and localized tally results in Monte Carlo criticality calculations is presented using the SCALE/KENO-VI (continuous-energy version) and MCNP codes. The purpose of this analysis is to investigate the underprediction of uncertainty and its sensitivity to problem characteristics and calculational parameters using two of the most widely used Monte Carlo criticality codes. For the problems considered here, which are fuel rod and fuel assembly problems with reflecting boundary conditions on all four horizontal sides, we show that adequate source convergence along with proper specification of Monte Carlo parameters can reduce the magnitude of uncertainty underprediction to reasonable levels, below a factor of 2 in most cases.

Mervin, Brenden T↗

Eigenvalues of the Laplacian of a graph

Let G be a finite undirected graph with no loops or multiple edges. The Laplacian matrix of G, Delta(G), is defined by Delta sub ii = degree of vertex i and Delta sub ij = -1 if there is an edge between vertex i and vertex j. The structure of the graph G is related to the eigenvalues of Delta(G); in particular, it is proved that all the eigenvalues of Delta(G) are nonnegative, less than or equal to the number of vertices, and less than or equal to twice the maximum vertex degree. Precise conditions for equality are given.

Anderson, W. N., Jr.↗

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.↗

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

Note is made of an earlier paper which defined finite difference operators for the Hilbert space L2(m), and gave the eigenvalues for these operators. The present work examines eigenvalues for higher order singular differential operators by using finite difference methods. The two self-adjoint operators investigated are defined by a particular value in the same Hilbert space, L2(m), and are strictly positive with compact inverses. A class of finite difference operators is considered, with the idea of application to the theory of Toeplitz matrices. The approximating operators consist of a good approximation plus a perturbing operator.

Baxley, J. V.↗

Solution of eigenvalue problems by Sturm sequence method.

A generalized eigenvalue algorithm is presented herein along with the complete listing of the associated computer program, which may be conveniently utilized for the efficient solution of certain broad classes of eigenvalue problems. Extensive applications of the procedure are envisaged in the analysis of many important engineering problems, such as stability and natural frequency analysis of practical discrete structural systems, idealized by the finite element technique. The procedure based on the Sturm sequence method is accurate and fast, possessing several significant advantages over other known methods of such analysis. Numerical results are also presented for two representative structural engineering problems.

Gupta, K. K.↗

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.↗

An automated procedure for computing flutter eigenvalues.

A new, fast and economical automated procedure for implementing the traditional V-g method of flutter solution is described. The procedure requires as input the generalized aerodynamic forces for a range of reduced frequencies obtained from an aerodynamic program. These aerodynamic forces are interpolated with respect to reduced frequency using a newly developed, partially tabulated cubic spline that is both fast in execution and economical in storage. The flutter solution is then obtained using an eigenvalue routine that has been developed to take advantage of the parametric nature of the V-g type of solution. Furthermore, the routine takes care of the fundamental and troublesome problem of properly sorting the output eigenvalues. By solving the root-sorting problem, the interpolation for flutter crossings and automatic plotting are accomplished efficiently. The computational techniques used in this new program are described and some sample results are given.

Desmarais, R. N.↗

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.↗

ALARM: A highly efficient eigenvalue extraction routine for very large matrixes

A highly efficient computer program, called ALARM, for the determination of eigenvalues and eigenvectors of large symmetric matrices (over 10,000 degrees of freedom), was described. As such, it is highly useful for analyzing complex finite element and finite difference idealizations encountered in structural dynamics and acoustic probelms. The program is based upon a scheme which reduces a large matrix to an equivalent tridiagonal one of much smaller size. The main strength of the algorithm lies in its ability to retain all the information required to obtain the eigenvalues at either end of the original matrix spectrum.

Ojalvo, I. U.↗

The eigenvalue spectrum of the Orr-Sommerfeld problem

A numerical investigation of the temporal eigenvalue spectrum of the ORR-Sommerfeld equation is presented. Two flow profiles are studied, the plane Poiseuille flow profile and the Blasius boundary layer (parallel): flow profile. In both cases a portion of the complex c-plane bounded by 0 less than or equal to CR sub r 1 and -1 less than or equal to ci sub i 0 is searched and the eigenvalues within it are identified. The spectra for the plane Poiseuille flow at alpha = 1.0 and R = 100, 1000, 6000, and 10000 are determined and compared with existing results where possible. The spectrum for the Blasius boundary layer flow at alpha = 0.308 and R = 998 was found to be infinite and discrete. Other spectra for the Blasius boundary layer at various Reynolds numbers seem to confirm this result. The eigenmodes belonging to these spectra were located and discussed.

Antar, B. N.↗

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.↗

Initial values for the integration scheme to compute the eigenvalues for propagation in ducts

A scheme for the calculation of eigenvalues in the problem of acoustic propagation in a two-dimensional duct is described. The computation method involves changing the coupled transcendental nonlinear algebraic equations into an initial value problem involving a nonlinear ordinary differential equation. The simplest approach is to use as initial values the hardwall eigenvalues and to integrate away from these values as the admittance varies from zero to its actual value with a linear variation. The approach leads to a powerful root finding routine capable of computing the transverse and axial wave numbers for two-dimensional ducts for any frequency, lining, admittance and Mach number without requiring initial guesses or starting points.

Eversman, W.↗

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.↗

The role of eigenvalues in linear feature selection theory

The analysis concerns the role of eigenvalues in determining a particular measure of pattern class distinction called the divergence, which is the pairwise average of the expected interclass divergence derived from Hajek's two-class divergence. Decel and Quirein (1973) showed that there always exists a k x n real matrix B such that the transformation determined by B maximizes divergence in k-dimensional space, and that B can be written as a product involving an orthogonal n x n matrix U. In the present paper it is shown that divergence measure of pattern class distinction does not depend on the eigenvalues of U.

Brown, D. R.↗