Search NASA⌕ Search

SEARCH · Search NASA

Results for “Eigenvalue”

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 289 records · Page 16

Resonance self-shielding effects on Eigenvalue sensitivity

We present a quick and accurate way to compute the eigenvalue sensitivity coefficients in multigroup lattice cell calculations. We look at both the explicit and implicit sensitivities, the latter resulting from the resonance self-shielding process. A self-shielding model is presented, and we show how to obtain cross section sensitivities to a variation on a light isotope density. As an example, we look at how a perturbation on the hydrogen density affects the multigroup cross sections for resonant reactions such as U'capture and U'fission, in two uranium spheres with different enrichments. Explicit sensitivities are also computed, and we discuss the relative importance of the implicit sensitivities. (authors)

97 MATHEMATICS AND COMPUTING↗

Parallel algorithms for 2-D cylindrical transport equations of Eigenvalue problem

In this paper, aimed at the neutron transport equations of eigenvalue problem under 2-D cylindrical geometry on unstructured grid, the discrete scheme of Sn discrete ordinate and discontinuous finite is built, and the parallel computation for the scheme is realized on MPI systems. Numerical experiments indicate that the designed parallel algorithm can reach perfect speedup, it has good practicality and scalability. (authors)

97 MATHEMATICS AND COMPUTING↗

Discrete ordinate quadrature selection for reactor-based Eigenvalue problems

In this paper we analyze the effect of various quadrature sets on the eigenvalues of several reactor-based problems, including a two-dimensional (2D) fuel pin, a 2D lattice of fuel pins, and a three-dimensional (3D) reactor core problem. While many quadrature sets have been applied to neutral particle discrete ordinate transport calculations, the Level Symmetric (LS) and the Gauss-Chebyshev product (GC) sets are the most widely used in production-level reactor simulations. Other quadrature sets, such as Quadruple Range (QR) sets, have been shown to be more accurate in shielding applications. In this paper, we compare the LS, GC, QR, and the recently developed linear-discontinuous finite element (LDFE) sets, as well as give a brief overview of other proposed quadrature sets. We show that, for a given number of angles, the QR sets are more accurate than the LS and GC in all types of reactor problems analyzed (2D and 3D). We also show that the LDFE sets are more accurate than the LS and GC sets for these problems. We conclude that, for problems where tens to hundreds of quadrature points (directions) per octant are appropriate, QR sets should regularly be used because they have similar integration properties as the LS and GC sets, have no noticeable impact on the speed of convergence of the solution when compared with other quadrature sets, and yield more accurate results. We note that, for very high-order scattering problems, the QR sets exactly integrate fewer angular flux moments over the unit sphere than the GC sets. The effects of those inexact integrations have yet to be analyzed. We also note that the LDFE sets only exactly integrate the zeroth and first angular flux moments. Pin power comparisons and analyses are not included in this paper and are left for future work. (authors)

97 MATHEMATICS AND COMPUTING↗

Depletion GPT-free sensitivity analysis for reactor eigenvalue problems

This manuscript introduces a novel approach to solving depletion perturbation theory problems without the need to set up or solve the generalized perturbation theory (GPT) equations. The approach, hereinafter denoted generalized perturbation theory free (GPT-Free), constructs a reduced order model (ROM) using methods based in perturbation theory and computes response sensitivity profiles in a manner that is independent of the number or type of responses, allowing for an efficient computation of sensitivities when many responses are required. Moreover, the reduction error from using the ROM is quantified in the GPT-Free approach by means of a Wilks' order statistics error metric denoted the K-metric. Traditional GPT has been recognized as the most computationally efficient approach for performing sensitivity analyses of models with many input parameters, e.g. when forward sensitivity analyses are computationally intractable. However, most neutronics codes that can solve the fundamental (homogenous) adjoint eigenvalue problem do not have GPT capabilities unless envisioned during code development. The GPT-Free approach addresses this limitation by requiring only the ability to compute the fundamental adjoint. This manuscript demonstrates the GPT-Free approach for depletion reactor calculations performed in SCALE6 using the 7x7 UAM assembly model. A ROM is developed for the assembly over a time horizon of 990 days. The approach both calculates the reduction error over the lifetime of the simulation using the K-metric and benchmarks the obtained sensitivities using sample calculations. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A hybrid approach to the neutron transport K-eigenvalue problem using NDA-based algorithms

In order to provide more physically accurate solutions to the neutron transport equation it has become increasingly popular to use Monte Carlo simulation to model nuclear reactor dynamics. These Monte Carlo methods can be extremely expensive, so we turn to a class of methods known as hybrid methods, which combine known deterministic and stochastic techniques to solve the transport equation. In our work, we show that we can simulate the action of a transport sweep using a Monte Carlo simulation in order to solve the k-eigenvalue problem. We'll accelerate the solution using nonlinear diffusion acceleration (NDA) as in [1,2]. Our work extends the results in [1] to use Monte Carlo simulation as the high-order solver. (authors)

97 MATHEMATICS AND COMPUTING↗

Continuous-energy eigenvalue sensitivity coefficient calculations in TSUNAMI-3D

Two methods for calculating eigenvalue sensitivity coefficients in continuous-energy Monte Carlo applications were implemented in the KENO code within the SCALE code package. The methods were used to calculate sensitivity coefficients for several test problems and produced sensitivity coefficients that agreed well with both reference sensitivities and multigroup TSUNAMI-3D sensitivity coefficients. The newly developed CLUTCH method was observed to produce sensitivity coefficients with high figures of merit and a low memory footprint, and both continuous-energy sensitivity methods met or exceeded the accuracy of the multigroup TSUNAMI-3D calculations. (authors)

97 MATHEMATICS AND COMPUTING↗

Evaluation of vectorized Monte Carlo algorithms on GPUs for a neutron Eigenvalue problem

Conventional Monte Carlo (MC) methods for radiation transport computations are 'history-based', which means that one particle history at a time is tracked. Simulations based on such methods suffer from thread divergence on the graphics processing unit (GPU), which severely affects the performance of GPUs. To circumvent this limitation, event-based vectorized MC algorithms can be utilized. A versatile software test-bed, called ARCHER - Accelerated Radiation-transport Computations in Heterogeneous Environments - was used for this study. ARCHER facilitates the development and testing of a MC code based on the vectorized MC algorithm implemented on GPUs by using NVIDIA's Compute Unified Device Architecture (CUDA). The ARCHER{sub GPU} code was designed to solve a neutron eigenvalue problem and was tested on a NVIDIA Tesla M2090 Fermi card. We found that although the vectorized MC method significantly reduces the occurrence of divergent branching and enhances the warp execution efficiency, the overall simulation speed is ten times slower than the conventional history-based MC method on GPUs. By analyzing detailed GPU profiling information from ARCHER, we discovered that the main reason was the large amount of global memory transactions, causing severe memory access latency. Several possible solutions to alleviate the memory latency issue are discussed. (authors)

97 MATHEMATICS AND COMPUTING↗

Use of Criticality Eigenvalue Simulations for Subcritical Benchmark Evaluations

Subcritical multiplication experiments and simulations are important for a variety of applications including nonproliferation, safeguards, and criticality safety monitoring. Recently, subcritical experiments have been evaluated for inclusion in the International Criticality Safety Benchmark Evaluation Process (ICSBEP). In addition, new subcritical experiments have recently been designed. In these experiments, list-mode data (a list of each absorption in the neutron detector) is recorded and neutron noise analysis is used to determine the leakage multiplication (ML) of each configuration. One downside to the simulation of these types of experiments is that they are computationally expensive. This is because analog Monte Carlo with no variance reduction must be performed in order to maintain the time accuracy required in the measurement analysis. This work demonstrates that criticality eigenvalue simulations can be used to estimate sensitivities and uncertainties for three parameters: singles count rate (R{sub 1}), doubles count rate (R{sub 2}), and leakage multiplication (M{sub L}). This will provide a useful aid both in the design and evaluation of new subcritical measurements. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Prediction on Underestimation of Statistical Uncertainty in Monte Carlo Eigenvalue Calculation for Two-dimensional Heterogeneous Color Set Geometry

In a Monte Carlo calculation, statistical uncertainty is inevitably included in the result. The statistical uncertainty is commonly estimated by the central limit theorem without considering correlation among generations. The statistical uncertainty is usually expected to decrease at the inverse square root of the number of neutron histories. However, in a Monte Carlo eigenvalue calculation in a large geometry whose dominance ratio is close to unity, the central limit theorem would not be valid and thus the statistical uncertainty of fission source distribution can be significantly underestimated when inter-cycle correlation is not appropriately taken into account. The true statistical uncertainty can be calculated by statistical processing of the results obtained by multiple Monte Carlo runs using different initial random seeds, but this approach has a drawback of large calculation cost. Therefore, prediction of true statistical uncertainty by alternate approach is desirable. One of the solutions for this issue is an evaluation method of statistical uncertainty based on the eigenfunction expansion and the Autoregressive model (AR model). In this method, the true statistical uncertainty is theoretically derived by applying the AR model to behavior of expansion coefficients of eigenfunction in fission source distribution during cycles. Underestimation ratio of statistical uncertainty of fission source distribution can be predicted by this method. Note that the underestimation ratio of statistical uncertainty is defined by the ratio of estimated error by a Monte Carlo calculation to the true statistical error. In the previous study, the proposed method was verified in a simple condition such as one energy group, one dimensional homogeneous slab geometry. Contributions of this summary are as follows. Firstly, expression of the noise term that is appeared in the AR model is theoretically derived. Secondly, prediction on underestimation ratio of statistical uncertainty is carried out in a more general case, i.e., flux of each fuel cell in 2 x 2 heterogeneous assembly geometry taken from the C5G7 benchmark problem. Through the present study, applicability of the theoretical prediction for underestimation of statistical uncertainty in practical problems will be verified. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Nonlinear eigenvalue problems in Density Functional Theory calculations

Developed in the 1960's by W. Kohn and coauthors, Density Functional Theory (DFT) is a very popular quantum model for First-Principles simulations in chemistry and material sciences. It allows calculations of systems made of hundreds of atoms. Indeed DFT reduces the 3N-dimensional Schroedinger electronic structure problem to the search for a ground state electronic density in 3D. In practice it leads to the search for N electronic wave functions solutions of an energy minimization problem in 3D, or equivalently the solution of an eigenvalue problem with a non-linear operator.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

IrRep: Symmetry eigenvalues and irreducible representations of ab initio band structures

Here, we present IrRep – a Python code that calculates the symmetry eigenvalues of electronic Bloch states in crystalline solids and the irreducible representations under which they transform. As input it receives bandstructures computed with state-of-the-art Density Functional Theory codes such as VASP, Quantum Espresso, or Abinit, as well as any other code that has an interface to Wannier90. Our code is applicable to materials in any of the 230 space groups and double groups preserving time-reversal symmetry with or without spin-orbit coupling included, for primitive or conventional unit cells. This makes IrRep a powerful tool to systematically analyze the connectivity and topological classification of bands, as well as to detect insulators with non-trivial topology, following the Topological Quantum Chemistry formalism: IrRep can generate the input files needed to calculate the (physical) elementary band representations and the symmetry-based indicators using the [CheckTopologicalMat: https://www.cryst.ehu.es/cgi-bin/cryst/programs/magnetictopo.pl] routine of the Bilbao Crystallographic Server. It is also particularly suitable for interfaces with other plane-waves based codes, due to its flexible structure.

97 MATHEMATICS AND COMPUTING↗

A quantum eigenvalue solver based on tensor networks

Electronic ground states are of central importance in chemical simulations, but have remained beyond the reach of efficient classical algorithms except in cases of weak electron correlation or one-dimensional spatial geometry. We introduce a hybrid quantum-classical eigenvalue solver that constructs a wavefunction ansatz from a linear combination of matrix product states in rotated orbital bases, enabling the characterization of strongly correlated ground states with arbitrary spatial geometry. The energy is converged via a gradient-free generalized sweep algorithm based on quantum subspace diagonalization, with a potentially exponential speedup in the off-diagonal matrix element contractions upon translation into compact quantum circuits of linear depth in the number of qubits. Chemical accuracy is attained in numerical experiments for both a stretched water molecule and an octahedral arrangement of hydrogen atoms, achieving substantially better correlation energies compared to a unitary coupled-cluster benchmark, with orders of magnitude reductions in quantum resource estimates and a surprisingly high tolerance to shot noise. This proof-of-concept study suggests a promising new avenue for scaling up simulations of strongly correlated chemical systems on near-term quantum hardware.

chemistry↗

On the accuracy of the chemically significant eigenvalue method

We study the accuracy and convergence properties of the chemically significant eigenvalues method as proposed by Georgievskii et al. [J. Phys. Chem. A 117, 12146-12154 (2013)] and its close relative, dominant subspace truncation, for reduction of the energy-grained master equation. We formally derive the connection between both reduction techniques and provide hard error bounds for the accuracy of the latter which confirm the empirically excellent accuracy and convergence properties but also unveil practically relevant cases in which both methods are bound to fall short. We propose the use of balanced truncation as an effective alternative in these cases.

Chemistry↗

MAS: A versatile Landau-fluid eigenvalue code for plasma stability analysis in general geometry

We have developed a new global eigenvalue code, Multiscale Analysis for plasma Stabilities (MAS), for studying plasma problems with wave toroidal mode number (n) and frequency (ω) in a broad range of interest in general tokamak geometry, based on a five-field Landau-fluid description of thermal plasmas. Beyond keeping the necessary plasma fluid response, we further retain the important kinetic effects including diamagnetic drift, ion finite Larmor radius, finite parallel electric field (E||), ion and electron Landau resonances in a self-consistent and non-perturbative manner without sacrificing the attractive efficiency in computation. The physical capabilities of the code are evaluated and examined in the aspects of both theory and simulation. In theory, the comprehensive Landau-fluid model implemented in MAS can be reduced to the well-known ideal MHD model, electrostatic ion-fluid model, and drift-kinetic model in various limits, which clearly delineates the physics validity regime. In simulation, MAS has been well benchmarked with theory and other gyrokinetic and kinetic-MHD hybrid codes in a manner of adopting the unified physical and numerical framework, which covers the kinetic Alfv\'en wave (KAW), ion sound wave (ISW), low-n kink, high-n ion temperature gradient mode (ITG) and kinetic ballooning mode (KBM). Moreover, MAS is successfully applied to model the Alfv\'en eigenmode (AE) activities in DIII-D discharge #159243, which faithfully captures the frequency sweeping of reversed shear Alfv\'en eigenmode (RSAE), the tunneling damping of toroidal Alfv\'en eigenmode (TAE), as well as the polarization characteristics of kinetic beta-induced Alfv\'en eigenmode (KBAE) and beta-induced Alfv\'en-acoustic eigenmode (BAAE) being consistent with former gyrokinetic theory and simulation. With respect to the key progress contributed to the community, MAS has the advantage of combining rich physics ingredients, realistic global geometry and high computation efficiency together for plasma stability analysis in linear regime.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Eigenvalue-Based Micromagnetic Analysis of Switching in Spin-Torque-Driven Structures

We present an eigenvalue-based approach for studying the magnetization dynamics in magnetic nanostructures driven by spintronic excitations, such as spin-transfer torque and spin-orbit torque. The approach represents the system dynamics in terms of normal oscillation modes (eigenstates) with corresponding complex eigenfrequencies. The dynamics is driven by a small number of active eigenstates and often considering just a single eigenstate is sufficient. We develop a perturbation theory that provides semianalytical dynamic solutions by using eigenstates for the case in the absence of damping and spintronic excitations as a basis. The approach provides useful insights into dynamics in such systems and allows solving several difficulties in their modeling, such as extracting the switching current in magnetic random-access memories and understanding switching mechanisms. We show that the presented approach directly predicts the critical switching current, i.e., switching current for an infinite time. The approach also provides solutions for the switching dynamics allowing the switching current to be obtained for a finite switching time, provided that the system symmetry is broken, e.g., by tilting the polarizer, so that switching by a finite pulse is possible.

42 ENGINEERING↗

Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices

The accurate computation of ground and excited states of many-fermion quantum systems is one of the most consequential, contemporary challenges in the physical and computational sciences whose solution stands to benefit significantly from the advent of quantum computing devices. Existing methodologies using phase estimation or variational algorithms have potential drawbacks such as deep circuits requiring substantial error correction or non-trivial high-dimensional classical optimization. In this work, we introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies and reduced density matrices of ground and excited states. The solver does not require deep circuits or difficult classical optimization and achieves an exponential speed-up over its classical counterpart. We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.

97 MATHEMATICS AND COMPUTING↗

Towards predictive band gaps for halide perovskites: Lessons from one-shot and eigenvalue self-consistent GW

Halide perovskites constitute a chemically diverse class of crystals with great promise as photovoltaic absorber materials, featuring band gaps between about 1 and 3.5 eV depending on composition. Their diversity calls for a general computational approach to predicting their band gaps. However, such an approach is still lacking. Here, we use density functional theory (DFT) and ab initio many-body perturbation theory within the GW approximation to compute the quasiparticle or fundamental band gap of a set of ten representative halide perovskites: CH 3 NH 3 PbI 3 ( MAPbI 3 ), MAPbBr 3 , CsSnBr 3 , ( MA ) 2 BiTlBr 6 , Cs 2 TlAgBr 6 , Cs 2 TlAgCl 6 , Cs 2 BiAgBr 6 , Cs 2 InAgCl 6 , Cs 2 SnBr 6 , and Cs 2 Au 2 I 6 . Comparing with recent measurements, we find that a standard generalized gradient exchange-correlation functional can significantly underestimate the experimental band gaps of these perovskites, particularly in cases with strong spin-orbit coupling (SOC) and highly dispersive band edges, to a degree that varies with composition. We show that these nonsystematic errors are inherited by one-shot G 0 W 0 and eigenvalue self-consistent GW 0 calculations, demonstrating that semilocal DFT starting points are insufficient for MAPbI 3 , MAPbBr 3 , CsSnBr 3 , ( MA ) 2 BiTlBr 6 , Cs 2 TlAgBr 6 , and Cs 2 TlAgCl 6 . On the other hand, we find that DFT with hybrid functionals leads to an improved starting point and G W 0 results in better agreement with experiment for these perovskites. Our results suggest that G W 0 with hybrid functional-based starting points are promising for predicting band gaps of systems with large SOC and dispersive bands in this technologically important class of semiconducting crystals.</

36 MATERIALS SCIENCE↗

Controlled gate networks: theory and application to eigenvalue estimation

We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates. We present the general theory of controlled gate networks and show that, under quite general conditions, it can significantly reduce the number of two-qubit gates needed to produce linear combinations of unitary operators. The first example we consider is a variational subspace calculation for a two-qubit system. The second example is estimating the eigenvalues of a two-qubit Hamiltonian via the rodeo algorithm (Choi et al. in Phys Rev Lett 127(4):040505, 2021. https://doi.org/10.1103/PhysRevLett.127.040505) using operators that we call controlled reversal gates. We use the Quantinuum H1-2 and IBM Perth devices to realize the quantum circuits. The third example is the application of controlled gate networks to the controlled time evolution of a free nucleon on a three-dimensional lattice. For all of the examples, we show very substantial reductions in the number of two-qubit gates required. Our work demonstrates that controlled gate networks are a useful tool for reducing gate complexity in quantum algorithms for quantum many-body problems such as those relevant to nuclear physics.

Bee-Lindgren, Max [Georgia Institute of Technology↗