Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “eigenvalue problems”

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

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↗
DOE OSTI2017

Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems

Here, we describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the “checkerboard” decomposition of the Hamiltonian matrix for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2016

Analytic Solution of the Electromagnetic Eigenvalues Problem in a Cylindrical Resonator

Resonant accelerating cavities are key components in modern particles accelerating facilities. These take advantage of electromagnetic fields resonating at microwave frequencies to accelerate charged particles. Particles gain finite energy at each passage through a cavity if in phase with the resonating field, reaching energies even of the order of $TeV$ when a cascade of accelerating resonators are present. In order to understand how a resonant accelerating cavity transfers energy to charged particles, it is important to determine how the electromagnetic modes are exited into such resonators. In this paper we present a complete analytical calculation of the resonating fields for a simple cylindrical-shaped cavity.

43 PARTICLE ACCELERATORS↗
DOE OSTI2017

Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

We present two efficient iterative algorithms for solving the linear response eigen- value problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into a product eigenvalue problem that is self-adjoint with respect to a K-inner product. This product eigenvalue problem can be solved efficiently by a modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-inner product. The solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. However, the other component of the eigenvector can be easily recovered in a postprocessing procedure. Therefore, the algorithms we present here are more efficient than existing algorithms that try to approximate both components of the eigenvectors simultaneously. The efficiency of the new algorithms is demonstrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Multigrid Algorithms with Projection and Prolongation over Elements of the Phase Space for K-Eigenvalue Transport Problems

This paper describes new multilevel acceleration methods for solving the multigroup neu- tron transport eigenvalue problems. These multilevel algorithms use different projection and prolongation operators in the phase space. The Nonlinear Diffusion Acceleration (NDA) method with multiple grids in energy is formulated with the prolongation oper- ator based on multiplication iterative correction and linear-in-energy mapping. Another multilevel NDA method uses the projection operator with coarsening in energy between the high-order transport and low-order NDA equations. The third algorithm is formu- lated with the partial-current based CMFD low-order equations and applies projection operators in space and energy. The numerical results are presented.

Cornejo, Luke↗