SEARCH · Search NASA

Results for “eigenvalue problems”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

SourceResearch connectionFrom yearThrough year

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

At least 415 records · Page 23

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Improved Cross Section Generation Capability of Griffin in FY22

The Griffin code is a Multiphysics Object-Oriented Simulation Environment (MOOSE) based reactor multiphysics analysis application jointly developed by Idaho National Laboratory and Argonne National Laboratory. The code includes a variety of deterministic steady-state transport solvers for fixed source, k-eigenvalue, adjoint, and subcritical multiplication as well as transient solvers for spatial dynamics with the improved quasi-static method. Griffin uses cross section data in the ISOXML format generated from external deterministic or Monte Carlo cross section generation codes. In recent years, the MC 2 -3 modules have been added to Griffin for fast reactor cross section generation, and the self-shielding application programming interface (SSAPI) was implemented in the ISOXML module for thermal reactor cross section generation. The on-the-fly slowing down method and double-heterogeneity treatment have been implemented to SSAPI and verified against particulate fuel-bearing graphite-moderated thermal reactor problems with high accuracy. This year, work has been focused on improving the cross section generation capability of ISOXML and streamlining the cross section generation procedures. In addition, the form function data were added to ISOXML in order to support the pin power reconstruction capability that was newly implemented in Griffin in this fiscal year. To facilitate the cross section generation using MC 2 -3 and SSAPI in Griffin, the cross section generation workflows have been set up for both fast and thermal spectrum reactors. The MOOSE action system tool was devised for fast spectrum problems, and the MOOSE stochastic tool was adopted to the branch calculation procedure for thermal spectrum problems. Meanwhile, to ensure the accuracy of group-constants, the thermal up-scattering kernel calculator accounting for resonance scattering was implemented in ISOXML, demonstrating the accurate computation of a Doppler-broadened scattering kernel of any Legendre order within a reasonable timescale. Other aspects of ISOXML, such as deletion solver and data, documentation, ISOXML file management, and the interface for Mixture, were improved as well.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2018

General Improvements to the MCNP Alpha-Eigenvalue Solver

In this document, a new algorithm for computing the α-eigenvalue is implemented and tested in MCNP. The algorithm follows the traditional k-α method in which neutrons are followed from birth until fission in batches. During this simulation, a number of tallies are performed which are derived from integrating the transport equation over all phase space. These new tallies along with the collapsed transport equation are used to compute a physically valid α with or without delayed neutrons. The performance and accuracy of the method is then tested, in which it is found that the new algorithm typically out- performs the current implementation while also representing a more complete physical picture. Through a convergence analysis, it was found that many simple test problems had unexpectedly large biases for reasonable quantities of neutrons per batch. This occurred with both the old and the new algorithm. However, the tally method had lower biases for all problems tested. Special implementation considerations are also discussed.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

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↗

DOE OSTI2023

Drude weights in one-dimensional systems with a single defect

Ballistic transport of a quantum system can be characterized by Drude weight, which quantifies the response of the system to a uniform electric field in the infinitely long timescale. The Drude weight is often discussed in terms of the Kohn formula, which gives the Drude weight by the derivative of the energy eigenvalue of a finite-size system with the periodic boundary condition in terms of the Aharonov-Bohm flux. Recently, the Kohn formula is generalized to nonlinear responses. However, the nonlinear Drude weight determined by the Kohn formula often diverges in the thermodynamic limit. In order to elucidate the issue, in this work we examine a simple example of a one-dimensional tight-binding model in the presence of a single defect at zero temperature. We find that its linear and nonlinear Drude weights given by the Kohn formula (i) depend on the Aharonov-Bohm flux and (ii) diverge proportionally to a power of the system size. Here, we argue that the problem can be attributed to different order of limits. The Drude weight according to the Kohn formula (“Kohn-Drude weight”) indicates the response of a finite-size system to an adiabatic insertion of the Aharonov-Bohm flux. While it is a well-defined physical quantity for a finite-size system, its thermodynamic limit does not always describe the ballistic transport of the bulk. The latter should be rather characterized by a “bulk Drude weight” defined by taking the thermodynamic limit first before the zero-frequency limit. While the potential issue of the order of limits has been sometimes discussed within the linear response, the discrepancy between the two limits is amplified in nonlinear Drude weights. We demonstrate the importance of the low-energy excitations of O(1/L), which are excluded from the Kohn-Drude weight, in regularizing the bulk Drude weight.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2019

Landau levels in the presence of a cosmic string in rainbow gravity

In this paper we analyze the energy levels of a charged scalar particle placed in the static cosmic string spacetime, under the action of a uniform magnetic field parallel to the string, in the context of the semi-classical approach of the rainbow gravity. Firstly, we focus on the non-relativistic regime by solving the corresponding Schrödinger equation, following by a complete relativistic treatment of the problem in which we considered the Klein–Gordon equation. In both cases we find exact expressions for the Landau levels in terms of the rainbow functions, used to characterize a rainbow gravity model. In order to achieve the results of this paper we considered three different rainbow gravity models mostly used in the literature and compare the resulting modifications in the Landau levels with the standard case, namely without rainbow gravity.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2021

Discrete Green’s functions and spectral graph theory for computationally efficient thermal modeling

Here, this work concerns solutions of the heat equation with the spectral graph method, for which the temperature is defined at discrete points in the domain and the spatial relationship among the points is described by a graph. The heat equation on the graph is solved using matrix techniques involving the eigenvectors and eigenvalues of the Laplacian matrix. The spectral graph approach precludes the computationally intensive meshing and numerous time-integration steps of the finite element method. In the present work, the spectral graph method is extended to include heat loss at the boundaries with a generalized boundary condition, and physics-based edge weights are introduced which simplify the calibration process. From this approach a discrete Green’s function is defined which allows for solutions under a variety of heating conditions including: space-varying initial conditions; time-and-space varying internal heating; and, time-and-space-varying heating at boundaries of type 1 (Dirichlet), type 2 (Neumann) and type 3 (Robin). Results are provided for benchmark heat transfer problems in one spatial dimension and in three spatial dimensions, and verification is provided by comparison with exact analytical solutions and finite difference solutions. The spectral graph method converges within 0.4% error of the analytical solution. The practical utility of the approach is demonstrated by thermal simulation of a multilayer additive manufacturing process. The spectral graph results are compared to experimentally-obtained temperature data for two metal parts, with error less than 5% of the experimental measurements, with computation time less than one minute on a desktop computer.

36 MATERIALS SCIENCE↗

DOE OSTI2023

Real-Time Krylov Theory for Quantum Computing Algorithms

Quantum computers provide new avenues to access ground and excited state properties of systems otherwise difficult to simulate on classical hardware. New approaches using subspaces generated by real-time evolution have shown efficiency in extracting eigenstate information, but the full capabilities of such approaches are still not understood. In recent work, we developed the variational quantum phase estimation (VQPE) method, a compact and efficient real-time algorithm to extract eigenvalues on quantum hardware. Here we build on that work by theoretically and numerically exploring a generalized Krylov scheme where the Krylov subspace is constructed through a parametrized real-time evolution, which applies to the VQPE algorithm as well as others. We establish an error bound that justifies the fast convergence of our spectral approximation. We also derive how the overlap with high energy eigenstates becomes suppressed from real-time subspace diagonalization and we visualize the process that shows the signature phase cancellations at specific eigenenergies. We investigate various algorithm implementations and consider performance when stochasticity is added to the target Hamiltonian in the form of spectral statistics. To demonstrate the practicality of such real-time evolution, we discuss its application to fundamental problems in quantum computation such as electronic structure predictions for strongly correlated systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Code Coverage Status of the ARC Code PERSENT

The Argonne Reactor Code (ARC) software system supports users in their fast reactor design goals by providing neutronic, thermal-hydraulic, and structural analysis capabilities. PERSENT fulfills the role of generating reactivity coefficients for a given time point of a REBUS calculation usable in a point kinetics based safety analysis capability. PERSENT also provides a sensitivity coefficient capability on eigenvalue, reactivity worth, and several other key coefficients that are used in the follow-on safety analysis. Given a co-variance matrix, PERSENT can carry out the uncertainty quantification to indicate the amount of error in the reactivity coefficients derived from the errors in the cross section measurements. With continued improvement of computational resources, many of the geometry modeling capabilities in DIF3D that were primarily used in low order schemes are not really needed anymore. Today, the diffusion and transport capabilities of DIF3D-VARIANT are primarily used in the reactor design process with some scattered usage of DIF3D-FD and DIF3D-Nodal. PERSENT is part of the ARC code system and is built around DIF3D-VARIANT and the flux solution it provides. The purpose of the present work is to identify a set of test problems for PERSENT and assess the code coverage of PERSENT for those test problems. PERSENT treats the DIF3D executable as an external executable and thus the code coverage considerations only need to focus on the PERSENT source code and only a fraction of the connected modules in the existing ARC software library. The goal is to document what parts of the existing PERSENT code are touched by the set of test problems and which are not. Because the verification work done on PERSENT was focused on the most common uses of PERSENT for fast reactor analysis, the code coverage assessment of those capabilities is the highest priority. This will ensure that nothing is being missed by the existing verification test problems that users of PERSENT rely upon. The code coverage analysis of PERSENT was performed with the Code Coverage Tool of the Intel Fortran compiler which requires modifications to the compilation of PERSENT. The detailed coverage tables are given for each submodule of PERSENT. Most of the uncovered parts/files could be easily ignored because they are either for error message and debugging output or not needed by PERSENT today. Only a few uncovered parts of PERSENT deserve extending the verification test suite.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2017

Monte Carlo Perturbation Theory Estimates of Sensitivities to System Dimensions

Here, Monte Carlo methods are developed using adjoint-based perturbation theory and the differential operator method to compute the sensitivities of the k-eigenvalue, linear functions of the flux (reaction rates), and bilinear functions of the forward and adjoint flux (kinetics parameters) to system dimensions for uniform expansions or contractions. The calculation of sensitivities to system dimensions requires computing scattering and fission sources at material interfaces using collisions occurring at the interface—which is a set of events with infinitesimal probability. Kernel density estimators are used to estimate the source at interfaces using collisions occurring near the interface. The methods for computing sensitivities of linear and bilinear ratios are derived using the differential operator method and adjoint-based perturbation theory and are shown to be equivalent to methods previously developed using a collision history–based approach. The methods for determining sensitivities to system dimensions are tested on a series of fast, intermediate, and thermal critical benchmarks as well as a pressurized water reactor benchmark problem with iterated fission probability used for adjoint-weighting. The estimators are shown to agree within 5% and 3σ of reference solutions obtained using direct perturbations with central differences for the majority of test problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2024

Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding embeds a properly scaled matrix of interest A in a larger unitary transformation U that can be decomposed into a product of simpler unitaries and implemented efficiently on a quantum computer. Although quantum algorithms can potentially achieve exponential speedup in solving linear algebra problems compared to the best classical algorithm, such a gain in efficiency ultimately hinges on our ability to construct an efficient quantum circuit for the block encoding of A, which is difficult in general, and not trivial even for well structured sparse matrices. Here, in this paper, we give a few examples on how efficient quantum circuits can be explicitly constructed for some well structured sparse matrices and discuss a few strategies used in these constructions. We also provide implementations of these quantum circuits in MATLAB.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

When and why PINNs fail to train: A neural tangent kernel perspective

Physics-informed neural networks (PINNs) have lately received great attention thanks to their flexibility in tackling a wide range of forward and inverse problems involving partial differential equations. However, despite their noticeable empirical success, little is known about how such constrained neural networks behave during their training via gradient descent. More importantly, even less is known about why such models sometimes fail to train at all. Here in this work, we aim to investigate these questions through the lens of the Neural Tangent Kernel (NTK); a kernel that captures the behavior of fully-connected neural networks in the infinite width limit during training via gradient descent. Specifically, we derive the NTK of PINNs and prove that, under appropriate conditions, it converges to a deterministic kernel that stays constant during training in the infinite-width limit. This allows us to analyze the training dynamics of PINNs through the lens of their limiting NTK and find a remarkable discrepancy in the convergence rate of the different loss components contributing to the total training error. To address this fundamental pathology, we propose a novel gradient descent algorithm that utilizes the eigenvalues of the NTK to adaptively calibrate the convergence rate of the total training error. Finally, we perform a series of numerical experiments to verify the correctness of our theory and the practical effectiveness of the proposed algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Validation of MPACT BWR capabilities against critical experiments

Over the years, significant validation work for the neutronics code MPACT has been performed against zero-power critical benchmarks and measured data from operating nuclear power plants. As a part of the Modeling and Analysis of Exelon BWRs for Eigenvalue and Thermal Limits Predictability project, new validation efforts relevant to boiling water reactor (BWR) core applications have been performed. This paper presents the results of the critical experiment portion of the BWR validation efforts for MPACT. The Kritz-4 experiments and IPEN/MB-01 BWR-relevant configurations are modeled with MPACT. The Kritz-4 BWR critical experiments were performed at both cold and hot conditions, which is a unique feature among other critical experiment facilities. The MPACT results with linear source (LS) Method of Characteristics (MOC) have very good agreement with the measured criticality. When using the 60-group BWR library with LS and P2 scattering, the maximum k{sub eff} error is 109 pcm, and the average cold-hot bias is only -0.11 pcm/K. The fission rate distributions of MPACT are also verified with Serpent calculations. For the IPEN facility, two configurations are considered: one with a large central void, and one with a cruciform control rod. The MPACT k{sub eff} errors are less than 50 pcm for all IPEN problems. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2016

The direct criterion of Newcomb for the ideal MHD stability of an axisymmetric toroidal plasma

A method is presented for determining the ideal magnetohydrodynamic stability of an axisymmetric toroidal plasma, based on a toroidal generalization of the method developed by Newcomb for fixed-boundary modes in a cylindrical plasma. For toroidal mode number n≠0, the stability problem is reduced to the numerical integration of a high-order complex system of ordinary differential equations, the Euler-Lagrange equation for extremizing the potential energy, for the coupled amplitudes of poloidal harmonics m as a function of the radial coordinate ψ in a straight-fieldline flux coordinate system. Unlike the cylindrical case, different poloidal harmonics couple to each other, which introduces coupling between adjacent singular intervals. A boundary condition is used at each singular surface, where m = nq and q(ψ) is the safety factor, to cross the singular surface and continue the solutions beyond it. Fixed-boundary instability is indicated by the vanishing of a real determinant of a Hermitian complex matrix constructed from the fundamental matrix of solutions, the generalization of Newcomb's crossing criterion. In the absence of fixed-boundary instabilities, an M × M plasma response matrix W P with M the number of poloidal harmonics used, is constructed from the Euler-Lagrange solutions at the plasma-vacuum boundary. This is added to a vacuum response matrix W V to form a total response matrix W T . Finally, the existence of negative eigenvalues of W T indicates the presence of free-boundary instabilities. The method is implemented in the fast and accurate DCON code.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2017

CUDA Enabled Graph Subset Examiner

Finding Godsil-McKay switching sets in graphs is one way to demonstrate that a specific graph is not determined by its spectrum--the eigenvalues of its adjacency matrix. An important area of active research in pure mathematics is determining which graphs are determined by their spectra, i.e. when the spectrum of the adjacency matrix uniquely determines the underlying graph. We are interested in exploring the spectra of graphs in the Johnson scheme and specifically seek to determine which of these graphs are determined by their spectra. Given a graph G, a Godsil-McKay switching set is an induced subgraph H on 2k vertices with the following properties: I) H is regular, ii) every vertex in G/H is adjacent to either 0, k, or 2k vertices of H, and iii) at least one vertex in G/H is adjacent to k vertices in H. The software package examines each subset of a user specified size to determine whether or not it satisfies those 3 conditions. The software makes use of the massive parallel processing power of CUDA enabled GPUs. It also exploits the vertex transitivity of graphs in the Johnson scheme by reasoning that if G has a Godsil-McKay switching set, then it has a switching set which includes vertex 1. While the code (in its current state) is tuned to this specific problem, the method of examining each induced subgraph of G can be easily re-written to check for any user specified conditions on the subgraphs and can therefore be used much more broadly.

Johnston, JeremyT.↗

DOE OSTI2016

CUDA Enabled Graph Subset Examiner

Johnston, Jeremy T.↗

DOE OSTI2017

Liquid-gas phase transitions and C K symmetry in quantum field theories

A general field-theoretic framework for the treatment of liquid-gas phase transitions is developed. Starting from a fundamental four-dimensional field theory at nonzero temperature and density, an effective three-dimensional field theory is derived. The effective field theory has a sign problem at finite density. Although finite density explicitly breaks charge conjugation C , there remains a symmetry under C K , where K is complex conjugation. Here, we consider four models: relativistic fermions, nonrelativistic fermions, static fermions and classical particles. The interactions are via an attractive potential due to scalar field exchange and a repulsive potential due to massive vector exchange. The field-theoretic representation of the partition function is closely related to the equivalence of the sine-Gordon field theory with a classical gas. The thermodynamic behavior is extracted from C K -symmetric complex saddle points of the effective field theory at tree level. In the cases of nonrelativistic fermions and classical particles, we find complex saddle point solutions but no first-order transitions, and neither model has a ground state at tree level. The relativistic and static fermions show a liquid-gas transition at tree level in the effective field theory. The liquid-gas transition, when it occurs, manifests as a first-order line at low temperature and high density, terminated by a critical end point. The mass matrix controlling the behavior of correlation functions is obtained from fluctuations around the saddle points. Due to the C K symmetry of the models, the eigenvalues of the mass matrix are not always real but can be complex. This then leads to the existence of disorder lines, which mark the boundaries where the eigenvalues go from purely real to complex. The regions where the mass matrix eigenvalues are complex are associated with the critical line. In the case of static fermions, a powerful duality between particles and holes allows for the analytic determination of both the critical line and the disorder lines. Depending on the values of the parameters, either zero, one, or two disorder lines are found. Our numerical results for relativistic fermions give a very similar picture.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2019

Ex-Core Radiation Transport Modeling with VERA User Manual

It is important to be able to accurately predict the neutron flux outside the immediate reactor core for a variety of safety and material analyses. Monte Carlo radiation transport calculations are required to produce these high–fidelity ex-core responses. The Virtual Environment for Reactor Applications (VERA) provides the automated capability to launch independent Shift fixed-source and eigenvalue Monte Carlo (MC) calculations for user-specified state points during a standard Virtual Environment for Reactor Applications (VERA) calculation. VERA couples MPACT with COBRA-TF (CTF) to Shift to perform ex-core tallies for multiple state points concurrently, with each component capable of parallel execution on independent processor domains. In these ex-core calculations, MPACT is coupled to CTF and performs the in-core depletion and heat transfer calculation, followed by a fixed-source Shift transport calculation including ex-core regions to produce ex-core responses. The fission source, fuel pin temperatures, moderator temperature and density, boron concentration, and fuel pin depleted isotopic compositions can be transferred to Shift from the MPACT calculation. Specifically, VERA performs fluence calculations in the core barrel outward to the end of the pressure vessel and detector response calculations in ex-core detectors. It also performs the requested tallies in any user-defined ex-core regions. VERA takes advantage of the General Geometry (GG) package in Shift. This gives VERA the flexibility to explicitly model features outside the core barrel, including detailed vessel models, detectors, and power plant details. A very limited set of experimental and numerical benchmarks is available for ex-core simulation comparison. The Consortium for Advanced Simulation of Light Water Reactors has developed a set of ex-core benchmark problems to include as part of the VERA verification and validation set of problems. The ex-core capability in VERA has been tested on small representative assembly problems, multi-assembly problems, as well as quarter-core and full-core problems. VERA View has also been extended to visualize these vessel fluence results from VERA. This manual serves to present a guide to VERA users about the methodology behind ex-core calculations and the details of input, output, and analysis of results from these calculations. Details in this version of the manual are based on features in VERA 4.0.1.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2018

Interparameter trade-off quantification and reduction in isotropic-elastic full-waveform inversion: synthetic experiments and Hussar land data set application

The problem of inverting for multiple physical parameters in the subsurface using seismic full-waveform inversion (FWI) is complicated by interparameter trade-off arising from inherent ambiguities between different physical parameters. Parameter resolution is often characterized using scattering radiation patterns, but these neglect some important aspects of interparameter trade-off. More general analysis and mitigation of interparameter trade-off in isotropic-elastic FWI is possible through judiciously chosen multiparameter Hessian matrix-vector products. We show that products of multiparameter Hessian off-diagonal blocks with model perturbation vectors, referred to as interparameter contamination kernels , are central to the approach. We then apply the multiparameter Hessian to various vectors designed to provide information regarding the strengths and characteristics of interparameter contamination, both locally and within the whole volume. With numerical experiments, we observe that S-wave velocity perturbations introduce strong contaminations into density and phase-reversed contaminations into P-wave velocity, but themselves experience only limited contaminations from other parameters. Based on these findings, we introduce a novel strategy to mitigate the influence of interparameter trade-off with approximate contamination kernels. Furthermore, we recommend that the local spatial and interparameter trade-off of the inverted models be quantified using extended multiparameter point spread functions (EMPSFs) obtained with pre-conditioned conjugate-gradient algorithm. Compared to traditional point spread functions, the EMPSFs appear to provide more accurate measurements for resolution analysis, by de-blurring the estimations, scaling magnitudes and mitigating interparameter contamination. Approximate eigenvalue volumes constructed with stochastic probing approach are proposed to evaluate the resolution of the inverted models within the whole model. With a synthetic Marmousi model example and a land seismic field data set from Hussar, Alberta, Canada, we confirm that the new inversion strategy suppresses the interparameter contamination effectively and provides more reliable density estimations in isotropic-elastic FWI as compared to standard simultaneous inversion approach.

58 GEOSCIENCES↗