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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 235 records · Page 13

All sources NASA NTRS DOE OSTI

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 OSTI2016

Stability of stagnation via an expanding accretion shock wave

Stagnation of a cold plasma streaming to the center or axis of symmetry via an expanding accretion shock wave is ubiquitous in inertial confinement fusion (ICF) and high-energy-density plasma physics, the examples ranging from plasma flows in x-ray-generating Z pinches [Maron et al., Phys. Rev. Lett. 111, 035001 (2013)] to the experiments in support of the recently suggested concept of impact ignition in ICF [Azechi et al., Phys. Rev. Lett. 102, 235002 (2009); Murakami et al., Nucl. Fusion 54, 054007 (2014)]. Some experimental evidence indicates that stagnation via an expanding shock wave is stable, but its stability has never been studied theoretically. We present such analysis for the stagnation that does not involve a rarefaction wave behind the expanding shock front and is described by the classic ideal-gas Noh solution in spherical and cylindrical geometry. In either case, the stagnated flow has been demonstrated to be stable, initial perturbations exhibiting a power-law, oscillatory or monotonic, decay with time for all the eigenmodes. This conclusion has been supported by our simulations done both on a Cartesian grid and on a curvilinear grid in spherical coordinates. Dispersion equation determining the eigenvalues of the problem and explicit formulas for the eigenfunction profiles corresponding to these eigenvalues are presented, making it possible to use the theory for hydrocode verification in two and three dimensions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

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↗

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 OSTI2018

Layer potential approach for fast eigenvalue characterization of the Helmholtz equation with mixed boundary conditions

Our goal is to propose an efficient approach to characterize the eigenvalues and eigenfunctions of the Helmholtz equation with mixed (Dirichlet and Neumann) boundary conditions. Our approach is based on layer potentials. We extend the eigenvalue characterization known for Neumann boundary conditions to the case of mixed boundary conditions. The problem is motivated by the need of such methods for real-time wave-field shaping by electronically tunable surfaces.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

Using the MCNP Taylor Series Perturbation Feature (Efficiently) for Shielding Problems

The Taylor series or differential operator perturbation feature was introduced into MCNP in version 4B in the mid-1990's. The perturbation feature has been shown to be unreliable for estimating perturbations in eigenvalue (k{sub eff}) problems. However, for fixed-source (shielding) problems, the perturbation feature can be extremely accurate and deserves to be more widely used. The Taylor series perturbation feature is invoked with the PERT card. In publications until now, a separate MCNP PERT card was used for each perturbed point in a parameter study. In fact, the MCNP manual recommends two PERT cards for each perturbed parameter so that the first- and second-order Taylor terms can be examined independently. The MCNP manual says that 'each perturbation increases running time by 10%- 20%'. Limiting the number of PERT cards is therefore desirable. This paper shows how to compute the two coefficients of a two-term Taylor expansion using only two PERT cards. These coefficients can be used to estimate the perturbed response for any point in a parameter study. The statistical uncertainty can be well estimated from these two PERT cards; it can be computed exactly using three more PERT cards.

42 ENGINEERING↗

DOE OSTI2016

An assessment of coupling algorithms for nuclear reactor core physics simulations

This paper evaluates the performance of multiphysics coupling algorithms applied to a light water nuclear reactor core simulation. The simulation couples the k-eigenvalue form of the neutron transport equation with heat conduction and subchannel flow equations. We compare Picard iteration (block Gauss–Seidel) to Anderson acceleration and multiple variants of preconditioned Jacobian-free Newton–Krylov (JFNK). The performance of the methods are evaluated over a range of energy group structures and core power levels. A novel physics-based approximation to a Jacobian-vector product has been developed to mitigate the impact of expensive on-line cross section processing steps. Numerical simulations demonstrating the efficiency of JFNK and Anderson acceleration relative to standard Picard iteration are performed on a 3D model of a nuclear fuel assembly. Both criticality (k-eigenvalue) and critical boron search problems are considered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2016

Ultra-fast computation of electronic spectra for large systems by tight-binding based simplified Tamm-Dancoff approximation (sTDA-xTB)

The computational bottleneck of the extremely fast simplified Tamm-Dancoff approximated (sTDA) time-dependent density functional theory procedure [S. Grimme, J. Chem. Phys. 138, 244104 (2013)] for the computation of electronic spectra for large systems is the determination of the ground state Kohn-Sham orbitals and eigenvalues. This limits such treatments to single structures with a few hundred atoms and hence, e.g., sampling along molecular dynamics trajectories for flexible systems or the calculation of chromophore aggregates is often not possible. The aim of this work is to solve this problem by a specifically designed semi-empirical tight binding (TB) procedure similar to the well established self-consistent-charge density functional TB scheme. The new special purpose method provides orbitals and orbital energies of hybrid density functional character for a subsequent and basically unmodified sTDA procedure. Compared to many previous semi-empirical excited state methods, an advantage of the ansatz is that a general eigenvalue problem in a non-orthogonal, extended atomic orbital basis is solved and therefore correct occupied/virtual orbital energy splittings as well as Rydberg levels are obtained. A key idea for the success of the new model is that the determination of atomic charges (describing an effective electron-electron interaction) and the one-particle spectrum is decoupled and treated by two differently parametrized Hamiltonians/basis sets. The three-diagonalization-step composite procedure can routinely compute broad range electronic spectra (0-8 eV) within minutes of computation time for systems composed of 500-1000 atoms with an accuracy typical of standard time-dependent density functional theory (0.3-0.5 eV average error). An easily extendable parametrization based on coupled-cluster and density functional computed reference data for the elements H–Zn including transition metals is described. The accuracy of the method termed sTDA-xTB is first benchmarked for vertical excitation energies of open- and closed-shell systems in comparison to other semi-empirical methods and applied to exemplary problems in electronic spectroscopy. As side products of the development, a robust and efficient valence electron TB method for the accurate determination of atomic charges as well as a more accurate calculation scheme of dipole rotatory strengths within the Tamm-Dancoff approximation is proposed.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2018

On nonlinear inexact Uzawa algorithms for stabilized saddle point problems

In this paper, the nonlinear inexact Uzawa (NIU) methods for saddle point problems are studied. A further improved convergence result of the NIU algorithm for stabilized saddle point problems is presented, which results in much smaller convergence factor. This result can also be viewed as a generalization of some previous work for classical saddle point problems. Based on this result, we generalize some adaptive versions of the NIU algorithm with variable iteration parameters for classical saddle point problems to solve stabilized saddle point problems. Convergence analyses of these algorithms are presented. It shows that they converge under similar conditions as those in classical cases, which are more practical and without estimates on the extreme eigenvalues of the involved preconditioned systems. Numerical experiments are given to demonstrate the effectiveness of these algorithms over some original NIU algorithms.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Calculating Time Eigenvalues of the Neutron Transport Equation with Dynamic Mode Decomposition

A novel method to compute time eigenvalues of neutron transport problems is presented based on solutions to the time-dependent transport equation. Using these solutions, we use the dynamic mode decomposition to form an approximate transport operator. This approximate operator has eigenvalues that are mathematically related to the time eigenvalues of the neutron transport equation. This approach works for systems of any level of criticality and does not require the user to have estimates for the eigenvalues. Numerical results are presented for homogeneous and heterogeneous media. The numerical results indicate that the method finds the eigenvalues that contribute the most to the change in the solution over a given time range, and the eigenvalue with the largest real part is not necessarily important to the system evolution at short and intermediate times.

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↗