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 109 records · Page 6

Accounting for water-column variability in shallow-water waveguide characterizations based on modal eigenvalues

The influence of water-column variability on the characterization of shallow-water waveguides using modal eigenvalue information is considered. This work is based on the relationship between the acoustic pressure field in shallow water and the depth-dependent Green's function through the Hankel transform. In many practical situations, the Hankel transform can be approximated by a Fourier transform, in which case the Green's function is approximated by a horizontal wave number spectrum with discrete peaks corresponding with individual modal eigenvalues. In turn, the wave number data can be used in inverse algorithms to determine geoacoustic properties of the waveguide. Wave number spectra are estimated from measurements of a point-source acoustic field on a horizontal aperture array in the water column. For range-dependent waveguides, techniques analogous to using a short-time Fourier transform are employed to estimate range-dependent wave number spectra. In this work, water-column variability due to linear internal waves and mesoscale features are considered. It will be shown that these two types of variability impact the estimation of range-dependent modal eigenvalues in different ways. Approaches for accounting for these different types of variability will be discussed as they apply to waveguide characterization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Embedded eigenvalues and the nonlinear Schroedinger equation

A common challenge in proving asymptotic stability of solitary waves is understanding the spectrum of the operator associated with the linearized flow. The existence of eigenvalues can inhibit the dispersive estimates key to proving stability. Following the work of Marzuola and Simpson [Nonlinearity 52, 389 (2011)], we prove the absence of embedded eigenvalues for a collection of nonlinear Schroedinger equations, including some one and three dimensional supercritical equations, and the three dimensional cubic-quintic equation. Our results also rule out nonzero eigenvalues within the spectral gap and end point resonances. The proof is computer assisted as it depends on the signs of certain inner products which do not readily admit analytic representations. Our source code is available for verification at http://hdl.handle.net/1807/26121.

97 MATHEMATICS AND COMPUTING↗

Eigenvalue problem of the Liouvillian of open quantum systems

It is argued that the Liouvillian that appears in the Liouville-von Neumann equation for open quantum systems can have complex eigenvalues. Attention is paid to the question whether the Liouvillian has an eigenvalue that are not given by the difference of the two Hamiltonian eigenvalues.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On eigenvalues of a P T-symmetric operator in a thin layer

We consider an elliptic operator with variable coefficients in a thin three-dimensional layer with P T-symmetric boundary conditions. We study the effect of the appearance of isolated eigenvalues at the edges of the gaps in the essential spectrum. We obtain sufficient conditions that guarantee that such eigenvalues either exist or are absent near a given edge of a gap. In the case of existence, the first terms in the asymptotic expansion of these emerging eigenvalues are calculated. Bibliography: 34 titles. (paper)

97 MATHEMATICS AND COMPUTING↗

Eigenvalue Solvers for Modeling Nuclear Reactors on Leadership Class Machines

In this paper, three complementary methods have been implemented in the code Denovo that accelerate neutral particle transport calculations with methods that use leadership-class computers fully and effectively: a multigroup block (MG) Krylov solver, a Rayleigh quotient iteration (RQI) eigenvalue solver, and a multigrid in energy (MGE) preconditioner. The MG Krylov solver converges more quickly than Gauss Seidel and enables energy decomposition such that Denovo can scale to hundreds of thousands of cores. RQI should converge in fewer iterations than power iteration (PI) for large and challenging problems. RQI creates shifted systems that would not be tractable without the MG Krylov solver. It also creates ill-conditioned matrices. The MGE preconditioner reduces iteration count significantly when used with RQI and takes advantage of the new energy decomposition such that it can scale efficiently. Each individual method has been described before, but this is the first time they have been demonstrated to work together effectively. The combination of solvers enables the RQI eigenvalue solver to work better than the other available solvers for large reactors problems on leadership-class machines. Using these methods together, RQI converged in fewer iterations and in less time than PI for a full pressurized water reactor core. These solvers also performed better than an Arnoldi eigenvalue solver for a reactor benchmark problem when energy decomposition is needed. The MG Krylov, MGE preconditioner, and RQI solver combination also scales well in energy. Finally, this solver set is a strong choice for very large and challenging problems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Adaptive Reweighted Variance Estimation for Monte Carlo Eigenvalue Simulations

Monte Carlo (MC) simulation is used to solve the eigenvalue form of the Boltzmann transport equation to estimate various parameters such as fuel pin flux distributions that are crucial for the safe and efficient operation of nuclear systems (e.g., a nuclear reactor). Monte Carlo eigenvalue simulation uses a sample mean over many stationary cycles (iterations) to estimate various parameters important to nuclear systems. A variance estimate of the sample mean is often used for calculating the confidence intervals. However, MC eigenvalue simulation variance estimators that ignore the intercycle correlation underestimate the true variance of the estimated quantity. This paper presents novel data-adaptive approaches based on a simple autoregressive (AR) model and sigmoid functions to improve MC variance estimation. The standard MC sample-based variance estimator (or naïve estimator) and the spectral density–based MC variance estimator are enhanced by adding data-adaptive components that reduce their bias and improve performance. By investigating the frequency pattern of the AR(1) (order 1) model, two adaptive spectral estimators and one adaptive naïve estimator are proposed. The proposed estimators manifest superior performance when applied to three test problems compared to the standard spectral density–based estimator previously introduced by the authors. In conclusion, these new estimators are straightforward, as they use online algorithms and do not require storage of tallies from all active cycles.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

General comparison theorem for eigenvalues of a certain class of Hamiltonians

Using the Hellmann-Feynman theorem, a general comparison theorem is established for an eigenvalue equation of the form (T+V)|{psi}>=E|{psi}>, where T is a kinetic part which depends only on momenta and V is a potential which depends only on positions. We assume that H{sup (1)}=T+V{sup (1)} and H{sup (2)}=T+V{sup (2)} (H{sup (1)}=T{sup (1)}+V and H{sup (2)}=T{sup (2)}+V) support both discrete eigenvalues E{sub {l_brace}{alpha}{r_brace}}{sup (1)} and E{sub {l_brace}{alpha}{r_brace}}{sup (2)}, where {l_brace}{alpha}{r_brace} represents a set of quantum numbers. We prove that, if V{sup (1){<=}}V{sup (2)} (T{sup (1){<=}}T{sup (2)}) for all position (momentum) variables, then the corresponding eigenvalues are ordered as E{sub {l_brace}{alpha}{r_brace}}{sup (1){<=}}E{sub {l_brace}{alpha}{r_brace}}{sup (2)}. Some analytical applications are given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

How many eigenvalues of a Gaussian random matrix are positive?

We study the probability distribution of the index N{sub +}, i.e., the number of positive eigenvalues of an NxN Gaussian random matrix. We show analytically that, for large N and large N{sub +} with the fraction 0{<=}c=N{sub +}/N{<=}1 of positive eigenvalues fixed, the index distribution P(N{sub +}=cN,N){approx}exp[-{beta}N{sup 2}{Phi}(c)] where {beta} is the Dyson index characterizing the Gaussian ensemble. The associated large deviation rate function {Phi}(c) is computed explicitly for all 0{<=}c{<=}1. It is independent of {beta} and displays a quadratic form modulated by a logarithmic singularity around c=1/2. As a consequence, the distribution of the index has a Gaussian form near the peak, but with a variance {Delta}(N) of index fluctuations growing as {Delta}(N){approx}lnN/{beta}{pi}{sup 2} for large N. For {beta}=2, this result is independently confirmed against an exact finite-N formula, yielding {Delta}(N)=lnN/2{pi}{sup 2}+C+O(N{sup -1}) for large N, where the constant C for even N has the nontrivial value C=({gamma}+1+3ln2)/2{pi}{sup 2}{approx_equal}0.185 248... and {gamma}=0.5772... is the Euler constant. We also determine for large N the probability that the interval [{zeta}{sub 1},{zeta}{sub 2}] is free of eigenvalues. Some of these results have been announced in a recent letter [Phys. Rev. Lett. 103, 220603 (2009)].

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalized Perturbation Theory-Free Sensitivity Analysis for Eigenvalue Problems

Generalized perturbation theory (GPT) has been recognized as the most computationally efficient approach for performing sensitivity analysis for models with many input parameters, which renders forward sensitivity analysis computationally overwhelming. In critical systems, GPT involves the solution of the adjoint form of the eigenvalue problem with a response-dependent fixed source. Although conceptually simple to implement, most neutronics codes that can solve the adjoint eigenvalue problem do not have a GPT capability unless envisioned during code development. We introduce in this manuscript a reduced-order modeling approach based on subspace methods that requires the solution of the fundamental adjoint equations but allows the generation of response sensitivities without the need to set up GPT equations, and that provides an estimate of the error resulting from the reduction. Moreover, the new approach solves the eigenvalue problem independently of the number or type of responses. This allows for an efficient computation of sensitivities when many responses are required. This paper introduces the theory and implementation details of the GPT-free approach and describes how the errors could be estimated as part of the analysis. The applicability is demonstrated by estimating the variations in the flux distribution everywhere in the phase space of a fast critical sphere and a high-temperature gas-cooled reactor prismatic lattice. The variations generated by the GPT-free approach are benchmarked to the exact variations generated by direct forward perturbations.

99 GENERAL AND MISCELLANEOUS↗

The virtual element method for eigenvalue problems with potential terms on polytopic meshes

In this work, we extend the conforming virtual element method (VEM) to the numerical resolution of eigenvalue problems with potential terms on a polytopic mesh. An important application is that of the Schrödinger equation with a pseudopotential term. This model is a fundamental element in the numerical resolution of more complex problems from the Density Functional Theory. The VEM is based on the construction of the discrete bilinear forms of the variational formulation through certain polynomial projection operators that are directly computable from the degrees of freedom. The method shows a great flexibility with respect to the meshes and provides a correct spectral approximation with optimal convergence rates. This point is discussed from both the theoretical and the numerical viewpoint. The performance of the method is numerically investigated by solving the quantum harmonic oscillator problem with the harmonic potential and a singular eigenvalue problem with zero potential for the first eigenvalues.

97 MATHEMATICS AND COMPUTING↗

The nonconforming virtual element method for eigenvalue problems

We analyse the nonconforming Virtual Element Method (VEM) for the approximation of elliptic eigenvalue problems. The nonconforming VEM allow to treat in the same formulation the two- and three-dimensional case.We present two possible formulations of the discrete problem, derived respectively by the nonstabilized and stabilized approximation of the L 2 -inner product, and we study the convergence properties of the corresponding discrete eigenvalue problems. The proposed schemes provide a correct approximation of the spectrum and we prove optimal-order error estimates for the eigenfunctions and the usual double order of convergence of the eigenvalues. Finally we show a large set of numerical tests supporting the theoretical results, including a comparison with the conforming Virtual Element choice.

97 MATHEMATICS AND COMPUTING↗

Eigenvalue analysis of uncertain ODE systems.

The Polynomial chaos expansion provides a means of representing any L2 random variable as a sum of polynomials that are orthogonal with respect to a chosen measure. Examples include the Hermite polynomials with Gaussian measure on the real line and the Legendre polynomials with uniform measure on an interval. Polynomial chaos can be used to reformulate an uncertain ODE system, using Galerkin projection, as a new, higher-dimensional, deterministic ODE system which describes the evolution of each mode of the polynomial chaos expansion. It is of interest to explore the eigenstructure of the original and reformulated ODE systems by studying the eigenvalues and eigenvectors of their Jacobians. In this talk, we study the distribution of the eigenvalues of the two Jacobians. We outline in general the location of the eigenvalues of the new system with respect to those of the original system, and examine the effect of expansion order on this distribution.

99 GENERAL AND MISCELLANEOUS↗

Spectral Schur complement techniques for symmetric eigenvalue problems

This paper presents a domain decomposition-type method for solving real symmetric (Hermitian) eigenvalue problems in which we seek all eigenpairs in an interval [α; β] or a few eigenpairs next to a given real shift. Here, a Newton-based scheme is described whereby the problem is converted to one that deals with the interface nodes of the computational domain. This approach relies on the fact that the inner solves related to each local subdomain are relatively inexpensive. This Newton scheme exploits spectral Schur complements, and these lead to so-called eigenbranches, which are rational functions whose roots are eigenvalues of the original matrix. Theoretical and practical aspects of domain decomposition techniques for computing eigenvalues and eigenvectors are discussed. A parallel implementation is presented and its performance on distributed computing environments is illustrated by means of a few numerical examples.

parallel computing↗

Krylov subspace iteration for eigenvalue response matrix calculations

Recent work has revisited the eigenvalue response matrix method as an approach for reactor core analyses. In its most straightforward form, the method consists of a two-level Eigen problem. An outer Picard iteration updates the k-eigenvalue, while the inner Eigen problem imposes current continuity between coarse meshes. In this paper, several Eigen solvers are evaluated for this inner problem, using several 2-D diffusion benchmarks as test cases. The results indicate both the explicitly-restarted Arnoldi and the Krylov-Schur methods are up to an order of magnitude more efficient than power iteration. This increased efficiency makes the nested eigenvalue formulation more effective than the ILU-preconditioned Newton-Krylov formulation previously studied. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Determining importance weighting functions for Contributon theory eigenvalue sensitivity coefficient methodologies

This study introduced two new approaches for calculating the F*(r) importance weighting function for Contributon and CLUTCH eigenvalue sensitivity coefficient calculations, and compared them in terms of accuracy and applicability. The necessary levels of F*(r) mesh refinement and mesh convergence for obtaining accurate eigenvalue sensitivity coefficients were determined for two preliminary problems through two parametric studies, and the results of these studies suggest that a sufficiently accurate F*(r) mesh for calculating eigenvalue sensitivity coefficients can be obtained for these problems with only a small increase in problem runtime. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Monte Carlo neutron transport code for eigenvalue calculations on a dual-GPU system and CUDA environment

Monte Carlo (MC) method is able to accurately calculate eigenvalues in reactor analysis. Its lengthy computation time can be reduced by general-purpose computing on Graphics Processing Units (GPU), one of the latest parallel computing techniques under development. The method of porting a regular transport code to GPU is usually very straightforward due to the 'embarrassingly parallel' nature of MC code. However, the situation becomes different for eigenvalue calculation in that it will be performed on a generation-by-generation basis and the thread coordination should be explicitly taken care of. This paper presents our effort to develop such a GPU-based MC code in Compute Unified Device Architecture (CUDA) environment. The code is able to perform eigenvalue calculation under simple geometries on a multi-GPU system. The specifics of algorithm design, including thread organization and memory management were described in detail. The original CPU version of the code was tested on an Intel Xeon X5660 2.8 GHz CPU, and the adapted GPU version was tested on NVIDIA Tesla M2090 GPUs. Double-precision floating point format was used throughout the calculation. The result showed that a speedup of 7.0 and 33.3 were obtained for a bare spherical core and a binary slab system respectively. The speedup factor was further increased by a factor of {approx}2 on a dual GPU system. The upper limit of device-level parallelism was analyzed, and a possible method to enhance the thread-level parallelism was proposed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Analytic Sensitivity Coefficients for General Multigroup Infinite Medium k-Eigenvalue Problems

The general multigroup infinite medium k-eigenvalue neutron transport equation is used to derive analytic expressions for the infinite medium k-eigenvalue, the scalar neutron flux and adjoint, and the sensitivity of $k$ ∞ to perturbations in the multigroup nuclear data of a single species isotropic elastic scattering material. In the appendix, we present the multigroup nuclear data for U-235 and U-238 along with the corresponding k-eigenvalue, flux, adjoint, and sensitivity profiles, which include the sensitivity of $k$ ∞ to the total, fission, capture, and scattering macroscopic cross sections as well as to the group-to-group scattering cross section matrix, group neutron production, and the unconstrained and constrained fission neutron energy distribution.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Analytic Sensitivity Coefficients for General Multigroup Infinite Medium k-Eigenvalue Problems

This work presents a general set of equations that can be used to rapidly generate new benchmarks to verify nuclear data sensitivity calculations. The general multigroup infinite medium k-eigenvalue neutron transport equation is used to derive analytic expressions for the infinite medium k-eigenvalue, the scalar neutron flux and adjoint flux, and the sensitivity of k∞ to perturbations in the multigroup nuclear data of a single species, isotropic and elastic scattering, material. The multigroup nuclear data for U-235 and U-238 is presented along with their corresponding k-eigenvalues, forward flux, adjoint flux, and sensitivity profiles, which include the sensitivity of k∞ to the total, fission, capture, and scattering macroscopic cross sections as well as to the group-to-group scattering cross section matrix, group-wise fission neutron production, and the unconstrained and constrained fission neutron energy distribution.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗