Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvalues”

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 379 records · Page 21

A greedy algorithm for computing eigenvalues of a symmetric matrix with localized eigenvectors

Here, we present a greedy algorithm for computing selected eigenpairs of a large sparse matrix $H$ that can exploit localization features of the eigenvector. When the eigenvector to be computed is localized, meaning only a small number of its components have large magnitudes, the proposed algorithm identifies the location of these components in a greedy manner, and obtains approximations to the desired eigenpairs of $H$ by computing eigenpairs of a submatrix extracted from the corresponding rows and columns of $H$. Even when the eigenvector is not completely localized, the approximate eigenvectors obtained by the greedy algorithm can be used as good starting guesses to accelerate the convergence of an iterative eigensolver applied to $H$. We discuss a few possibilities for selecting important rows and columns of $H$ and techniques for constructing good initial guesses for an iterative eigensolver using the approximate eigenvectors returned from the greedy algorithm. We demonstrate the effectiveness of this approach with examples from nuclear quantum many-body calculations and many-body localization studies of quantum spin chains.

97 MATHEMATICS AND COMPUTING↗

Minimising the error in eigenvalue calculations involving the Boltzmann transport equation using goal-based adaptivity on unstructured meshes

This article presents a method for goal-based anisotropic adaptive methods for the finite element method applied to the Boltzmann transport equation. The neutron multiplication factor, k{sub eff}, is used as the goal of the adaptive procedure. The anisotropic adaptive algorithm requires error measures for k{sub eff} with directional dependence. General error estimators are derived for any given functional of the flux and applied to k{sub eff} to acquire the driving force for the adaptive procedure. The error estimators require the solution of an appropriately formed dual equation. Forward and dual error indicators are calculated by weighting the Hessian of each solution with the dual and forward residual respectively. The Hessian is used as an approximation of the interpolation error in the solution which gives rise to the directional dependence. The two indicators are combined to form a single error metric that is used to adapt the finite element mesh. The residual is approximated using a novel technique arising from the sub-grid scale finite element discretisation. Two adaptive routes are demonstrated: (i) a single mesh is used to solve all energy groups, and (ii) a different mesh is used to solve each energy group. The second method aims to capture the benefit from representing the flux from each energy group on a specifically optimised mesh. The k{sub eff} goal-based adaptive method was applied to three examples which illustrate the superior accuracy in criticality problems that can be obtained.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Green’s functions and energy eigenvalues for delta-perturbed space-fractional quantum systems

Starting from the propagator, we introduced a time-ordered perturbation expansion and employed Wick rotation to obtain a general energy-dependent Green’s function expressions for space-fractional quantum systems with Dirac delta-function perturbation. We then obtained the Green’s functions and equations for the bound state energies for the space-fractional Schrödinger equation with single and double Dirac delta well potentials and the delta-perturbed infinite well.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Transitions in eigenvalue and wavefunction structure in (1+2)-body random matrix ensembles with spin

Finite interacting Fermi systems with a mean-field and a chaos generating two-body interaction are modeled by one plus two-body embedded Gaussian orthogonal ensemble of random matrices with spin degree of freedom [called EGOE(1+2)-s]. Numerical calculations are used to demonstrate that, as lambda, the strength of the interaction (measured in the units of the average spacing of the single-particle levels defining the mean-field), increases, generically there is Poisson to GOE transition in level fluctuations, Breit-Wigner to Gaussian transition in strength functions (also called local density of states) and also a duality region where information entropy will be the same in both the mean-field and interaction defined basis. Spin dependence of the transition points lambda{sub c}, lambda{sub F}, and lambda{sub d}, respectively, is described using the propagator for the spectral variances and the formula for the propagator is derived. We further establish that the duality region corresponds to a region of thermalization. For this purpose we compared the single-particle entropy defined by the occupancies of the single-particle orbitals with thermodynamic entropy and information entropy for various lambda values and they are very close to each other at lambda=lambda{sub d}.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

"K-Effective of the World" and Other Concerns for Monte Carlo Eigenvalue Calculations

Monte Carlo methods have been used to compute k eff and the fundamental model eigenfunction of critical systems since the 1950s. Despite the sophistication of today's Monte Carlo codes for representing realistic geometry and physics interactions, correct results can be obtained in criticality problems only if users pay attention to source convergence in the Monte Carlo iterations and to running a sufficient number of neutron histories to adequately sample all significant regions of the problem. Recommended best practices for criticality calculations are reviewed and applied to several practical problems for nuclear reactors and criticality safety, including the "K-effective of the World" problem. Numerical results illustrate the concerns about convergence and bias. The general conclusion is that with today's high-performance computers, improved understanding of the theory, new tools for diagnosing convergence (e.g., Shannon entropy of the fission distribution), and clear practical guidance for performing calculations, practitioners will have a greater degree of confidence than ever of obtaining correct results for Monte Carlo criticality calculations.

61 RADIATION PROTECTION AND DOSIMETRY↗

Using parallel banded linear system solvers in generalized eigenvalue problems

Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speedup is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.

DISTRIBUTED MEMORY MULTIPROCES↗

Under-Prediction of Localized Tally Uncertainties in Monte Carlo Eigenvalue Calculations

Modeling and simulation using Monte Carlo methods is widely used in nuclear reactor criticality benchmarking applications. However, obtaining good statistics not only takes a large amount of computational time, but it has been shown that localized tally uncertainties may be under-predicted by a factor of five or more in select cases. The primary components of this under-prediction include poor sampling due to improper source convergence and cycle-to-cycle correlations in the fission source. Additional components relate to the flux shape and the size of the tally cells. These issues must be understood and dealt with in order to support the practical use of modern Monte Carlo software packages.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

VARIANCE ESTIMATION IN DOMAIN DECOMPOSED MONTE CARLO EIGENVALUE CALCULATIONS

The number of tallies performed in a given Monte Carlo calculation is limited in most modern Monte Carlo codes by the amount of memory that can be allocated on a single processor. By using domain decomposition, the calculation is now limited by the total amount of memory available on all processors, allowing for significantly more tallies to be performed. However, decomposing the problem geometry introduces significant issues with the way tally statistics are conventionally calculated. In order to deal with the issue of calculating tally variances in domain decomposed environments for the Shift hybrid Monte Carlo code, this paper presents an alternative approach for reactor scenarios in which an assumption is made that once a particle leaves a domain, it does not reenter the domain. Particles that reenter the domain are instead treated as separate independent histories. This assumption introduces a bias that inevitably leads to under-prediction of the calculated variances for tallies within a few mean free paths of the domain boundaries. However, through the use of different decomposition strategies, primarily overlapping domains, the negative effects of such an assumption can be significantly reduced to within reasonable levels.

42 ENGINEERING↗

K-Eigenvalue sensitivities of secondary distributions of continuous-energy data

MCNP6 has the capability to produce energy-resolved sensitivity profiles for secondary distributions (fission {Chi} and scattering laws). Computing both unconstrained and constrained profiles are possible. Verification is performed with analytic test problems and a comparison to TSUNAMI-3D, and the comparisons show MCNP6 calculates correct or consistent results. Continuous-energy calculations are performed for three fast critical experiments: Jezebel, Flattop, and copper-reflected Zeus. The sensitivities to the secondary distributions (integrated over chosen energy ranges) are of similar magnitude to those of many of the cross sections, demonstrating the possibility that integral experiments are useful for assessing the fidelity of these data as well. (authors)

97 MATHEMATICS AND COMPUTING↗