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 73 records · Page 4

Analysis of SCALE Criticality and Sensitivity Calculations for Reflected HEU Cylinders [Abstract]

The SCALE code package offers several nuclear data libraries to support Monte Carlo (MC) transport, as well as MC-based derivation of $\kappa$ eff sensitivity and uncertainty (S/U) data. The CSAS sequence using the KENO MC code can utilize continuous-energy (CE) cross sections, or pre-generated multigroup (MG) cross section libraries. The use of MG libraries introduces bias into calculations in exchange for faster transport solutions. The TSUNAMI-3D sequence also utilizes KENO MC calculations. TSUNAMI-3D has two CE calculational methods: the Iterated Fission Probability (IFP) method, and the Contribution-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance CHaracterization (CLUTCH) method. Previous work has shown poor agreement between CLUTCH and confirmatory direct perturbation calculations in specific applications, e.g., fissionable and polyethylene reflectors

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Multigrid Algorithms with Projection and Prolongation over Elements of the Phase Space for K-Eigenvalue Transport Problems

This paper describes new multilevel acceleration methods for solving the multigroup neu- tron transport eigenvalue problems. These multilevel algorithms use different projection and prolongation operators in the phase space. The Nonlinear Diffusion Acceleration (NDA) method with multiple grids in energy is formulated with the prolongation oper- ator based on multiplication iterative correction and linear-in-energy mapping. Another multilevel NDA method uses the projection operator with coarsening in energy between the high-order transport and low-order NDA equations. The third algorithm is formu- lated with the partial-current based CMFD low-order equations and applies projection operators in space and energy. The numerical results are presented.

Cornejo, Luke↗

Learning in Modal Space: Solving Time-Dependent Stochastic PDEs Using Physics-Informed Neural Networks

One of the open problems in scientific computing is the long-time integration of nonlinear stochastic partial differential equations (SPDEs), especially with arbitrary initial data. We address this problem by taking advantage of recent advances in scientific machine learning and the spectral dynamically orthogonal (DO) and borthogonal (BO) methods for representing stochastic processes. The recently introduced DO/BO methods reduce the SPDE to solving a system of deterministic PDEs and a system of stochastic ordinary differential equations. Specifically, we propose two new physics-informed neural networks (PINNs) for solving time-dependent SPDEs, namely the neural network (NN)-DO/BO methods. The proposed methods incorporate the DO/BO constraints into the loss function (along with the modal decomposition of the SPDE) with an implicit form instead of generating explicit expressions for the temporal derivatives of the DO/BO modes. Hence, the NN-DO/BO methods can overcome some of the drawbacks of the original DO/BO methods. For example, we do not need the assumption that the covariance matrix of the random coefficients is invertible as in the original DO method, and we can remove the assumption of no eigenvalue crossing as in the original BO method. Moreover, the NN-DO/BO methods can be used to solve time-dependent stochastic inverse problems with the same formulation and same computational complexity as for forward problems. Furthermore, we demonstrate the capability of the proposed methods via several numerical examples, namely: (1) A linear stochastic advection equation with deterministic initial condition: we obtain good results with the proposed methods, while the original DO/BO methods cannot be applied directly in this case. (2) Long-time integration of the stochastic Burgers' equation: we show the good performance of NN-DO/BO methods, especially the effectiveness of the NN-BO approach for such problems with many eigenvalue crossings during the whole time evolution, while the original BO method fails. (3) Nonlinear reaction diffusion equation: we consider both the forward problem and the inverse problems, including very noisy initial point values, to investigate the flexibility of the NN-DO/BO methods in handling inverse and mixed type problems. Taken together, these simulation results demonstrate that the NN-DO/BO methods can be employed to effectively quantify uncertainty propagation in a wide range of physical problems, but future work should address the efficiency issue of PINNs for forward problems.

97 MATHEMATICS AND COMPUTING↗

Analysis of SCALE Criticality and Sensitivity Calculations for Reflected HEU Cylinders

The SCALE code package offers multiple nuclear data libraries and sensitivity and uncertainty (S/U) methods supporting and derived from Monte Carlo (MC) transport. The CSAS and TSUNAMI-3D sequences use KENO MC, utilizing either continuous-energy (CE) cross sections or multigroup (MG) cross section libraries. TSUNAMI-3D has two CE calculational methods: the iterated fission probability (IFP) method, and the Contribution-Linked eigenvalue sensitivity/Uncertainty estimation via Tracklength importance CHaracterization (CLUTCH) method. Previous work has shown poor agreement between CLUTCH and confirmatory direct perturbation calculations in specific applications (e.g., fissionable and polyethylene reflectors). The HEU-MET-FAST-084 (HMF-084) International Criticality Safety Benchmark Evaluation Project evaluation consists of 27 cylindrical highly enriched uranium metal cores with 14 unique reflector materials of 0.5 and 1 in. thicknesses. Included in this list of reflector materials are natural uranium and polyethylene. This work utilized SCALE 6.2.4 models of the HMF-084 evaluation, with additional non-physical configurations to test both the MG bias and CLUTCH functionality across a variety of reflector material thicknesses. The evaluation’s use of concentric cylinders allowed for examination of several MG self-shielding methods: infinite homogenous, cylindrical, and spherical. The results indicate that the use of polyethylene reflectors with CLUTCH is not fundamentally impossible but sensitive to geometry. The poor performance of CLUTCH with fissionable reflectors was reaffirmed. The 2 in. and greater polyethylene-reflected calculations demonstrate the necessity of using the 302-group library for fast systems. The nickel MG bias was substantial, as discussed in a companion paper, as were cobalt and iron.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method

Quantum phase estimation is one of the most powerful quantum primitives. This work proposes a new approach for the problem of multiple eigenvalue estimation: Quantum Multiple Eigenvalue Gaussian filtered Search (QMEGS). QMEGS leverages the Hadamard test circuit structure and only requires simple classical postprocessing. QMEGS is the first algorithm to simultaneously satisfy the following two properties: (1) It can achieve the Heisenberg-limited scaling without relying on any spectral gap assumption. (2) With a positive energy gap and additional assumptions on the initial state, QMEGS can estimate all dominant eigenvalues to ϵ accuracy utilizing a significantly reduced circuit depth compared to the standard quantum phase estimation algorithm. In the most favorable scenario, the maximal runtime can be reduced to as low as log(1/ϵ). This implies that QMEGS serves as an efficient and versatile approach, achieving the best-known results for both gapped and gapless systems. Numerical results validate the efficiency of our proposed algorithm in various regimes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computing resonant modes of accelerator cavities by solving nonlinear eigenvalue problems via rational approximation

Here, we present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems arising from the modeling of particle accelerator cavities. The eigenvalue nonlinearity in these problems results from the use of waveguides to couple external power sources or to allow certain excited electromagnetic modes to exit the cavity. We use a rational approximation to reduce the nonlinear eigenvalue problem first to a rational eigenvalue problem. We then apply a special linearization procedure to turn the rational eigenvalue problem into a larger linear eigenvalue problem with the same eigenvalues, which can be solved by existing iterative methods. By using a compact scheme to represent both the linearized operator and the eigenvectors to be computed, we obtain a numerical method that only involves solving linear systems of equations of the same dimension as the original nonlinear eigenvalue problem. We refer to this method as a compact rational Krylov (CORK) method. We implemented the CORK method in the Omega3P module of the Advanced Computational Electromagnetic 3D Parallel (ACE3P) simulation suite and validated it by comparing the computed cavity resonant frequencies and damping Q factors of a small model problem to those obtained from a fitting procedure that uses frequency responses computed by another ACE3P module called S3P. We also used the CORK method to compute trapped modes damped in an ideal eight 9-cell SRF cavity cryomodule. This was the first time it was possible to compute these modes directly. The damping Q factors of the computed modes match well with those measured in experiments and the difference in resonant frequencies is within the range introduced by cavity imperfection. Therefore, the CORK method is an extremely valuable tool for computational cavity design.

43 PARTICLE ACCELERATORS↗

Design, analysis and numerical experiments for the virtual element p and hp approximations of elliptic eigenvalue problems

We discuss the p- and the hp-versions of the virtual element method for the approximation of the eigenvalues of elliptic operators with a potential term on polygonal meshes. An application of this model is provided by the Schr¨odinger equation with a pseudo-potential term. We present in details the analysis of the p-version of the method, proving the exponential convergence in the case of analytic eigenfunctions. The theoretical results are supplied with a wide set of experiments. We also show numerically that, in the case of eigenfunctions with finite Sobolev regularity, an exponential approximation of the eigenvalues in terms of the cubic root of the number of degrees of freedom can be obtained by employing hp-refinements. Importantly, the geometric flexibility of polygonal meshes is exploited in the construction of the hp-spaces.

97 MATHEMATICS AND COMPUTING↗

Reducing Operator Complexity of Galerkin Coarse-grid Operators with Machine Learning

Here, we propose a data-driven and machine-learning-based approach to compute non-Galerkin coarse-grid operators in multigrid (MG) methods, addressing the well-known issue of increasing operator complexity. Guided by the MG theory on spectrally equivalent coarse-grid operators, we have developed novel machine learning algorithms that utilize neural networks combined with smooth test vectors from multigrid eigenvalue problems. The proposed method demonstrates promise in reducing the complexity of coarse-grid operators while maintaining overall MG convergence for solving parametric partial differential equation problems. Numerical experiments on anisotropic rotated Laplacian and linear elasticity problems are provided to showcase the performance and comparison with existing methods for computing non-Galerkin coarse-grid operators.

97 MATHEMATICS AND COMPUTING↗

A Multilevel in Space and Energy Solver for 3-D Multigroup Diffusion and Coarse-Mesh Finite Difference Eigenvalue Problems

The Multilevel in Space and Energy Diffusion (MSED) method accelerates the iterative convergence of multigroup diffusion eigenvalue problems by performing work on lower-order equations with only one group and/or coarser spatial grids. It consists of two primary components: (1) a grey (one-group) diffusion eigenvalue problem that is solved via Wielandt-shifted power iteration (PI) and (2) a multigrid-in-space linear solver. In previous work, the efficiency of MSED was verified using Fourier analysis and numerical results from a one-dimensional multigroup diffusion code. Since that work, MSED has been implemented as a solver for the coarse-mesh finite difference (CMFD) system in the three-dimensional Michigan Parallel Characteristics Transport (MPACT) code. In this paper, the results from the implementation of MSED in MPACT are introduced, and the changes needed to make MSED more suitable for MPACT are described. For problems without feedback, the conclusions in this paper show that MSED can reduce the CMFD run time by an order of magnitude and the overall run time by a factor of 2 to 3 compared to the default CMFD solver in MPACT [PI with the generalized minimal residual (GMRES) method]. For problems with feedback, the convergence of the outer Picard iteration scheme is worsened by the well-converged CMFD solutions produced by the standard MSED method. To overcome this unintuitive deficiency, MSED may be run with looser convergence criteria (a modified version of the MSED method called MSED-L) to circumvent the issue until the multiphysics iteration in MPACT is improved. Results show that MSED-L can reduce the CMFD run time in MPACT by an order of magnitude, without negatively impacting the outer Picard iteration scheme.

3-D↗

Stochastic gradient descent for optimization for nuclear systems

The use of gradient descent methods for optimizing k-eigenvalue nuclear systems has been shown to be useful in the past, but the use of k-eigenvalue gradients have proved computationally challenging due to their stochastic nature. ADAM is a gradient descent method that accounts for gradients with a stochastic nature. This analysis uses challenge problems constructed to verify if ADAM is a suitable tool to optimize k-eigenvalue nuclear systems. ADAM is able to successfully optimize nuclear systems using the gradients of k-eigenvalue problems despite their stochastic nature and uncertainty. Furthermore, it is clearly demonstrated that low-compute time, high-variance estimates of the gradient lead to better performance in the optimization challenge problems tested here.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗

Statistical uncertainty of fission matrix eigenvalues using perturbation theory

Eigenvalue search of high dominance ratio systems may be slow to converge. The fission matrix element is defined by its element (FM){sub ij}, which are the probability for a neutron born in cell i to create a fission in cell j for a spatial mesh of n{sub i}*n{sub j} elements. Fission matrices are used in Monte Carlo criticality simulations to enhance computing speed, but also to find higher order eigenvalues. However, few studies have been made on the link between statistical uncertainties of fission matrix elements and eigenvalues uncertainties. Thus, dominance ratio statistical uncertainties remain unknown. This paper uses a new generalized perturbation theory (GPT) method to estimate sensitivities of eigenvalues to fission matrix elements and then to calculate dominance ratio uncertainties.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Accelerating eigenvalue computation for nuclear structure calculations via perturbative corrections

Subspace projection methods utilizing perturbative corrections have been proposed for computing the lowest few eigenvalues and corresponding eigenvectors of large Hamiltonian matrices. In this paper, we build upon these methods and introduce the term Subspace Projection with Perturbative Corrections (SPPC) method to refer to this approach. We tailor the SPPC for nuclear many-body Hamiltonians represented in a truncated configuration interaction subspace, i.e., the no-core shell model (NCSM). We use the hierarchical structure of the NCSM Hamiltonian to partition the Hamiltonian as the sum of two matrices. The first matrix corresponds to the Hamiltonian represented in a small configuration space, whereas the second is viewed as the perturbation to the first matrix. Eigenvalues and eigenvectors of the first matrix can be computed efficiently. Because of the split, perturbative corrections to the eigenvectors of the first matrix can be obtained efficiently from the solutions of a sequence of linear systems of equations defined in the small configuration space. These correction vectors can be combined with the approximate eigenvectors of the first matrix to construct a subspace from which more accurate approximations of the desired eigenpairs can be obtained. We show by numerical examples that the SPPC method can be more efficient than conventional iterative methods for solving large-scale eigenvalue problems such as the Lanczos, block Lanczos and the locally optimal block preconditioned conjugate gradient (LOBPCG) method. The method can also be combined with other methods to avoid convergence stagnation.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The Klein–Gordon Oscillator in (1+2)-dimensions Gurses space–time backgrounds

In this article, we investigate the relativistic quantum dynamics of spin-0 massive charged-free particles in (1+2)-dimensions Gurses space–time Gurses (1994) backgrounds, and analyze the effects on the energy eigenvalue. We solve the Klein–Gordon Oscillator in the considered framework without interactions using the Nikiforov–Uvarov (NU) method and evaluate the energy eigenvalues and corresponding eigenfunctions, in detail.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Parametric Comparative Analysis between Virtual Synchronous Generator and Droop-based Inertia for Inverter-Based Microgrids

This paper presents a parametric comparative analysis between the virtual synchronous generator (VSG) method and the droop control method to emulate inertia in the voltage-source inverter (VSI). Droop controllers are commonly used to regulate sharing power in microgrids and distribute power generation proportionally among VSI’s depending on their rated power. Additionally, VSG has been used to regulate the Rate-of-Change-of-Frequency (RoCoF) of the microgrid using virtual inertia. Although both methods can be used to regulate the frequency variation, the influence of each method on the closed loop eigenvalues is not the same. In this work, the transient response of the frequency is analyzed for each method to determine their advantages and disadvantages regarding frequency regulation in microgrid applications. The results were verified by conducting experimental trials using VSI’s. These experiments demonstrated that VSG is more suitable for regulating RoCoF and frequency nadir than droop controllers since it provides inertial support and improves frequency response.

Campo-Ossa, Daniel D.↗

Oscillation, Rotation, and Wandering of Solutions to Linear Differential Systems

For solutions of a linear system on the semi-axis, we introduce a series of Lyapunov exponents that describe the oscillation, rotation, and wandering properties of these solutions. In the case of systems with constant matrices, these exponents are closely related to the imaginary parts of the eigenvalues. We examine the problem on the existence of a similar relationship in the case of piecewise constant of arbitrary systems.

97 MATHEMATICS AND COMPUTING↗

Quadrupole topological photonic crystals

Quadrupole topological phases, exhibiting protected boundary states that are themselves topological insulators of lower dimensions, have recently been of great interest. Extensions of these ideas from current tight binding models to continuum theories for realistic materials require the identification of quantized invariants describing the bulk quadrupole order. Here we identify the analog of quadrupole order in Maxwell’s equations for a gyromagnetic photonic crystal (PhC) through a double-band-inversion process. The quadrupole moment is quantized by the simultaneous presence of crystalline symmetry and broken time-reversal symmetry, which is confirmed using three independent methods: analysis of symmetry eigenvalues, numerical calculations of the nested Wannier bands and the expectation value of the quadrupole operator. Furthermore, we reveal the boundary manifestations of quadrupole phases as quantized edge polarizations and fractional corner charges. The latter are the consequence of a filling anomaly of energy bands as first predicted in electronic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗