Search NASA⌕ Search

SEARCH · Search NASA

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

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

Scalable implementation of polynomial filtering for density functional theory calculation in PARSEC

In this work, we present an efficient implementation of polynomial filtering methods in PARSEC, a real-space pseudopotential based Kohn–Sham density functional theory solver. The implementation described here improves upon a Chebyshev-filtered subspace iteration algorithm used in the previous version of PARSEC. We present a hybrid polynomial filtering scheme that combines Chebyshev-filtered subspace iteration and a spectrum slicing method that partitions the spectrum into several spectral slices and uses bandpass-filtered subspace iteration to compute approximate eigenpairs within each interior slice simultaneously. We describe a procedure to partition a spectrum and construct polynomial filters. We also discuss a number of practical issues such as the use of appropriate data layouts for carrying out the computation on a two-dimensional process grid and how to achieve good load balance by allocating an appropriate number of process groups to each spectral slice. Numerical examples are presented to demonstrate the effectiveness of the hybrid polynomial filtering method as well as the superior parallel scalability of spectrum slicing in comparison to that of Chebyshev-filtered subspace iteration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A parallel strategy for density functional theory computations on accelerated nodes

Using the Löwdin orthonormalization of tall-skinny matrices as a proxy-app for wavefunction-based Density Functional Theory solvers, we investigate a distributed memory parallel strategy focusing on Graphics Processing Unit (GPU)-accelerated nodes as available on some of the top ranked supercomputers at the present time. Here we present numerical results in the strong limit regime, as it is particularly relevant for First-Principles Molecular Dynamics. We also examine how matrix product-based iterative solvers provide a competitive alternative to dense eigensolvers on GPUs, allowing to push the strong scaling limit of these computations to a larger number of distributed tasks. Our strategy, which relies on replicated Gram matrices and efficient collective communications using the NCCL library, leads to a time-to-solution under 0.5 s for the Löwdin orthonormalization of a tall-skinny matrix of 3000 columns on Summit at Oak Ridge Leadership Facility (OLCF). Given the similarity in computational operations between one iteration of a DFT solver and this proxy-app, this shows the possibility of solving accurately the DFT equations well under a minute for 3000 electronic wave functions, and thus perform First-Principles molecular dynamics of physical systems much larger than traditionally solved on CPU systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

VERA BWR progression problems

During the first phase of the Consortium for Advanced Simulation of Light Water Reactors (CASL) program, the Virtual Environment for Reactor Applications (VERA) was developed with a focus on capabilities for high-fidelity, multiphysics simulation of pressurized water reactors (PWRs). During this development effort, a set of progression problems was created ranging from smaller pin cell calculations to larger 3D full-core calculations. These progression problems helped to guide the development of the software and served as benchmarks against which to test VERA. Since 2019, efforts have been made to extend the capabilities of VERA to model boiling water reactors (BWRs). Because BWR simulations come with many unique challenges, a set of BWR progression problems was developed to aid in this new effort. The BWR progression problems range from 2D lattice calculations to 3D mini-core problems, and reference neutronic solutions were computed using continuous-energy Monte Carlo codes. MPACT, one of the neutronics code in VERA, was benchmarked using the BWR progression problems. The code is capable of computing solutions to all problems. The eigenvalues computed by MPACT agree well with the Monte Carlo reference solutions. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2025

Bounds on spectral gaps of Hyperbolic spin surfaces

We describe a method for constraining Laplacian and Dirac spectra of two dimensional compact orientable hyperbolic spin manifolds and orbifolds. The key ingredient is an infinite family of identities satisfied by the spectra. These spectral identities follow from the consistency between 1) the spectral decomposition of functions on the spin bundle into irreducible representations of SL(2,R) and 2) associativity of pointwise multiplication of functions. Applying semidefinite programming methods to our identities produces rigorous upper bounds on the Laplacian spectral gap as well as on the Dirac spectral gap conditioned on the former. In several examples, our bounds are nearly sharp; a numerical algorithm based on the Selberg trace formula shows that the [0;3,3,5] orbifold, a particular surface with signature [1;3], and the Bolza surface nearly saturate the bounds at genus 0, 1 and 2 respectively. Under additional assumptions on the number of harmonic spinors carried by the spin-surface, we obtain more restrictive bounds on the Laplacian spectral gap. In particular, these bounds apply to hyperelliptic surfaces. We also determine the set of Laplacian spectral gaps attained by all compact orientable two-dimensional hyperbolic spin orbifolds. We show that this set is upper bounded by 12.13798; this bound is nearly saturated by the [0;3,3,5] orbifold, whose first non-zero Laplacian eigenvalue is λ^(0)_1 ≈ 12.13623.

Spectral theory↗
DOE OSTI2022

A low-rank power iteration scheme for neutron transport criticality problems

Computing effective eigenvalues for neutron transport often requires a fine numerical resolution. Here, the main challenge of such computations is the high memory effort of classical solvers, which limits the accuracy of chosen discretizations. In this work, we derive a method for the computation of effective eigenvalues when the underlying solution has a low-rank structure. This is accomplished by utilizing dynamical low-rank approximation (DLRA), which is an efficient strategy to derive time evolution equations for low-rank solution representations. The main idea is to interpret the iterates of the classical inverse power iteration as pseudo-time steps and apply the DLRA concepts in this framework. In our numerical experiment, we demonstrate that our method significantly reduces memory requirements while achieving the desired accuracy. Analytic investigations show that the proposed iteration scheme inherits the convergence speed of the inverse power iteration, at least for a simplified setting.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method

Quantum phase estimation is one of the most powerful quantum primitives. This work proposes a new approach for the problem of multiple eigenvalue estimation: Quantum Multiple Eigenvalue Gaussian filtered Search (QMEGS). QMEGS leverages the Hadamard test circuit structure and only requires simple classical postprocessing. QMEGS is the first algorithm to simultaneously satisfy the following two properties: (1) It can achieve the Heisenberg-limited scaling without relying on any spectral gap assumption. (2) With a positive energy gap and additional assumptions on the initial state, QMEGS can estimate all dominant eigenvalues to ϵ accuracy utilizing a significantly reduced circuit depth compared to the standard quantum phase estimation algorithm. In the most favorable scenario, the maximal runtime can be reduced to as low as log(1/ϵ). This implies that QMEGS serves as an efficient and versatile approach, achieving the best-known results for both gapped and gapless systems. Numerical results validate the efficiency of our proposed algorithm in various regimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

An Analytic Benchmark for the Solution to the Isotopic Fission Spectrum Mixture Problem

In neutron transport calculations, it is common to specify material compositions in terms of constituent isotopes. Material compositions may be described by isotope number densities and associated microscopic cross sections. For general reaction cross sections, the macroscopic cross sections of a composition are simply the summation of the sum of the products of isotope number densities and microscopic cross sections. A notable exception is the mixture of the neutron fission spectrum in fissile material. To demonstrate proper and improper mixture of the neutron fission spectrum, a zero-dimensional test problem is developed. Using the test problem, it is demonstrated that the improper mixing of the fission spectrum results in an eigenvalue error of approximately 65 pcm. Though this may seem small, any error in such a simple calculation is unacceptable. In similar infinite-homogeneous test problems, eigenvalue errors of more than 300 pcm have been observed. It is also shown that the error due to fission spectrum mixing can be exaggerated for computer program verification purposes. It is concluded that the proper mixture of the neutron fission spectrum is essential for accurate neutron transport simulations. The effect of improper neutron fission spectrum mixture is demonstrated and quantified and this test problem may be used for verification purposes in the future.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Stochastic gradient descent for optimization for nuclear systems

The use of gradient descent methods for optimizing k-eigenvalue nuclear systems has been shown to be useful in the past, but the use of k-eigenvalue gradients have proved computationally challenging due to their stochastic nature. ADAM is a gradient descent method that accounts for gradients with a stochastic nature. This analysis uses challenge problems constructed to verify if ADAM is a suitable tool to optimize k-eigenvalue nuclear systems. ADAM is able to successfully optimize nuclear systems using the gradients of k-eigenvalue problems despite their stochastic nature and uncertainty. Furthermore, it is clearly demonstrated that low-compute time, high-variance estimates of the gradient lead to better performance in the optimization challenge problems tested here.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Controlled precision QUBO-based algorithm to compute eigenvectors of symmetric matrices

We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix which is based on solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of symmetric matrices; It can compute the eigenvector/eigenvalue pair to essentially any arbitrary precision, and with minor modifications, can also solve the generalized eigenvalue problem. Performance is analyzed on small random matrices and selected larger matrices from practical applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Stability of expanding accretion shocks for an arbitrary equation of state

We present a theoretical stability analysis for an expanding accretion shock that does not involve a rarefaction wave behind it. The dispersion equation that determines the eigenvalues of the problem and the explicit formulae for the corresponding eigenfunction profiles are presented for an arbitrary equation of state and finite-strength shocks. For spherically and cylindrically expanding steady shock waves, we demonstrate the possibility of instability in a literal sense, a power-law growth of shock-front perturbations with time, in the range of $h_c< h<1+2 {\mathcal {M}}_2$ , where $h$ is the D'yakov-Kontorovich parameter, $h_c$ is its critical value corresponding to the onset of the instability and ${\mathcal {M}}_2$ is the downstream Mach number. Shock divergence is a stabilizing factor and, therefore, instability is found for high angular mode numbers. As the parameter $h$ increases from $h_c$ to $1+2 {\mathcal {M}}_2$ , the instability power index grows from zero to infinity. This result contrasts with the classic theory applicable to planar isolated shocks, which predicts spontaneous acoustic emission associated with constant-amplitude oscillations of the perturbed shock in the range $h_c< h<1+2 {\mathcal {M}}_2$ . Examples are given for three different equations of state: ideal gas, van der Waals gas and three-terms constitutive equation for simple metals.

Huete, César (ORCID:0000000232278520)↗
DOE OSTI2021

Multilevel-in-Space-and-Energy CMFD in VERA

For full-core modeling in the Virtual Environment for Reactor Analysis (VERA), the three-dimensional multigroup eigenvalue neutron transport problem is solved by MPACT. To improve the efficiency of MPACT, advancements have been made in the transport accelerator. Multilevel-in-energy and multilevel-in-space coarse mesh finite difference (CMFD) solvers were developed to improve the efficiency of the CMFD accelerator. In this paper a new multilevel-in-space-and-energy CMFD solver is developed with coarsening in both space and energy on every level. Several different strategies are investigated for coarsening groups in energy. Modified V-cycle and multiple-cycle algorithms are evaluated for solving the multilevel equations. The performance of these solvers is compared for typical full-core reactor physics problems.

42 ENGINEERING↗
DOE OSTI2020

Comparison of Generation of Higher-Order Neutron Scattering Cross Sections

The generation of high-order neutron scattering cross sections consistent with high-fidelity simulations remains an area of active research. Popular options include generating cross sections from continuous energy Monte Carlo calculations or generating cross sections from a deterministic neutron transport calculation with high-fidelity tabulated cross sections. Both options present challenges. Monte Carlo simulations can naturally process continuous energy cross section data and allow for the general description of anisotropic neutron scattering given a scattering law. However, Monte Carlo simulations are inherently related to particle weighting and it has been suggested that this may be unacceptable for generating high-order neutron scattering cross sections. Deterministic neutron transport calculations can easily calculate high-order moments of the flux to appropriately calculate higher-order neutron scattering cross sections but are generally limited by discretization of space, energy, and angle. In this work, the trade-offs between generation of high-order neutron scattering cross sections via Monte Carlo and deterministic neutron transport methods are investigated. The methods implemented in the Monte Carlo computer program Serpent and the deterministic fast reactor neutron cross section generator MC2-3 are compared. Cross sections resulting from these methods are used in Rattlesnake, a deterministic neutron transport code developed by Idaho National Laboratory (INL), and results are compared to a reference continuous energy Monte Carlo calculation. Whereas previous work investigating the effects of anisotropic neutron scattering has focused on light water reactor (LWR) simulations, this work focuses on high-order neutron scattering cross sections as they relate to fast reactor simulations. To investigate the consequences of the Serpent and MC2-3 methodologies, a test problem is developed. The test problem is a one-dimensional geometry with fast reactor materials designed to demonstrate deep penetration and exacerbate the effects of high-order neutron scattering. Based on the results of the deep penetration test problem, it is concluded that P3 neutron scattering cross sections are sufficient to describe anisotropic scattering in fast reactor materials. Any neutron scattering of order higher than P3 offers negligible change in the eigenvalue of the test problem. Additionally, it is determined that the methodology as implemented in Serpent is applicable for generating high-order neutron scattering cross sections through at least P3 in fast reactor materials.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

OpenMC

OpenMC is an open source, community-developed framework for performing Monte Carlo particle transport calculations.It is capable of simulating neutron and photon transport below ~50 MeV and also includes a model for bremsstrahlung production of photons by electrons/positrons. Fixed source, k-eigenvalue, and subcritical multiplication problems can be solved. Problem geometries can be modeled either using constructive solid geometry or a CAD representation. A flexible and efficient tally system enables a wide variety of physical quantities to be tallied and analyzed. OpenMC can run in parallel using a hybrid MPI and OpenMP programming model and has been extensively tested on leadership class supercomputers. A built-in Bateman equation solver enables the modeling of material composition changes due to irradiation. One of the unique features of OpenMC is its rich, extensible Python and C/C++ programming interfaces that enable programming pre- and post-processing, multigroup cross section generation, workflow automation, multiphysics coupling, and the visualization of geometry and tally results. In addition to the core Monte Carlo transport solver and associated APIs, OpenMC includes a Python-based nuclear data interface that enables power users to inspect, modify,and perform various types of nuclear data processing on ENDF, ACE, and OpenMC¿s native HDF5 files

ROMANO, PaulK.↗
DOE OSTI2020

Impact of Radial Reflector Fidelity on Neutronics and Vessel Fluence Simulations

The Consortium for Advanced Simulation of Light Water Reactors is developing the Virtual Environment for Reactor Applications (VERA), and the MPACT code, which is the primary deterministic neutron transport solver in VERA, provides sub-pin level flux and power distributions as part of full-scale cycle depletion and analysis. In such calculations, an important aspect is the radial reflector treatment. To improve the fidelity of the radial reflector treatment, MPACT was extended to approximate the modeling of the reactor’s structural components such as the core shroud, barrel, neutron pads, and vessel. This work explores several modeling configurations with varying levels of fidelity and computational burden and assesses the importance of modeling fidelity on the eigenvalue and pin power distribution. Two two-dimensional (2-D) problems were analyzed to assess the impact on eigenvalue and pin power distributions with low-fidelity, coarse square cell reflector representations: (1) a Watts Bar Nuclear Plant Unit 1 (WBN1) quarter-core slice with depletion and (2) an AP1000 quarter-core slice. In this work, the analyses showed that the effect on eigenvalue is fairly small, but the effect on pin power is more pronounced, especially locally in the assemblies closest to the periphery, where the maximum pin power difference is nearly 3.5% in the AP1000 case. Two additional 2-D problems were used to assess the comparison between the low-fidelity coarse square cell treatment and a high-fidelity geometric representation that uses subpin material specification: (1) the same WBN1 quarter-core slice and (2) a representative model of the NuScale small modular reactor (SMR), which features a solid reflector design with moderator holes. These results demonstrate that even a coarse, low-fidelity representation adequately captures the necessary simulation characteristics. Last, these capabilities were applied to the 2-D WBN1 quarter-core depletion to assess the impact on vessel fluence using VeraShift. From adjoint calculations, pins along the periphery were observed to be of highest importance for fluence calculation, so the impact of the reflector representation in MPACT could theoretically substantially affect the predicted result. However, it was observed that the change in pin powers along the periphery minimally impacts the maximum vessel fluence with a difference within the statistical uncertainty but provides terrific insight on the sensitivity of the peripheral pins.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Relativistic levels of mesic atoms

We revisit the derivation of the covariant two-body scalar-fermion equation with a Coulomb interaction, presented in a previous paper. We show that it can be given the formal aspect of a Dirac equation, but for the fact that the eigenvalue is also contained in one of the coefficients and thus it is not linearly included. The discussion of the boundary value problem is therefore different, although some properties of the Dirac equation can be recovered in an approximation bringing back to the concept of reduced mass. We discuss a mixed analytic-numerical method of solution which allows to obtain very accurate results and we calculate the lowest levels, states and QED corrections for pionic and kaonic atoms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Sampling electronic structure quadratic unconstrained binary optimization problems (QUBOs) with Ocean and Mukai solvers

The most advanced D-Wave Advantage quantum annealer has 5000+ qubits, however, every qubit is connected to a small number of neighbors. As such, implementation of a fully-connected graph results in an order of magnitude reduction in qubit count. To compensate for the reduced number of qubits, one has to rely on special heuristic software such as qbsolv, the purpose of which is to decompose a large quadratic unconstrained binary optimization (QUBO) problem into smaller pieces that fit onto a quantum annealer. In this work, we compare the performance of the open-source qbsolv which is a part of the D-Wave Ocean tools and a new Mukai QUBO solver from Quantum Computing Inc. (QCI). The comparison is done for solving the electronic structure problem and is implemented in a classical mode (Tabu search techniques). The Quantum Annealer Eigensolver is used to map the electronic structure eigenvalue-eigenvector equation to a QUBO problem, solvable on a D-Wave annealer. We find that the Mukai QUBO solver outperforms the Ocean qbsolv with one to two orders of magnitude more accurate energies for all calculations done in the present work, both the ground and excited state calculations. This work stimulates the further development of software to assist in the utilization of modern quantum annealers.

97 MATHEMATICS AND COMPUTING↗