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

Consistent spatial expansion functions on hexagonal surfaces for use in radiation transport methods

Some of the radiation transport solvers that are based on expansion function methods in hexagonal geometry generally use projection techniques that transform the spatial dependence of the angular flux in hexagonal geometry to Cartesian geometry by mapping and then expanding in terms of expansion functions (e.g., Legendre polynomials). However, this approach usually requires a relatively higherorder expansion in space for accurate representation of the spatial distribution of the flux. To overcome this limitation, a set of consistent spatial expansion functions have been developed in hexagonal geometry in this paper. These functions satisfy the orthogonality condition on hexagonal surfaces and guarantee the conservation of currents after expansion regardless of the truncation order. The latter is an important property for preservation of neutron balance. The new spatial expansion method has been implemented into the coarse mesh radiation transport (COMET) code and tested in both the single assembly and the full core Advanced High Temperature Reactor (AHTR) benchmark problems. The eigenvalues and assembly-averaged and stripe-wise fission density distributions predicted by the new method with 2nd order spatial expansion functions were found to exhibit similar accuracy as those computed by the current mapping method with 4th order spatial expansion functions. This indicates that the angular fluxes in AHTRs can be predominantly represented by a low order expansion if the new spatial expansion functions are used. As a result, to maintain the same accuracy, the computational efficiency of COMET is improved significantly (2–5 times) by using the new spatial expansion method.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
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 OSTI2017

Modal characteristics of structures considering dynamic soil-structure interaction effects

The modal characteristics of structures are usually computed disregarding any interaction with the soil. Here, a finite element-perfectly matched layers model is presented to compute the modal characteristics of 2D and 3D coupled soil-structure systems while taking fully into account dynamic soil-structure interaction. The methodology can facilitate the interpretation of experimentally identified modal characteristics by assessing the importance of dynamic soil-structure interaction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

A Robust and Efficient Implementation of LOBPCG

Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) is widely used to compute eigenvalues of large sparse symmetric matrices. The algorithm can suffer from numerical instability if it is not implemented with care. This is especially problematic when the number of eigenpairs to be computed is relatively large. In this paper we propose an improved basis selection strategy based on earlier work by Hetmaniuk and Lehoucq as well as a robust convergence criterion which is backward stable to enhance the robustness. Here, we also suggest several algorithmic optimizations that improve performance of practical LOBPCG implementations. Numerical examples confirm that our approach consistently and significantly outperforms previous competing approaches in both stability and speed.

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 OSTI2018

Steady-State Thermal-Hydraulic Analysis and Bowing Reactivity Evaluation Methods Based on Neutron and Gamma Transport Calculations

With the advancement of computer technology, the variational nodal transport code VARIANT is now routinely used for sodium-cooled fast reactor (SFR) design analysis. In particular, VARIANT transport calculations are usually performed for whole core neutronics analyses and for fuel cycle analyses with REBUS-3. However, the steady-state thermal hydraulics analysis with the SE2-ANL coed and the assembly bowing reactivity calculation with the structural analysis with the NUBOW-3D code are still performed with the DIF3D finite difference diffusion theory code. Furthermore, the DIF3D diffusion calculation for these applications is performed with only six triangular meshes per hexagonal assembly, and the SE2-ANL code determines the pin power distributions approximately by assuming that the power distribution within an assembly is separable in the radial and axial directions. In order to overcome the limitations and to improve the accuracy of the existing methods, it was proposed to develop the relevant computational methods based on the transport calculations with the VARIANT and PROTEUS-SN codes. The objectives of this study are to develop a new heating calculation method based on the coupled neutron and gamma transport calculations with VARIANT, to implement the new heating calculation method into the SE2-ANL steady-state thermal-hydraulics analysis code with improved numerical algorithms and additional capabilities for automatic flow allocation calculations, and to develop a method to calculate bowing reactivity coefficients based on the VARIANT core solutions and the PROTEUS-SN assembly solutions, which can be used in NUBOW-3D calculations. A new, coupled neutron and gamma heating calculation procedure has been developed based on VARIANT transport calculations. In the new heating calculation procedure, the neutron flux distribution is first determined by solving an eigenvalue transport problem using the VARIANT transport code. Using the calculated neutron flux, the intra-nodal gamma source distributions are calculated to be consistent with the neutron flux distribution with the GAMSOR code. For this, the GAMSOR code has been updated to generate the intra-nodal gamma source distributions in the form of the VARSRC dataset of VARIANT. With this gamma source distribution, the gamma flux distribution is determined by solving a fixed source gamma transport problem using VARIANT again. With the neutron and gamma flux distributions, the heat generation rates are evaluated at individual fuel pins and assembly duct walls, without assuming separable axial and radial profiles for the intra-assembly power distribution.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
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 OSTI2017

Distributed Estimation of All the Eigenvalues and Eigenvectors of Matrices Associated With Strongly Connected Digraphs

This letter considers the problem of estimating all the eigenvalues and eigenvectors of an irreducible matrix, corresponding to a strongly connected digraph, in the absence of knowledge on the global network topology. To this end, in this work we propose a unified distributed strategy performed by each node in the network and relies only on the local information. The key idea is to transform the nonlinear problem of computing both the eigenvalues and eigenvectors of an irreducible matrix into a linear one. Specifically, we first transform distributively the irreducible matrix into a nonsingular irreducible matrix. Each node in the network then estimates in a distributed fashion the inverse of the nonsingular matrix by solving a set of linear equations based on a consensus-type algorithm. The eigenvalues and the corresponding eigenvectors are finally computed by exploiting the relations between the eigenvalues and eigenvectors of both the inverse and the original irreducible matrices. A numerical example is provided to demonstrate the effectiveness of the proposed distributed strategy.

14 SOLAR ENERGY↗
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 OSTI2017

Stability analysis of nonlinear two-grid method for multigroup neutron diffusion problems

We present theoretical analysis of a nonlinear acceleration method for solving multigroup neutron diffusion problems. This method is formulated with two energy grids that are defined by (i) fine-energy groups structure and (ii) coarse grid with just a single energy group. The coarse-grid equations are derived by averaging of the multigroup diffusion equations over energy. The method uses a nonlinear prolongation operator. We perform stability analysis of iteration algorithms for inhomogeneous (fixed-source) and eigenvalue neutron diffusion problems. To apply Fourier analysis the equations of the method are linearized about solutions of infinite-medium problems. The developed analysis enables us to predict convergence properties of this two-grid method in different types of problems. Numerical results of problems in 2D Cartesian geometry are presented to confirm theoretical predictions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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↗