Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Krylov”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Multiphysics coupling plan

In this chapter, multiphysics coupling simulations of nuclear reactor systems are reviewed. On the one hand, the mainstream methods of multiphysics coupling are demonstrated. The fundamental theory and coupling scheme of operator splitting methods, Jacobian-free Newton–Krylov methods, and approximate block Newton methods are summarized and presented. On the other hand, some significant works on neutronic and thermal-hydraulic codes coupling, and large research project, including NURESAFE European project, Multiphysics Object-Oriented Simulation Environment plan, and Consortium for the Advanced Simulation of Light Water Reactors project, are reviewed. This chapter helps the readers have a better understanding on the worldwide current status of multiphysics coupling research.

Gui, Miao↗
DOE OSTI2020

Approximate Inverse Chain Preconditioner: Iteration Count Case Study for Spectral Support Solvers

As the growing availability of computational power slows, there has been an increasing reliance on algorithmic advances. However, faster algorithms alone will not necessarily bridge the gap in allowing computational scientists to study problems at the edge of scientific discovery in the next several decades. Often, it is necessary to simplify or precondition solvers to accelerate the study of large systems of linear equations commonly seen in a number of scientific fields. Preconditioning a problem to increase efficiency is often seen as the best approach; yet, preconditioners which are fast, smart, and efficient do not always exist. Following the progress of [1], we present a new preconditioner for symmetric diagonally dominant (SDD) systems of linear equations. These systems are common in certain PDEs, network science, and supervised learning among others. Based on spectral support graph theory, this new preconditioner builds off of the work of [2], computing and applying a V-cycle chain of approximate inverse matrices. This preconditioner approach is both algebraic in nature as well as hierarchically-constrained depending on the condition number of the system to be solved. Due to its generation of an Approximate Inverse Chain of matrices, we refer to this as the AIC preconditioner. We further accelerate the AIC preconditioner by utilizing precomputations to simplify setup and multiplications in the con-text of an iterative Krylov-subspace solver. While these iterative solvers can greatly reduce solution time, the number of iterations can grow large quickly in the absence of good preconditioners. Initial results for the AIC preconditioner have shown a very large reduction in iteration counts for SDD systems as compared to standard preconditioners such as Incomplete Cholesky (ICC) and Multigrid (MG). We further show significant reduction in iteration counts against the more advanced Combinatorial Multigrid (CMG) preconditioner. We have further developed no-fill sparsification techniques to ensure that the computational cost of applying the AIC preconditioner does not grow prohibitively large as the depth of the V-cycle grows for systems with larger condition numbers. Our numerical results have shown that these sparsifiers maintain the sparsity structure of our system while also displaying significant reductions in iteration counts.1 2

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

An Efficient Time-Domain Model to Simulate Parametric Resonances in a Floating Body Free to Move in Six Degrees of Freedom: Preprint

We present a computationally efficient time-domain model capable of simulating parametric resonances in a floating body in waves. The model assumes all wave forces to be linear, but the inertia and restoring forces acting on the body are expanded to second order in body motions. The simulation speed on a standard computer is approximately 40 times faster than real time. The model is applied to a soft-moored floating axisymmetric body which absorbs energy through heave, but is otherwise free to move in six degrees of freedom. Under certain conditions, we show that the body responds parametrically with large amplitudes not only in surge and pitch, but also in sway, roll, and yaw, provided it is given some small initial displacement in one of these out-of-plane modes. The predictions are confirmed by simulations using state-of-the-art nonlinear Froude-Krylov and computational fluid dynamics models.

parametric resonance↗
DOE OSTI2022

Improvements to the Griffin Transport Solvers

Griffin 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 steady-state solvers for fixed-source, k-eigenvalue, adjoint, and subcritical multiplication, as well as transient solvers for point-kinetics, improved quasi-static, and spatial dynamics. This document summarizes the transport solver development efforts pursued during Fiscal Year 2022. We added the multiphysics transient capability for the coarse-mesh finite difference accelerated Richardson iteration for discontinuous finite element method discrete ordinates (DFEM-SN) scheme to support high-order heterogeneous transport simulations. HFEM (hybrid finite element method) - PN (spherical harmonics expansion) was completed and red-black iteration was added for solving the HFEM-PN system with both preconditioned Jacobian-free Newton Krylov and Richardson iteration solvers. The HFEM-PN scheme, as one of the low-order transport schemes, is expected for supporting routine design simulations. Pin power reconstruction capability was also designed and implemented with the Griffin ISOXML module to enhance all the low-order transport solvers for more accurate multiphysics simulations. Numerical results are presented for demonstrating the capabilities and verifying their performance, and future works are discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Preliminary Monte Carlo and Thermal Hydraulic Analysis using a Hybrid ETF-Corrected-Diffusion Prediction Block

This paper builds upon previous work to accelerate the Picard iteration (PI) method typically applied for coupled Monte Carlo-Thermal hydraulic (MC-TH) solutions. Previously, the use of the generalized transfer functions (GTFs) to predict variation in macroscopic cross sections following a perturbation in TH properties was demonstrated for a subset of simple 3D problems. In addition, the reduced-order transport prediction block relied on the first order perturbation (FOP) method, which was shown to have computational overheads. Recent work replaced the FOP block with a 1-group nodal diffusion solver to eliminate these overheads. While the use of diffusion is desirable for large-scale problems, the new solver introduces significant homogenization error. This work aims to address this issue by using the Jacobian-Free Newton Krylov (JFNK) method to generate a set of super homogenization (SPH) factors to improve the accuracy of the diffusion solution. The SPH factors will be used in conjunction with an improved cross section prediction method – the expanded transfer function (ETF) method – to produce a highly accurate flux prediction for an axial 1D boiling water reactor (BWR) pincell following a large perturbation in moderator density. The ETF-corrected diffusion (ETF-CD) block is shown to be highly accurate for the 1D test case. Future work will investigate the accuracy of the method for a realistic 3D pressurized water reactor core.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

A flexible linear diffusion acceleration to k-eigenvalue neutron transport with SN discontinuous finite element method

In this paper, we derive a flexible linear diffusion acceleration (LDA) for k-eigenvalue neutron transport discretized with discontinuous finite element method (DFEM) and discrete ordinates(SN). This LDA is based on our two pieces of previous works: the flexible non linear diffusion acceleration (NDA) for DFEM-SN and LDA for k-eigenvalue neutron transport using pre-conditioned Jacobian-free Newton-Krylov with self-adjoint angular flux (SAAF), continuous finite element method(CFEM), and SN. We point out the differences between LDA and NDA for DFEM-SN and the difference between DFEM-SN and SAAF-CFEM-SN for LDA. Numerical tests are presented to compare the convergence behaviour of NDA and LDA. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

Analysis of cell-based diffusion acceleration for the slice balance approach

In this work, we perform analysis on the use of cell-based diffusion acceleration methodologies to accelerate the convergence of transport solutions discretized with the slice balance approach (SBA) on unstructured polygonal grids.We investigated both linear diffusion synthetic acceleration (DSA) and non linear diffusion acceleration (NDA), including its partial-current variant (pNDA). DSA and NDA were both shown to diverge for intermediate ranges of mesh optical thicknesses. However, pNDA and Krylov methods like GMRES and Broyden stabilized the acceleration schemes, including problems with degenerate cells formed by mesh refinement. (author)

42 ENGINEERING↗
DOE OSTI2022

Investigation of methods for targeted search of dominant higher modes in subcritical systems

The reactor physics modeling of subcritical systems requires a substantially different approach from that of a critical reactor due to the presence of the so-called higher modes. Earlier investigations showed that the dominant higher modes lie in the inner part of the eigenvalue spectrum, making the conventional eigenvalue searches unfeasible and calling for a targeted search. This paper investigates the possibility of targeted and multitudinous eigenvalue calculation by testing the Krylov-Schur and the Dynamic Modes Decomposition (DMD) method for simple, analytically tractable problems. While the DMD method clearly showed its efficiency in a one-group homogeneous problem, modal analysis of a three-dimensional reflected reactor in two-groups approximation demonstrated that the increasing complexity poses challenges for both methods. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗
DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗
DOE OSTI2022

Magnetic exchange interactions in binuclear and tetranuclear iron(III) complexes described by spin‐flip DFT and Heisenberg effective Hamiltonians

Abstract Low‐energy spectra of single‐molecule magnets (SMMs) are often described by Heisenberg Hamiltonians. Within this formalism, exchange interactions between magnetic centers determine the ground‐state multiplicity and energy separation between the ground and excited states. In this contribution, we extract exchange coupling constants ( J ) for a set of iron (III) binuclear and tetranuclear complexes from all‐electron calculations using non‐collinear spin‐flip time‐dependent density functional theory (NC‐SF‐TDDFT). For 12 binuclear complexes with J ‐values ranging from −6 to −132 cm −1 , our benchmark calculations using the short‐range hybrid ω PBEh functional and 6‐31G(d,p) basis set agree well with the experimentally derived values (mean absolute error of 4.7 cm −1 ). For the tetranuclear SMMs, the computed J constants are within 6 cm −1 from the experimentally derived values. We explore the range of applicability of the Heisenberg model by analyzing bonding patterns in these Fe(III) complexes using natural orbitals (NO), their occupations, and the number of effectively unpaired electrons. The results illustrate the efficiency of the spin‐flip protocol for computing the exchange couplings and the utility of the NO analysis in assessing the validity of effective spin Hamiltonians.

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

AIMD‐Based Protocols for Modeling Exciplex Fluorescence Spectra and Inter‐System Crossing in Photocatalytic Chromophores

ABSTRACT This study introduces a computational protocol for modeling the emission spectra of exciplexes using excited‐state ab initio molecular dynamics (AIMD) simulations. The protocol is applied to a model exciplex formed by oligo‐p‐phenylenes (OPPs) and triethylamine (TEA), which is of interest in the context of photocatalytic reduction of . AIMD facilitates efficient sampling of the conformational space of OPP3 and OPP4 exciplexes with TEA, offering a dynamic alternative to previously employed static methods. The AIMD‐based protocol successfully reproduces experimental emission spectra for OPP‐TEA exciplexes, agreeing with previous computational and experimental findings. The results show that AIMD simulations provide an efficient means of sampling the conformational space of these exciplexes, requiring less user input and, in some instances, fewer computational resources than multiple excited‐state optimizations initiated from user‐specified initial structures. The study also evaluates the yield of intersystem crossing (ISC) using AIMD and Landau‐Zener probability. The results suggest that ISC is a minor decay channel for OPP3 and OPP4. This work provides new insights into the structural flexibility and emission characteristics of OPP‐TEA photoredox catalyst systems, potentially contributing to improved design strategies for organic chromophores in reduction applications.

Giudetti, Goran [Department of Chemistry Universit↗
DOE OSTI2020

Low synchronization Gram–Schmidt and generalized minimal residual algorithms

The Gram–Schmidt process uses orthogonal projection to construct the A = QR factorization of a matrix. When Q has linearly independent columns, the operator P = I - Q(QTQ)-1QT defines an orthogonal projection onto Q⊥. In finite precision, Q loses orthogonality as the factorization progresses. A family of approximate projections is derived with the form P = I - QTQT, with correction matrix T. When T = (QTQ)-1, and T is triangular, it is postulated that the best achievable orthogonality is $\mathcal{O}(ε)\mathcal{K}(A)$. We present new variants of modified (MGS) and classical Gram–Schmidt algorithms that require one global reduction step. An interesting form of the projector leads to a compact WY representation for MGS. In particular, the inverse compact WY MGS algorithm is equivalent to a lower triangular solve. Our main contribution is to introduce a backward normalization lag into the compact WY representation, resulting in a $\mathcal{O}(ε)\mathcal{K}[r_0, AV_m])$ stable Generalized Minimal Residual Method (GMRES) algorithm that requires only one global reduce per iteration. Finally, further improvements in performance are achieved by accelerating GMRES on GPUs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Numerical solution of singular Lyapunov equations

We consider the numerical solution of large scale singular (continuous-time) Lyapunov equations of the form AX + XA T + BB T = 0, where A is semistable, that is, its spectrum is contained in the left half plane, with the exception of a few semisimple eigenvalues at zero. We also consider the case of a few semisimple eigenvalues on the imaginary axis. We assume that we know these few eigenvalues (zero or imaginary), and that we have or can compute the corresponding invariant subspaces. We use this information to build an appropriate newly proposed subspace on which to project the Lyapunov equations, and then compute a low-rank approximation to the least squares solution. Selected illustrative numerical examples are provided.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

The ezSpectra suite: An easy‐to‐use toolkit for spectroscopy modeling

Abstract A molecule's spectrum encodes information about its structure and electronic properties. It is a unique fingerprint that can serve as a molecular ID. Quantum chemistry calculations provide key ingredients for interpreting spectra, but modeling the spectra rarely ends there; it requires additional steps that entail combined treatments of electronic and nuclear degrees of freedom and account for specifics of the experimental setup (light energy, polarization, averaging over molecular orientations, temperature, etc.). This Software Focus article describes the ezSpectra suite, which currently comprises two stand‐alone open‐source codes: ezFCF and ezDyson . ezFCF calculates Franck–Condon factors, which yield vibrational progressions for polyatomic molecules, within the double‐harmonic approximation. ezDyson calculates absolute cross‐sections for photodetachment/photoionization processes and photoelectron angular distributions using Dyson orbitals computed by a quantum chemistry program. This article is categorized under: Electronic Structure Theory > Ab Initio Electronic Structure Methods Theoretical and Physical Chemistry > Spectroscopy Software > Simulation Methods

Gozem, Samer↗
DOE OSTI2022

libwfa: Wavefunction analysis tools for excited and open‐shell electronic states

Abstract An open‐source software library for wavefunction analysis, libwfa, provides a comprehensive and flexible toolbox for post‐processing excited‐state calculations, featuring a hierarchy of interconnected visual and quantitative analysis methods. These tools afford compact graphical representations of various excited‐state processes, provide detailed insight into electronic structure, and are suitable for automated processing of large data sets. The analysis is based on reduced quantities, such as state and transition density matrices (DMs), and allows one to distill simple molecular orbital pictures of physical phenomena from intricate correlated wavefunctions. The implemented descriptors provide a rigorous link between many‐body wavefunctions and intuitive physical and chemical models, for example, exciton binding, double excitations, orbital relaxation, and polyradical character. A broad range of quantum‐chemical methods is interfaced with libwfa via a uniform interface layer in the form of DMs. This contribution reviews the structure of libwfa and highlights its capabilities by several representative use cases. This article is categorized under: Software > Quantum Chemistry Theoretical and Physical Chemistry > Spectroscopy

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

Optimal size of the block in block GMRES on GPUs: computational model and experiments

The block version of GMRES (BGMRES) is most advantageous over the single right hand side (RHS) counterpart when the cost of communication is high while the cost of floating point operations is not. This is the particular case on modern graphics processing units (GPUs), while it is generally not the case on traditional central processing units (CPUs). Here, in this paper, experiments on both GPUs and CPUs are shown that compare the performance of BGMRES against GMRES as the number of RHS increases, with a particular focus on GPU performance. The experiments indicate that there are many cases in which BGMRES is slower than GMRES on CPUs, but faster on GPUs. Furthermore, when varying the number of RHS on the GPU, there is an optimal number of RHS where BGMRES is clearly most advantageous over GMRES. A computational model for the GPU is developed using hardware specific parameters, providing insight towards how the qualitative behavior of BGMRES changes as the number of RHS increase, and this model also helps explain the phenomena observed in the experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Comparison of exponential integrators and traditional time integration schemes for the shallow water equations

We report the time integration scheme is probably one of the most fundamental choices in the development of an ocean model. In this paper, we investigate several time integration schemes when applied to the shallow water equations. This set of equations is accurate enough for the modeling of a shallow ocean and is also relevant to study as it is the one solved for the barotropic (i.e. vertically averaged) component of a three dimensional ocean model. We analyze different time stepping algorithms for the linearized shallow water equations. High order explicit schemes are accurate but the time step is constrained by the Courant-Friedrichs-Lewy stability condition. Implicit schemes can be unconditionally stable but, in practice lack accuracy when used with large time steps. In this paper we propose a detailed comparison of such classical schemes with exponential integrators. The accuracy and the computational costs are analyzed in different configurations.

97 MATHEMATICS AND COMPUTING↗