Search NASA⌕ Search

SEARCH · Search NASA

Results for “eigenvalue method”

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 361 records · Page 20

Temperature sensitivity of the equilibrium neutronics and accident analysis of the HTR-10

Pebble-Bed High-Temperature Gas-cooled Reactors (PB-HTGR) are moderated by the graphite in the fuel pebbles and the graphite reflector surrounding the pebble-bed. Because graphite is by far the most abundant material in PB-HTGRs and the primary moderator, accurate modeling of the graphite material, including density, impurities, and temperatures, is crucial for accurate computational modeling and simulation of these reactors. While main characteristics of the graphite components are often known, the local temperature is less well known and often averaged over all components. Here, this work studies the impact of considering accurate temperature profiles in the graphite material on the generation of a small PB-HTGR model at the state of equilibrium operation and on short-term accident progression. The fuel compositions for the PB-HTGR were determined using a jump-in equilibrium modeling method, the Axial Radial Zone Equilibrium Modeling (AR-ZEM) method. In contrast to previous work, the AR-ZEM method was used considering thermal-hydraulic feedback from the MELCOR code to determine temperatures of the fuel pebbles and the surrounding graphite reflector. The consideration of an axial and radial temperature profile in the core and reflector, as opposed to uniform material temperatures, had an impact of almost 1,300 pcm on the equilibrium core eigenvalue and caused significant differences in the discharged plutonium fuel inventory with up to 4.9% and 11.0% for Pu-239 and Pu-242, respectively. To assess the impact on short-term accident progression, two Anticipated Transient Without SCRAM (ATWS) events, a Pressurized Loss of Forced Coolant (PLOFC) and a Control Rod Withdrawal (CRW) with loss of flow, were simulated with MELCOR. The use of temperature profiles in the equilibrium core models did not reveal a significant impact on the temperature, power, or reactivity responses during the transients. In conclusion, a need for consideration of accurate temperature profiles, in particular for the graphite reflector, was found for the generation of equilibrium PB-HTGRs core models using jump-in methods, but detailed temperature profiles may not be necessary when performing conservative transient analysis.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

On the Stochastic Stability of Deep Markov Models

Deep Markov models (DMM) are generative models which are scalable and expressive generalization of Markov models for representation, learning, and inference problems. DMMs using deep neural networks to parametrize the transition of Markov probability distributions have recently been shown to provide more expressiveness in modeling sequential data and dynamical system responses. However, the fundamental stochastic stability guarantees of such models have not been thoroughly investigated. In this paper, we present a rigorous analytical method to prove the necessary and sufficient conditions of DMM's stochastic stability. This task is achieved by spectral analysis of the efficiently computed Jacobians of probabilistic maps modeled by deep neural networks. We make theoretical connections between the eigenvalues of neural network's weights and the different activation function types used on the stability and overall dynamic behavior of DMMs with Gaussian distributions. We empirically substantiate our theoretical results on stochastic stability and eigenvalue spectra via several numerical experiments. Formal stability guarantees of DMMs can substantially improve their robustness and trustworthiness, necessary for reliable use in safety-critical real-world applications.

Drgona, Jan↗

Time-dependent equation-of-motion coupled-cluster simulations with a defective Hamiltonian

Here simulations of laser-induced electron dynamics in a molecular system are performed using time-dependent (TD) equation-of-motion (EOM) coupled-cluster (CC) theory. The target system has been chosen to highlight potential shortcomings of truncated TD-EOM-CC methods [represented in this work by TD-EOM-CC with single and double excitations (TD-EOM-CCSD)], where unphysical spectroscopic features can emerge. Specifically, we explore driven resonant electronic excitations in magnesium fluoride in the proximity of an avoided crossing. Near the avoided crossing, the CCSD similarity-transformed Hamiltonian is defective, meaning that it has complex eigenvalues, and oscillator strengths may take on negative values. When an external field is applied to drive transitions to states exhibiting these traits, unphysical dynamics are observed. For example, the stationary states that make up the time-dependent state acquire populations that can be negative, exceed one, or even complex-valued.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Revealing the z ∼ 2.5 cosmic web with 3D Lyα forest tomography: a deformation tensor approach

Studies of cosmological objects should take into account their positions within the cosmic web of large-scale structure. Unfortunately, the cosmic web has only been extensively mapped at low redshifts (z<1), using galaxy redshifts as tracers of the underlying density field. At z>1, the required galaxy densities are inaccessible for the foreseeable future, but 3D reconstructions of Lyα forest absorption in closely separated background QSOs and star-forming galaxies already offer a detailed window into z∼2–3 large-scale structure. We quantify the utility of such maps for studying the cosmic web by using realistic z = 2.5 Lyα forest simulations matched to observational properties of upcoming surveys. A deformation tensor-based analysis is used to classify voids, sheets, filaments, and nodes in the flux, which are compared to those determined from the underlying dark matter (DM) field. We find an extremely good correspondence, with 70% of the volume in the flux maps correctly classified relative to the DM web, and 99% classified to within one eigenvalue. This compares favorably to the performance of galaxy-based classifiers with even the highest galaxy densities from low-redshift surveys. We find that narrow survey geometries can degrade the recovery of the cosmic web unless the survey is ≳60 h{sup −1} Mpc or ≳1 deg on the sky. We also examine halo abundances as a function of the cosmic web, and find a clear dependence as a function of flux overdensity, but little explicit dependence on the cosmic web. These methods will provide a new window on cosmological environments of galaxies at this very special time in galaxy formation, “high noon,” and on overall properties of cosmological structures at this epoch.

79 ASTRONOMY AND ASTROPHYSICS↗

Entanglement Witness for Indistinguishable Electrons Using Solid-State Spectroscopy

Characterizing entanglement in quantum materials is crucial for advancing next-generation quantum technologies. Despite recent strides in witnessing entanglement in magnetic materials with distinguishable spin modes, quantifying entanglement in systems formed by indistinguishable electrons remains a formidable challenge. To solve this problem, we introduce a method to extract various four-fermion correlations by analyzing the nonlinearity in resonant inelastic x-ray scattering spectra. These correlations constitute the primary components of the cumulant two-particle reduced density matrix. We further derive bounds for its eigenvalues and demonstrate the linear scaling with fermionic entanglement depth, providing a reliable witness for entanglement. Using the material-relevant strongly correlated models as examples, we show how this entanglement witness can efficiently quantify multipartite entanglement across different phase regions, highlighting its advantage over quantum Fisher information. Published by the American Physical Society 2025

Liu, Tongtong (ORCID:0000000295324061)↗

Low-synch Gram–Schmidt with delayed reorthogonalization for Krylov solvers

The parallel strong-scaling of iterative methods is often determined by the number of global reductions at each iteration. Low-synch Gram-Schmidt algorithms are applied here to the Arnoldi algorithm to reduce the number of global reductions and therefore to improve the parallel strong-scaling of iterative solvers for nonsymmetric matrices such as the GMRES and the Krylov-Schur iterative methods. In the Arnoldi context, the factorization is "left-looking" and processes one column at a time. Among the methods for generating an orthogonal basis for the Arnoldi algorithm, the classical Gram-Schmidt algorithm, with reorthogonalization (CGS2) requires three global reductions per iteration. A new variant of CGS2 that requires only one reduction per iteration is presented and applied to the Arnoldi algorithm. Delayed CGS2 (DCGS2) employs the minimum number of global reductions per iteration (one) for a one-column at-a-time algorithm. The main idea behind the new algorithm is to group global reductions by rearranging the order of operations. DCGS2 must be carefully integrated into an Arnoldi expansion or a GMRES solver. Numerical stability experiments assess robustness for Krylov-Schur eigenvalue computations. Performance experiments on the ORNL Summit supercomputer then establish the superiority of DCGS2 over CGS2.

97 MATHEMATICS AND COMPUTING↗

Two-step neutronics calculations with Shift and Griffin for advanced reactor systems

This research develops the initial coupling of the Shift Monte Carlo (MC) code and the Griffin reactor physics code for reactor analysis of non–light-water reactor systems. The novelty of this work is twofold. It is the first application of Shift to produce the multigroup cross sections needed for Griffin as applied to a non–light-water reactor system; and, the first investigation and analysis of characteristics of the Empire microreactor benchmark that should be considered for steady state and transient reactor physics calculations. This application uses the previously developed two-step neutronics analysis workflow to demonstrate this initial coupling. Here, we outline the two-step neutronics analysis workflow in which the Shift MC code is used to generate the multigroup cross sections and fluxes needed by the Griffin deterministic solver. Details on how these multigroup cross sections are generated using MC tallies are given, as well as the practicalities and limitations of the two-step neutronics workflow. The Empire microreactor benchmark was used to investigate and validate this coupling. Results using this benchmark show good agreement between Griffin calculations using Serpent-generated cross sections and Shift-generated cross sections. Analysis of the characteristics of this Empire benchmark show larger eigenvalue differences between heterogeneous and pin–homogenized solutions compared to those of traditional light-water reactor (LWR) designs, thus requiring super homogenization factor corrections for accurate eigenvalue and power distribution predictions.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Fast inversion, preconditioned quantum linear system solvers, fast Green's-function computation, and fast evaluation of matrix functions

Preconditioning is the most widely used and effective way for treating ill-conditioned linear systems in the context of classical iterative linear system solvers. We introduce a quantum primitive called fast inversion, which can be used as a preconditioner for solving quantum linear systems. The key idea of fast inversion is to directly block encode a matrix inverse through a quantum circuit implementing the inversion of eigenvalues via classical arithmetics. We demonstrate the application of preconditioned linear system solvers for computing single-particle Green's functions of quantum many-body systems, which are widely used in quantum physics, chemistry, and materials science. We analyze the complexities in three scenarios: the Hubbard model, the quantum many-body Hamiltonian in the plane-wave-dual basis, and the Schwinger model. We also provide a method for performing Green's function calculation in second quantization within a fixed-particle manifold and note that this approach may be valuable for simulation more broadly. Aside from solving linear systems, fast inversion also allows us to develop fast algorithms for computing matrix functions, such as the efficient preparation of Gibbs states. Furthermore, we introduce two efficient approaches for such a task, based on the contour-integral formulation and the inverse transform, respectively.

97 MATHEMATICS AND COMPUTING↗

Using Machine Learning Methods to Predict Bias in Nuclear Criticality Safety

The manuscript provides a description of the application of machine-learning (ML) tools to the prediction of bias in criticality safety analysis. In particular, a set of over 1000 experiments included in the Whisper package were fed into a variety of ML algorithms (notably Random Forest and AdaBoost) implemented in SciKit-Learn using k-eigenvalue sensitivities (with and without energy dependence) for individual nuclides, and optionally, the simulated k eff as the training features. Ultimately, the ML model was used to predict the bias (k sim - k exp ). The results indicate that use of energy-integrated sensitivity profiles with k sim as training features led to the best predictions as quantified by root-mean square and mean absolute errors. In particular, the best-case estimates came from AdaBoost, with a mean absolute error of 0.00174, which is less than the mean experimental uncertainty of 0.00328 for the experiments included.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Model Order Reduction Algorithm for Estimating the Absorption Spectrum

The ab initio description of the spectral interior of the absorption spectrum poses both a theoretical and computational challenge for modern electronic structure theory. Due to the often spectrally dense character of this domain in the quantum propagator’s eigenspectrum for medium-to-large sized systems, traditional approaches based on the partial diagonalization of the propagator often encounter oscillatory and stagnating convergence. Electronic structure methods which solve the molecular response problem through the solution of spectrally shifted linear systems, such as the complex polarization propagator, offer an alternative approach which is agnostic to the underlying spectral density or domain location. This generality comes at a seemingly high computational cost associated with solving a large linear system for each spectral shift in some discretization of the spectral domain of interest. In this work, we present a novel, adaptive solution to this high computational overhead based on model order reduction techniques via interpolation. Model order reduction reduces the computational complexity of mathematical models and is ubiquitous in the simulation of dynamical systems and control theory. The efficiency and effectiveness of the proposed algorithm in the ab initio prediction of X-ray absorption spectra is demonstrated using a test set of challenging water clusters which are spectrally dense in the neighborhood of the oxygen K-edge. On the basis of a single, user defined tolerance we automatically determine the order of the reduced models and approximate the absorption spectrum up to the given tolerance. We also illustrate that, for the systems studied, the automatically determined model order increases logarithmically with the problem dimension, compared to a linear increase of the number of eigenvalues within the energy window. Furthermore, we observed that the computational cost of the proposed algorithm only scales quadratically with respect to the problem dimension.

IDREAM, K-Edge, theoretical, computational, electr↗

Model Order Reduction of Nonviscously Damped Structural Dynamic Models

A reduced order modeling capability has been developed to reduce the computational burden associated with time-domain solutions of structural dynamic models with linear viscoelastic materials. The discretized equations-of-motion produce convolution integrals resulting in a linear system with nonviscous damping forces. The challenge associated with the reduction of nonviscously damped, linear systems is the selection and computation of the appropriate modal basis to perform modal projection. The system produces a nonlinear eigenvalue problem that is challenging to solve and requires use of specialized algorithms not readily available in commercial finite element packages. This SAND report summarizes the LDRD discoveries of a reduction scheme developed for monolithic finite element models and provides preliminary investigations to extensions of the method using component mode synthesis. In addition, this report provides a background overview of structural dynamic modeling of structures with linear viscoelastic materials, and provides an overview of a new code capability in Sierra Structural Dynamics to output the system level matrices computed on multiple processors.

97 MATHEMATICS AND COMPUTING↗

User Guide for the New Tally ACODE Capabilities

In the newest development version of MCNP (post-6.2.1), the α-eigenvalue solver has undergone some changes. A new approach for computing was added alongside the current ACODE algorithm. This document will briefly discuss the changes made by this modification, both in the current ACODE and in the new algorithm, as well as the new capabilities this method provides.

97 MATHEMATICS AND COMPUTING↗

Extended Applications of Subgrid Representation in the 2D/1D Method

Recent efforts in MPACT have focused on improving the performance of the 2D/1D subplane implementation to help target computational performance goals. Here, we build on previous efforts that targeted the use of subgrid treatments to improve the accuracy of control rod representation, presenting three additional applications of subgrid treatments with the goal of reducing the computational burden of simulations. These subgrid applications include treatment of spacer grids, thermal feedback, and axial reflector material representation. With these approaches, a single method of characteristics (MOC) plane can contain several different materials axially that are represented explicitly via subgrids on the coarse mesh finite difference (CMFD) mesh but are axially homogenized on the MOC mesh. This allows for a substantial reduction in the number of MOC planes needed in the calculation through the introduction of an approximate treatment, particularly with regard to the self-shielded cross sections and MOC-informed radial current coupling coefficients in CMFD. Several test problems ranging from single rod to quarter core are used to assess the solution accuracy and performance of these various subgrid representations. Overall, the accuracy of the approximations seems very reasonable, with extremely small differences in eigenvalue observed and maximum pin power errors in the 0.5% to 1.0% range. Several cases show substantial value in the compromise between accuracy and computational performance. Others highlight the new computational hurdles that future research will aim to resolve.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

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

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

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fault Detection via Occupation Kernel Principal Component Analysis

Reliable operation of automatic systems is heavily dependent on the ability to detect faults in the underlying dynamics. While traditional model-based methods have been widely used for fault detection, data-driven approaches have garnered increasing attention due to their ease of deployment and minimal need for expert knowledge. In this letter, we present a novel principal component analysis (PCA) method that uses occupation kernels. Occupation kernels result in feature maps that are tailored to the measured data, have inherent noise-robustness due to the use of integration, and can utilize irregularly sampled system trajectories of variable lengths for PCA. The occupation kernel PCA method is used to develop a reconstruction error approach to fault detection and its efficacy is validated using numerical simulations.

42 ENGINEERING↗

Layered CAD/CSG geometry for spatially complex radiation transport scenarios

Many spatially complex fission, fusion, and national security Monte Carlo (MC) radiation transport scenarios involve combining computer-aided design (CAD) models with constructive solid geometry (CSG) models. A layered geometry method has been implemented in the Shift MC code to address this need. With layered geometry, multiple CAD and/or CSG models can be clipped, translated, rotated, and placed in overlapping layers to form transport-ready geometries. Here, the utility of this method is demonstrated with two problems: (1) a fixed-source simulation with a layered geometry consisting of a LiDAR-generated CAD model of the Combined Arms Collective Training Facility urban environment overlaid with CSG models of a mock hotel and a detector apparatus, and (2) a k-eigenvalue calculation using a layered geometry model of the Transformational Challenge Reactor consisting of CAD fuel elements placed in a CSG core. Tallied particle flux distributions match expectations, but tracking robustness must be improved prior to general-purpose use.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Multigroup cross section generation capability in GRIFFIN

GRIFFIN is an advanced reactor multiphysics application built on the object-oriented simulation environment (MOOSE) and is jointly developed by Idaho National Laboratory and Argonne National Laboratory. The cross section application programming interface, originally developed for the PROTEUS code, has been integrated into GRIFFIN to prepare cross sections for thermal reactor applications with heterogeneous geometries. Additional improvements have been made by implementing an on-the-fly slowing down method, a double heterogeneity treatment capability, and updating the procedure to generate the fine multigroup library. The cross section preparation capability in GRIFFIN was verified for graphite-moderated TRISO fuel-based reactor benchmark problems: unit-cell problems of VHTR and EMPIRE micro reactor and HTTR assembly problems. Eigenvalues and multigroup cross sections of GRIFFIN agreed very well with those of the continuous-energy Monte Carlo code Serpent2 within 200 pcm in eigenvalue and 2% in cross sections. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗