Search NASA⌕ Search

SEARCH · Search NASA

Results for “Implicit 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 379 records · Page 21

Solving Nonlinear Solid Mechanics Problems with the Jacobian-Free Newton Krylov Method

The solution of the equations governing solid mechanics is often obtained via Newton's method. This approach can be problematic if the determination, storage, or solution cost associated with the Jacobian is high. These challenges are magnified for multiphysics applications with many coupled variables. Jacobian-free Newton-Krylov (JFNK) methods avoid many of the difficulties associated with the Jacobian by using a finite difference approximation. BISON is a parallel, object-oriented, nonlinear solid mechanics and multiphysics application that leverages JFNK methods. We overview JFNK, outline the capabilities of BISON, and demonstrate the effectiveness of JFNK for solid mechanics and solid mechanics coupled to other PDEs using a series of demonstration problems.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Development and validation of ALEPH2 Monte Carlo burn-up code

The ALEPH2 Monte Carlo depletion code has two principal features that make it a flexible and powerful tool for reactor analysis. First of all, its comprehensive nuclear data library ensures the consistency between steady-state Monte Carlo and deterministic depletion modules. It covers neutron and proton induced reactions, neutron and proton fission product yields, spontaneous fission product yields, radioactive decay data and total recoverable energies per fission. Secondly, ALEPH2 uses an advanced numerical solver for the first order ordinary differential equations describing the isotope balances, namely a Radau IIA implicit Runge-Kutta method. The versatility of the code allows using it for time behavior simulation of various systems ranging from single pin model to full-scale reactor model. The code is extensively used for the neutronics design of the MYRRHA research fast spectrum facility which will operate in both critical and sub-critical modes. The code has been validated on the decay heat data from JOYO experimental fast reactor. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Development of a Performance Portable Non-Equilibrium Plasma Fluid Solver on Adaptive Grids

This presentation will describe the numerical techniques, programming paradigms, verification, and performance of a non-equilibrium plasma fluid solver that can effectively utilize current and upcoming central processing and graphics processing unit (CPU+GPU) architectures. Our plasma fluid model solves the conservation equations for self-consistent electrostatic Poisson, electron and heavy species transport, and electron temperature on adaptive Cartesian grids. Our solver is written using performance portable adaptive mesh management library, AMReX (Zhang et al., JOSS, 4 (37) 1370, 2019), and can be built and run on widely available vendor specific GPU architectures (NVIDIA/AMD/Intel). We utilize a non-subcycled second order semi-implicit time-stepping method where all adaptive mesh refinement (AMR) levels are advanced with the same time step. The composite multi-level multigrid solver from within AMReX is used for each of the governing equations that are cast into a Helmholtz equation form. We have also developed a python based chemical mechanism parser framework that uses a similar format as CANTERA (Goodwin et al., Zenodo, 2018) yaml files as input. Our custom parser reads the yaml file and provides C++ files with transport and production rate functions that can be executed on both host (CPU) and device (GPU). We present verification of our solver using method of manufactured solutions that indicate formal second order accuracy with central diffusion and fifth order weighted-essentially-non-oscillatory (WENO) advection scheme. We also verify our solver with published literature on low-pressure capacitive and high-pressure streamer discharges. Our initial performance studies indicate 10X speed-up using 20 NVIDIA GPUs versus 200 CPUs for an atmospheric streamer discharge problem solved on a 512 x 1024 x 512 grid.

graphics processing units↗

Verification of Multiphysics software: Space and time convergence studies for nonlinearly coupled applications

High-fidelity modeling of nuclear reactors requires the solution of a nonlinear coupled multi-physics stiff problem with widely varying time and length scales that need to be resolved correctly. A numerical method that converges the implicit nonlinear terms to a small tolerance is often referred to as nonlinearly consistent (or tightly coupled). This nonlinear consistency is still lacking in the vast majority of coupling techniques today. We present a tightly coupled multiphysics framework that tackles this issue and present code-verification and convergence analyses in space and time for several models of nonlinear coupled physics.

97 MATHEMATICS AND COMPUTING↗

Implicit-explicit evolution of single black holes

Numerical simulations of binary black holes - an important predictive tool for the detection of gravitational waves - are computationally expensive, especially for binaries with high mass ratios or with rapidly spinning constituent holes. Existing codes for evolving binary black holes rely on explicit time-stepping methods, for which the time-step size is limited by the smallest spatial scale through the Courant-Friedrichs-Lewy condition. Binary inspiral typically involves spatial scales (the spatial resolution required by a small or rapidly spinning hole) which are orders of magnitude smaller than the relevant (orbital, precession, and radiation-reaction) time scales characterizing the inspiral. Therefore, in explicit evolutions of binary black holes, the time-step size is typically orders of magnitude smaller than the relevant physical time scales. Implicit time-stepping methods allow for larger time steps, and they often reduce the total computational cost (without significant loss of accuracy) for problems dominated by spatial rather than temporal error, such as for binary-black-hole inspiral in corotating coordinates. However, fully implicit methods can be difficult to implement for nonlinear evolution systems like the Einstein equations. Therefore, in this paper we explore implicit-explicit (IMEX) methods and use them for the first time to evolve black-hole spacetimes. Specifically, as a first step toward IMEX evolution of a full binary-black-hole spacetime, we develop an IMEX algorithm for the generalized harmonic formulation of the Einstein equations and use this algorithm to evolve stationary and perturbed single-black-hole spacetimes. Numerical experiments explore the stability and computational efficiency of our method.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Monte Carlo Thermal Radiative Transfer Solver with Nonlinear Elimination

Here in this paper, we present a new Monte Carlo method for solving the thermal radiative transfer (TRT) equations via the method of nonlinear elimination (NLEM). This method is inspired by the previous application of NLEM to thermal radiation diffusion. Our approach, called diffusion accelerated Implicit Monte Carlo (DAIMC), is a hybrid technique which combines a Monte Carlo method for solving a purely-absorbing transport equation and a diffusion solution that accounts for effective scattering, or absorption–reemission. The method aims to improve the implicitness of the traditional implicit Monte Carlo (IMC) method. We derive DAIMC generally for 3D Cartesian geometries, but in this paper, we present results and analysis in 1D slab geometry. These preliminary results indicate that DAIMC implementations may provide more accurate and robust TRT solutions than IMC in certain test problems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Eulerian Gaussian beams for Schroedinger equations in the semi-classical regime

We propose Gaussian-beam based Eulerian methods to compute semi-classical solutions of the Schroedinger equation. Traditional Gaussian beam type methods for the Schroedinger equation are based on the Lagrangian ray tracing. Based on the first Eulerian Gaussian beam framework proposed in Leung et al. [S. Leung, J. Qian, R. Burridge, Eulerian Gaussian beams for high frequency wave propagation, Geophysics 72 (2007) SM61-SM76], we develop a new Eulerian Gaussian beam method which uses global Cartesian coordinates, level-set based implicit representation and Liouville equations. The resulting method gives uniformly distributed phases and amplitudes in phase space simultaneously. To obtain semi-classical solutions to the Schroedinger equation with different initial wave functions, we only need to slightly modify the summation formula. This yields a very efficient method for computing semi-classical solutions to the Schroedinger equation. For instance, in the one-dimensional case the proposed algorithm requires only O(sNm{sup 2}) operations to compute s different solutions with s different initial wave functions under the influence of the same potential, where N=O(1/h),h is the Planck constant, and m<<N is the number of computed beams which depends on h weakly. Numerical experiments indicate that this Eulerian Gaussian beam approach yields accurate semi-classical solutions even at caustics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive Implicit Non-Equilibrium Radiation Diffusion

We describe methods for accurate and efficient long term time integra- tion of non-equilibrium radiation diffusion systems: implicit time integration for effi- cient long term time integration of stiff multiphysics systems, local control theory based step size control to minimize the required global number of time steps while control- ling accuracy, dynamic 3D adaptive mesh refinement (AMR) to minimize memory and computational costs, Jacobian Free Newton-Krylov methods on AMR grids for efficient nonlinear solution, and optimal multilevel preconditioner components that provide level independent solver convergence.

Philip, Bobby↗

Convergence Analysis of a Locally Accelerated Preconditioned Steepest Descent Method for Hermitian-Definite Generalized Eigenvalue Problems

By extending the classical analysis techniques due to Samokish, Faddeev and Faddeeva, and Longsine and McCormick among others, we prove the convergence of preconditioned steepest descent with implicit deflation (PSD-id) method for solving Hermitian-definite generalized eigenvalue problems. Moreover, we derive a nonasymptotic estimate of the rate of convergence of the PSD-id method. We show that with a proper choice of the shift, the indefinite shift-and-invert preconditioner is a locally accelerated preconditioner, and is asymptotically optimal that leads to superlinear convergence. Numerical examples are presented to verify the theoretical results on the convergence behavior of the PSDid method for solving ill-conditioned Hermitian-definite generalized eigenvalue problems arising from electronic structure calculations. While rigorous and full-scale convergence proofs of preconditioned block steepest descent methods in practical use still largely eludes us, we postulate that the theoretical results introduced in this paper sheds light on an improved understanding of the convergence behavior of these block methods.

97 MATHEMATICS AND COMPUTING↗

Conservative tightly-coupled simulations of stochastic multiscale systems

Multiphysics problems often involve components whose macroscopic dynamics is driven by microscopic random fluctuations. The fidelity of simulations of such systems depends on their ability to propagate these random fluctuations throughout a computational domain, including subdomains represented by deterministic solvers. When the constituent processes take place in nonoverlapping subdomains, system behavior can be modeled via a domain-decomposition approach that couples separate components at the interfaces between these subdomains. Its coupling algorithm has to maintain a stable and efficient numerical time integration even at high noise strength. We propose a conservative domain-decomposition algorithm in which tight coupling is achieved by employing either Picard's or Newton's iterative method. Coupled diffusion equations, one of which has a Gaussian white-noise source term, provide a computational testbed for analysis of these two coupling strategies. Fully-converged (“implicit”) coupling with Newton's method typically outperforms its Picard counterpart, especially at high noise levels. This is because the number of Newton iterations scales linearly with the amplitude of the Gaussian noise, while the number of Picard iterations can scale superlinearly. At large time intervals between two subsequent inter-solver communications, the solution error for single-iteration (“explicit”) Picard's coupling can be several orders of magnitude higher than that for implicit coupling. Increasing the explicit coupling's communication frequency reduces this difference, but the resulting increase in computational cost can make it less efficient than implicit coupling at similar levels of solution error, depending on the communication frequency of the latter and the noise strength. This trend carries over into higher dimensions, although at high noise strength explicit coupling may be the only computationally viable option.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

General Relativistic Implicit Monte Carlo Radiation-hydrodynamics

Abstract We report on a new capability added to our general relativistic radiation-magnetohydrodynamics code, Cosmos++ : an implicit Monte Carlo (IMC) treatment for radiation transport. The method is based on a Fleck-type implicit discretization of the radiation-hydrodynamics equations, but generalized for both Newtonian and relativistic regimes. A multiple reference frame approach is used to geodesically transport photon packets (and solve the hydrodynamics equations) in the coordinate frame, while radiation–matter interactions are handled either in the fluid or electron frames then communicated via Lorentz boosts and orthonormal tetrad bases attached to the fluid. We describe a method for constructing estimators of radiation moments using path-weighting that generalizes to arbitrary coordinate systems in flat or curved spacetime. Absorption, emission, scattering, and relativistic Comptonization are among the matter interactions considered in this report. We discuss our formulations and numerical methods, and validate our models against a suite of radiation and coupled radiation-hydrodynamics test problems in both flat and curved spacetimes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An Analysis of Source Tilting and Sub-cell Opacity Sampling for IMC [Slides]

Implicit Monte Carlo (IMC) is a stochastic method for solving the radiative transfer equations for multiphysics application with the material in local thermodynamic equilibrium. The IMC method employs a fictitious scattering term that is computed from an implicit discretization of the material temperature equation. Unfortunately, the original histogram representation of the temperature and opacity with respect to the spatial domain leads to nonphysically fast propagation of radiation waves through optically thick material. In the past, heuristic source tilting schemes have been used to mitigate the numerical teleportation error of the radiation particles in IMC that cause this overly rapid radiation wave propagation. While improving the material temperature profile throughout the time duration, these tilting schemes alone do not generally alleviate the teleportation error to suitable levels. Another means of potentially reducing teleportation error in IMC is implementing continuous sub-cell opacities based on sub-cell temperature profiles. We present here an analysis of source tilting and continuous sub-cell opacity sampling applied to various discretizations of the temperature equation. Through this analysis, we demonstrate that applying both heuristics does not necessarily yield more accurate results if the discretization of the material equation is inconsistent with the Monte Carlo sub-cell transport.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

sta-imex (scripts to investigate stability of IMEX methods)

Set of Matlab scripts to investigate properties of IMEX time stepping methods. Scripts include discretization of a system of linearized equations. One script plots numerical dispersion against analytical dispersion of the system. Another set of scripts uses the system to break it into stiff and non stiff part to investigate stability of Implicit-Explicit Runge-Kutta methods. Scripts are based on Thuburn, J. and Woollings, T. J., Vertical Discretizations for Compressible Euler Equation Atmospheric Models Giving Optimal Representation of Normal Modes , 2005 and Lock, S.-J. and Wood, N. and Weller, H., Numerical analyses of Runge-Kutta implicit-explicit schemes for horizontally explicit, vertically implicit solutions of atmospheric models, 2014 expanding ideas from these two papers. Scripts are used to develop IMEX schemes. SAND2020-12594 M Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

Guba, Oksana↗

Parameter estimation by implicit sampling

© 2015 Mathematical Sciences Publishers. Implicit sampling is a weighted sampling method that is used in data assimilation to sequentially update state estimates of a stochastic model based on noisy and incomplete data. Here we apply implicit sampling to sample the posterior probability density of parameter estimation problems. The posterior probability combines prior information about the parameter with information from a numerical model, e.g., a partial differential equation (PDE), and noisy data. The result of our computations are parameters that lead to simulations that are compatible with the data. We demonstrate the usefulness of our implicit sampling algorithm with an example from subsurface flow. For an efficient implementation, we make use of multiple grids, BFGS optimization coupled to adjoint equations, and Karhunen-Loève expansions for dimensional reduction. Several difficulties of Markov chain Monte Carlo methods, e.g., estimation of burn-in times or correlations among the samples, are avoided because the implicit samples are independent.

Morzfeld, Matthias↗

Conservative DG method for the micro-macro decomposition of the Vlasov–Poisson–Lenard–Bernstein model

The micro-macro (mM) decomposition approach is considered for the numerical solution of the Vlasov– Poisson–Lenard–Bernstein (VPLB) system, which is relevant for plasma physics applications. In the mM approach, the kinetic distribution function is decomposed as $f$ = $\mathscr{E}$[$ρ_f$] + g , where $\mathscr{E}$ is a local equilibrium distribution, depending on the macroscopic moments $ρ_f$ = $∫_{\mathbb{R}}$ $efdv$ = $\langle$$ef$$\rangle$$_{\mathbb{R}}$, where e = (1, $v$, $\frac{1}{2}$ $v^2$) T , and $g$, the microscopic distribution, is defined such that $\langle$$eg$$\rangle$$_{\mathbb{R}}$ = 0. We aim to design numerical methods for the mM decomposition of the VPLB system, which consists of coupled equations for $ρ_f$ and $g$. To this end, we use the discontinuous Galerkin (DG) method for phase-space discretization, and implicit-explicit (IMEX) time integration, where the phase-space advection terms are integrated explicitly and the collision operator is integrated implicitly. We give special consideration to ensure that the resulting mM method maintains the $\langle$$eg$$\rangle$$_{\mathbb{R}}$ = 0 constraint, which may be necessary for obtaining (i) satisfactory results in the collision dominated regime with coarse velocity resolution, and (ii) unambiguous conservation properties. The constraint-preserving property is achieved through a consistent discretization of the equations governing the micro and macro components. Here, we present numerical results that demonstrate the performance of the mM method. The mM method is also compared against a corresponding DG-IMEX method solving directly for $f$.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Prediction of p K a s of Late Transition‐Metal Hydrides via a QM/QM Approach

Three implicit solvation models, the conductor‐like polarizable continuum model (C‐PCM), the conductor‐like screening model (COSMO), and universal implicit solvent model (SMD), combined with a hybrid two layer QM/QM approach (ONIOM), were utilized to calculate the p K a values, using a direct thermodynamic scheme, of a set of Group 10 transition metal (TM) hydrides in acetonitrile. To obtain the optimal combination of quantum methods for ONIOM calculations with implicit solvation models, the influence of factors, such as the choice of density functional and basis set, the atomic radii used to build a cavity in the solvent, and the size of the model system in an ONIOM scheme, was examined. Additionally, the impact of Grimme's empirical dispersion correction and exact exchange was also investigated. The results were calibrated by experimental data. This investigation provides insight about effective models for the prediction of thermodynamic properties of TM‐containing complexes with bulky ligands. © 2019 Wiley Periodicals, Inc.

Patel, Prajay↗