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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

A Shift Selection Strategy for Parallel Shift-Invert Spectrum Slicing in Symmetric Self-Consistent Eigenvalue Computation

The central importance of large scale eigenvalue problems in scientific computation necessitates the development massively parallel algorithms for their solution. Recent advances in dense numerical linear algebra have enabled the routine treatment of eigenvalue problems with dimensions on the order of hundreds of thousands on the world's largest supercomputers. In cases where dense treatments are not feasible, Krylov subspace methods offer an attractive alternative due to the fact that they do not require storage of the problem matrices. However, demonstration of scalability of either of these classes of eigenvalue algorithms on computing architectures capable of expressing excessive parallelism is non-trivial due to communication requirements and serial bottlenecks, respectively. In this work, we introduce the SISLICE method: a parallel shift-invert algorithm for the solution of the symmetric self-consistent field (SCF) eigenvalue problem. The SISLICE method drastically reduces the communication requirement of current parallel shift-invert eigenvalue algorithms through various shift selection and migration techniques based on density of states estimation and k-means clustering, respectively. This work demonstrates the robustness and parallel performance of the SISLICE method on a representative set of SCF eigenvalue problems and outlines research directions which will be explored in future work.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Survey of Dynamic Mode Decomposition Methods

Dynamic mode decomposition (DMD) is a data-driven reduced order modeling (ROM) technique used for dynamic systems. The widely adopted algorithm was first introduced and demonstrated on fluid flow data by Schmid. In recent years, various other fields, such as nuclear engineering, have begun to adopt this method. For example, DMD has been used for estimating α-eigenvalues, as an ROM for pulsed neutron problems, for predicting isotopic composition in burnup calculations, as acceleration techniques for iterative methods, and in capturing dynamic behaviors in molten salt reactor transients. This report seeks to demonstrate the capabilities and limits of the standard DMD algorithm, and identify problem spaces where variants may be better suited. The primary variant this report considers is Multi-Resolution DMD (mrDMD). Because this serves as a survey, synthetically produced data is used in lieu of simulation results. The remainder of this report will go into detail on the DMD theory, outline the standard DMD and mrDMD algorithms, present test cases highlighting the applicability of each, and finally present a discussion on how to determine the best suited algorithm for a given problem. All calculations performed in this report are carried out using the open source DMD library, PyDMD.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Planetary normal mode computation: Parallel algorithms, performance and reproducibility

This report is an extension of work entitled “Computing planetary interior normal modes with a highly parallel polynomial filtering eigensolver.” by Shi et al., [1] originally presented at the SC18 conference. A highly parallel polynomial filtered eigensolver was developed and exploited to calculate the planetary normal modes. The proposed method is ideally suited for computing interior eigenpairs for large-scale eigenvalue problems as it greatly enhances memory and computational efficiency. In this article, the second-order finite element method is used to further improve the accuracy as only the first-order finite element method was deployed in the previous work. The parallel algorithm, its parallel performance up to 20k processors, and the great computational accuracy are illustrated. The reproducibility of the previous work was successfully performed on the Student Cluster Competition at the SC19 conference by several participant teams using a completely different Mars-model dataset on different clusters. Both weak and strong scaling performances of the reproducibility by the participant teams were impressive and encouraging. The analysis and reflection of their results are demonstrated and future direction is discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

A Non-perturbative Approach to Computing Seismic Normal Modes in Rotating Planets

In this work, a continuous Galerkin method based approach is presented to compute the seismic normal modes of rotating planets. Special care is taken to separate out the essential spectrum in the presence of a fluid outer core using a polynomial filtering eigensolver. The relevant elastic-gravitational system of equations, including the Coriolis force, is subjected to a mixed finite-element method, while self-gravitation is accounted for with the fast multipole method. Our discretization utilizes fully unstructured tetrahedral meshes for both solid and fluid regions. The relevant eigenvalue problem is solved by a combination of several highly parallel and computationally efficient methods. We validate our three-dimensional results in the non-rotating case using analytical results for constant elastic balls, as well as numerical results for an isotropic Earth model from standard “radial” algorithms. We also validate the computations in the rotating case, but only in the slowly-rotating regime where perturbation theory applies, because no other independent algorithms are available in the general case. The algorithm and code are used to compute the point spectra of eigenfrequencies in several Earth and Mars models studying the effects of heterogeneity on a large range of scales.

58 GEOSCIENCES↗
DOE OSTI2020

The Fermi–Löwdin self-interaction correction for ionization energies of organic molecules

(Semi)-local density functional approximations (DFAs) suffer from self-interaction error (SIE). When the first ionization energy (IE) is computed as the negative of the highest occupied orbital (HO) eigenvalue, DFAs notoriously underestimate them compared to quasi-particle calculations. Here, the inaccuracy for the HO is attributed to SIE inherent in DFAs. We assessed the IE based on Perdew-Zunger self-interaction correction on 14 small to moderate-sized organic molecules relevant in organic electronics and polymer donor materials. Though self-interaction corrected DFAs were found to significantly improve the IE relative to the uncorrected DFAs, they overestimate. However, when the self-interaction correction is interiorly scaled using a function of the iso-orbital indicator zs , only the regions where SIE is significant get a correction. We discuss these approaches and show how these methods significantly improve the description of the HO eigenvalue for the organic molecules.

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

Data‐driven variational method for discrepancy modeling: Dynamics with small‐strain nonlinear elasticity and viscoelasticity

Abstract The effective inclusion of a priori knowledge when embedding known data in physics‐based models of dynamical systems can ensure that the reconstructed model respects physical principles, while simultaneously improving the accuracy of the solution in the previously unseen regions of state space. This paper presents a physics‐constrained data‐driven discrepancy modeling method that variationally embeds known data in the modeling framework. The hierarchical structure of the method yields fine scale variational equations that facilitate the derivation of residuals which are comprised of the first‐principles theory and sensor‐based data from the dynamical system. The embedding of the sensor data via residual terms leads to discrepancy‐informed closure models that yield a method which is driven not only by boundary and initial conditions, but also by measurements that are taken at only a few observation points in the target system. Specifically, the data‐embedding term serves as residual‐based least‐squares loss function, thus retaining variational consistency. Another important relation arises from the interpretation of the stabilization tensor as a kernel function, thereby incorporating a priori knowledge of the problem and adding computational intelligence to the modeling framework. Numerical test cases show that when known data is taken into account, the data driven variational (DDV) method can correctly predict the system response in the presence of several types of discrepancies. Specifically, the damped solution and correct energy time histories are recovered by including known data in the undamped situation. Morlet wavelet analyses reveal that the surrogate problem with embedded data recovers the fundamental frequency band of the target system. The enhanced stability and accuracy of the DDV method is manifested via reconstructed displacement and velocity fields that yield time histories of strain and kinetic energies which match the target systems. The proposed DDV method also serves as a procedure for restoring eigenvalues and eigenvectors of a deficient dynamical system when known data is taken into account, as shown in the numerical test cases presented here.

Masud, Arif↗
DOE OSTI2024

Equilibrium core modeling of a pebble bed reactor similar to the Xe-100 with SCALE

As the nuclear industry moves towards licensing and constructing advanced reactors, new attention has been focused on the advanced reactor designs that have past operational experience, such as pebble-bed high-temperature gas-cooled reactors (PB-HTGRs). Pebble-bed reactor designs have many advantages, such as their higher operating temperatures and online refueling capabilities. However, high-fidelity computational modeling of pebble-bed reactor designs, from reactor startup to operation at equilibrium, is more challenging compared to conventionally fueled reactors due to the continuous movement of the fuel pebbles through the reactor during operation. In previous work at Oak Ridge National Laboratory (ORNL), the SCALE Leap-In method for Cores at Equilibrium (SLICE) was developed around tools within the SCALE code system. This iterative method can effectively generate pebble-bed reactor zone-wise fuel inventories at equilibrium core operation within a reasonable computational time. The objective of this work was to further verify the ORNL SLICE method and to investigate the impact of considering temperature profiles during the application of the method. The SLICE method was applied to a modular high-temperature gas-cooled reactor design based upon publicly available design specifications of the Xe-100 pebble-bed reactor. Upon comparing the results from the SLICE method to published literature, the differences in the eigenvalue k effective were on the order of several hundred pcm (percent millirho). To investigate one possible cause of these differences, a study looking at the sensitivity of the full-core equilibrium k effective and discharge nuclide inventory to temperature was performed by developing equilibrium cores of two additional temperature profiles. From this temperature study, differences on the order of hundreds of pcm for the full-core equilibrium k effective , and up to 15% difference for the discharge inventories were found. In conclusion, these results indicated the strong dependence on temperature that needs to be considered for future work in equilibrium modeling of PB-HTGRs.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2021

pnnl/neural_ODE_ICLR2020

We show how to model discrete ordinary differential equations (ODE) with algebraic nonlinearities as deep neural networks with varying degrees of prior knowledge. We derive the stability guarantees of the network layers based on the implicit constraints imposed on the weight's eigenvalues. Moreover, we show how to use barrier methods to generically handle additional inequality constraints. We demonstrate the prediction accuracy of learned neural ODEs evaluated on open-loop simulations compared to ground truth dynamics with bi-linear terms.

Tuor, Aaron↗
DOE OSTI2022

Hybrid quantum-classical approach for coupled-cluster Green's function theory

The three key elements of a quantum simulation are state preparation, time evolution, and measurement. While the complexity scaling of time evolution and measurements are well known, many state preparation methods are strongly system-dependent and require prior knowledge of the system's eigenvalue spectrum. Here, we report on a quantum-classical implementation of the coupled-cluster Green's function (CCGF) method, which replaces explicit ground state preparation with the task of applying unitary operators to a simple product state. While our approach is broadly applicable to many models, we demonstrate it here for the Anderson impurity model (AIM). The method requires a number of T gates that grows as O ( N 5 ) per time step to calculate the impurity Green's function in the time domain, where N is the total number of energy levels in the AIM. Since the number of T gates is analogous to the computational time complexity of a classical simulation, we achieve an order of magnitude improvement over a classical CCGF calculation of the same order, which requires O ( N 6 ) computational resources per time step.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Pulsed-Neutron Experiments at the Inherently Safe Subcritical Assembly

The pulsed neutron technique is a powerful, dynamic method to assay the reactivity of a multiplying system. This work presents the novel application of the pulsed neutron technique to the Inherently Safe Subcritical Assembly, an experimental configuration accepted by the International Criticality Safety Benchmark Evaluation Project Handbook. The experiments were replicated with COG11.3, a continuous-energy Monte Carlo code. The pulsed neutron data were analyzed using the Sjöstrand and Gozani area-ratio methods and by extracting the prompt neutron decay constant. Subsequent static k-eigenvalue and 𝛼-eigenvalue simulations were also performed for the same configurations. Neutron detector dead-time effects from the experiments were corrected using the Backwards Extrapolation Method and shown to have a negligible impact on the estimated reactivities. The results highlight that capturing time-dependent effects like delayed neutron precursor buildup are essential to accurately reproduce experimental results. They also highlight the importance of shielding the detectors from generator source neutrons in deeply subcritical configurations.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2021

Structural stability and artificial buckling modes in topology optimization

Abstract This paper demonstrates how a strain energy transition approach can be used to remove artificial buckling modes that often occur in stability constrained topology optimization problems. To simulate the structural response, a nonlinear large deformation hyperelastic simulation is performed, wherein the fundamental load path is traversed using Newton’s method and the critical buckling load levels are estimated by an eigenvalue analysis. The goal of the optimization is to minimize displacement, subject to constraints on the lowest critical buckling loads and maximum volume. The topology optimization problem is regularized via the Helmholtz PDE-filter and the method of moving asymptotes is used to update the design. The stability and sensitivity analyses are outlined in detail. The effectiveness of the energy transition scheme is demonstrated in numerical examples.

Dalklint, Anna (ORCID:0000000346195205)↗
DOE OSTI2025

Implementation of Perturbation Theory and Sensitivity Capabilities in Griffin

Griffin is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor Multiphysics analysis application, jointly developed by Argonne and Idaho National Laboratories under the DOE-NE NEAMS program. This fiscal year, capabilities for reactivity and sensitivity evaluation using perturbation methods were implemented and verified. The First Order Perturbation Method (FOPT) was employed to compute reactivity worth resulting from small perturbations in input parameters, while the Generalized Perturbation Theory (GPT) was used to evaluate sensitivities of a range of response types, including reaction rate ratio, k-eigenvalue, neutron generation time, and effective delayed neutron fraction. These perturbation methods enable users to quantify how response quantities change due to a perturbation in a input parameter without explicitly performing an additional transport simulation for each perturbed state. In particular, the GPT formulation accounts for indirect effects arising from flux changes by solving generalized inhomogeneous equations, for which a Neumann series-based iterative solution method was developed and implemented in Griffin. The implemented reactivity and sensitivity evaluation capabilities were verified using two test problems: an infinite homogeneous system and a two-dimensional hexagonal core. The results showed excellent agreement with reference solutions obtained by a direct method based on finite difference approximation as well as GPT-based results from the PERSENT code, confirming the accuracy of both reactivity and sensitivity evaluations. Additionally, preliminary uncertainty quantification (UQ) results were obtained by combining the sensitivity values computed using GPT and external covariance data, demonstrating that the implemented sensitivity results can be reliably used for uncertainty calculations. To further demonstrate the generality and practical strength of the implementation, the sensitivity evaluation capability was successfully applied to the Empire microreactor with a geometrically complex design that poses significant modeling challenges. The results confirm that Griffin enables sensitivity evaluations even for irregular and highly heterogeneous reactor configurations, thereby establishing a foundation for UQ applications in advanced reactor designs and analyses.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Implementation and testing of the GPT sensitivities in TRIPOLI-4

Computing the sensitivity of given reactor parameters with respect to nuclear data is mandatory in key applications such as the assessment of reactor safety or core design. In recent years, the development of Monte Carlo methods capable of estimating sensitivity coefficients based on the Standard or Generalized Perturbation Theory (SPT and GPT, respectively) has attracted intensive research efforts, especially in view of having reference golden standard simulations to be compared to faster but approximate deterministic calculations. Following our previous implementation and validation of the SPT functionalities in the Monte Carlo TRIPOLI-4, devoted to the sensitivity of the k eigenvalue, in this work we detail the development of GPT methods for ratios of reaction rates, and validate them against a few relevant benchmark results. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2023

A universal variational quantum eigensolver for non-Hermitian systems

Abstract Many quantum algorithms are developed to evaluate eigenvalues for Hermitian matrices. However, few practical approach exists for the eigenanalysis of non-Hermintian ones, such as arising from modern power systems. The main difficulty lies in the fact that, as the eigenvector matrix of a general matrix can be non-unitary, solving a general eigenvalue problem is inherently incompatible with existing unitary-gate-based quantum methods. To fill this gap, this paper introduces a Variational Quantum Universal Eigensolver (VQUE), which is deployable on noisy intermediate scale quantum computers. Our new contributions include: (1) The first universal variational quantum algorithm capable of evaluating the eigenvalues of non-Hermitian matrices—Inspired by Schur’s triangularization theory, VQUE unitarizes the eigenvalue problem to a procedure of searching unitary transformation matrices via quantum devices; (2) A Quantum Process Snapshot technique is devised to make VQUE maintain the potential quantum advantage inherited from the original variational quantum eigensolver—With additional $$O(log_{2}{N})$$ O ( l o g 2 N ) quantum gates, this method efficiently identifies whether a unitary operator is triangular with respect to a given basis; (3) Successful deployment and validation of VQUE on a real noisy quantum computer, which demonstrates the algorithm’s feasibility. We also undertake a comprehensive parametric study to validate VQUE’s scalability, generality, and performance in realistic applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Unleashed from constrained optimization: quantum computing for quantum chemistry employing generator coordinate inspired method

Hybrid quantum-classical approaches offer potential solutions to quantum chemistry problems, yet they often manifest as constrained optimization problems. Here, we explore the interconnection between constrained optimization and generalized eigenvalue problems through the Unitary Coupled Cluster (UCC) excitation generators. Inspired by the generator coordinate method, we employ these UCC excitation generators to construct non-orthogonal, overcomplete many-body bases, projecting the system Hamiltonian into an effective Hamiltonian, which bypasses issues such as barren plateaus that heuristic numerical minimizers often encountered in standard variational quantum eigensolver (VQE). Diverging from conventional quantum subspace expansion methods, we introduce an adaptive scheme that robustly constructs the many-body basis sets from a pool of the UCC excitation generators. This scheme supports the development of a hierarchical ADAPT quantum-classical strategy, enabling a balanced interplay between subspace expansion and ansatz optimization to address complex, strongly correlated quantum chemical systems cost-effectively, setting the stage for more advanced quantum simulations in chemistry.

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

Ensemble Simulation Techniques and Fast Randomized Algorithms

The major goals of the project were to develop and analyze new ensemble simulation techniques, including trajectory stratification and preconditioned MCMC techniques, as well as develop fast numerical linear algebra techniques closely related to ensemble simulation ideas. The trajectory stratification techniques involve simulating in parallel short trajectory fragments of a Markov process confined to a specific region of space‐time and then patching together the statistics gathered to assemble estimates of very general dynamical properties. We have also developed this approach for rare event simulation and extended the techniques to applications requiring a more general framework (such as electronic structure calculations). The preconditioned MCMC techniques involve simulating multiple Markov chains in parallel and then using information from the ensemble to speed the mixing of each individual chain. The fast randomized linear algebra methods are motivated by the diffusion Monte Carlo technique, but are applicable to finding the dominant eigenvalue of (almost) general matrices. For most non‐negative matrices, the schemes result in an error (compared to the power method) that is constant in the dimension of the problem. For more general matrices, we see a very clear sublinear cost trend in computational tests.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Efficient continuous Energy-Multigroup hybrid depletion scheme using the Shift Monte Carlo code. Part I: Energy condensation sensitivity analysis

Monte Carlo (MC) codes coupled to depletion solvers are increasingly used to provide high fidelity fuel cycle modeling capabilities. Here, these coupled depletion-MC tools produce accurate results in general but can experience nonphysical spatial oscillations when time steps are large or when a system’s dominance ratio approaches unity. Two substepping techniques have been developed previously to remedy and dampen these spatial oscillations without needing to reduce step sizes. The first approach relied on higher-order techniques to account for spectral changes within steps (extrapolation and interpolation techniques). The second approach used the first order perturbation (FOP) theory to account for the change in the one-group spatial flux distribution within steps. This paper develops a hybrid depletion methodology which, in a way, combines how the flux is handled in both substepping techniques. Specifically, the multigroup (MG) MC Shift code is used to update the flux distribution within steps rather than a one-group FOP solver. A fully reflected pincell is investigated, which is not spatially dependent in the MG representation. Thus, the analysis in this paper is an initial demonstration of hybrid depletion. An upcoming companion paper will focus on how the hybrid depletion dampens spatial oscillations. The hybrid depletion approach is verified to be consistent with previous constant extrapolation depletion (CED) methods. This paper finds that the hybrid CED exhibits some error in the eigenvalue and one group constants within macro steps. To address this discrepancy, a simple interpolation scheme (CELI) is investigated. This work found that CELI sufficiently addresses the discrepancy in spectrum for macro steps up to 100 days. Overall, this work demonstrates that the hybrid depletion method can significantly reduce the number of high fidelity MC executions in a MC-coupled depletion with an acceptable eigenvalue error.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2018

Autoencoder node saliency: Selecting relevant latent representations

The autoencoder is an artificial neural network that performs nonlinear dimension reduction and learns hidden representations of unlabeled data. With a linear transfer function it is similar to the principal component analysis (PCA). While both methods use weight vectors for linear transformations, the autoencoder does not come with any indication similar to the eigenvalues in PCA that are paired with eigenvectors. In this work, we propose a novel autoencoder node saliency method that examines whether the features constructed by autoencoders exhibit properties related to known class labels. The supervised node saliency ranks the nodes based on their capability of performing a learning task. It is coupled with the normalized entropy difference (NED). We establish a property for NED values to verify classifying behaviors among the top ranked nodes. Lastly, by applying our methods to real datasets, we demonstrate their ability to provide indications on the performing nodes and explain the learned tasks in autoencoders.

97 MATHEMATICS AND COMPUTING↗