Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit methods”

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 883 records · Page 49

A NUMERICAL ALGORITHM FOR MODELING MULTIGROUP NEUTRINO-RADIATION HYDRODYNAMICS IN TWO SPATIAL DIMENSIONS

It is now generally agreed that multidimensional, multigroup, neutrino-radiation hydrodynamics (RHD) is an indispensable element of any realistic model of stellar-core collapse, core-collapse supernovae, and proto-neutron star instabilities. We have developed a new, two-dimensional, multigroup algorithm that can model neutrino-RHD flows in core-collapse supernovae. Our algorithm uses an approach similar to the ZEUS family of algorithms, originally developed by Stone and Norman. However, this completely new implementation extends that previous work in three significant ways: first, we incorporate multispecies, multigroup RHD in a flux-limited-diffusion approximation. Our approach is capable of modeling pair-coupled neutrino-RHD, and includes effects of Pauli blocking in the collision integrals. Blocking gives rise to nonlinearities in the discretized radiation-transport equations, which we evolve implicitly in time. We employ parallelized Newton-Krylov methods to obtain a solution of these nonlinear, implicit equations. Our second major extension to the ZEUS algorithm is the inclusion of an electron conservation equation that describes the evolution of electron-number density in the hydrodynamic flow. This permits calculating deleptonization of a stellar core. Our third extension modifies the hydrodynamics algorithm to accommodate realistic, complex equations of state, including those having nonconvex behavior. In this paper, we present a description of our complete algorithm, giving sufficient details to allow others to implement, reproduce, and extend our work. Finite-differencing details are presented in appendices. We also discuss implementation of this algorithm on state-of-the-art, parallel-computing architectures. Finally, we present results of verification tests that demonstrate the numerical accuracy of this algorithm on diverse hydrodynamic, gravitational, radiation-transport, and RHD sample problems. We believe our methods to be of general use in a variety of model settings where radiation transport or RHD is important. Extension of this work to three spatial dimensions is straightforward.

79 ASTRONOMY AND ASTROPHYSICS↗

A Navier-Stokes flow simulation of the Space Shuttle Main Engine Hot Gas Manifold

Incompressible viscous flow inside the turnaround duct, the fuel bowl, the transfer duct and the racetrack of the Space Shuttle Main Engine (SSME) Hot Gas Manifold (HGM) has been computed using the method of pseudo-compressibility together with an implicit, approximate-factorization algorithm. A multiple-zone method is used to make solution of flows in complex geometries easy. A model which predicts the pressure loading for the shield and the injector post arrangement without solving the complex flow field in the main injector region is proposed. The computed results show good qualitative agreement with experimental data.

Yang, Ruey-Jen↗

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↗

Time integration algorithms for the two-dimensional Euler equations on unstructured meshes

Explicit and implicit time integration algorithms for the two-dimensional Euler equations on unstructured grids are presented. Both cell-centered and cell-vertex finite volume upwind schemes utilizing Roe's approximate Riemann solver are developed. For the cell-vertex scheme, a four-stage Runge-Kutta time integration, a fourstage Runge-Kutta time integration with implicit residual averaging, a point Jacobi method, a symmetric point Gauss-Seidel method and two methods utilizing preconditioned sparse matrix solvers are presented. For the cell-centered scheme, a Runge-Kutta scheme, an implicit tridiagonal relaxation scheme modeled after line Gauss-Seidel, a fully implicit lower-upper (LU) decomposition, and a hybrid scheme utilizing both Runge-Kutta and LU methods are presented. A reverse Cuthill-McKee renumbering scheme is employed for the direct solver to decrease CPU time by reducing the fill of the Jacobian matrix. A comparison of the various time integration schemes is made for both first-order and higher order accurate solutions using several mesh sizes, higher order accuracy is achieved by using multidimensional monotone linear reconstruction procedures. The results obtained for a transonic flow over a circular arc suggest that the preconditioned sparse matrix solvers perform better than the other methods as the number of elements in the mesh increases.

Slack, David C.↗

Unstructured grid methods for compressible flows

The implementation of the finite element method on unstructured triangular grids is described and the development of centered finite element schemes for the solution of the compressible Euler equation on general triangular and tetrahedral grids is discussed. Explicit and implicit Lax-Wendroff type methods and a method based upon the use of explicit multistep timestepping are considered. In the latter case, the convergence behavior of the method is accelerated by the incorporation of a fully unstructured multigrid procedure. The advancing front method for generating unstructured grids of triangles and tetrahedra is described and the application of adaptive mesh techniques to both steady and transient flow analysis is illustrated.

Morgan, K.↗

Boundary conditions for implicit solutions to the compressible Navier-Stokes equations in finite computational domains

The admissible boundary conditions for the unsteady Navier-Stokes equations are insufficient to determine completely the flow variables at grid points on the boundaries of a finite computational domain. A general method is presented in which the boundary conditions are supplemented by conservatively differenced forms of the flow equations. For implicit algorithms, the method provides a fully implicit coupling between boundary and interior points. Implicit boundary-point computation schemes are given for most types of flow boundary encountered in internal and external flow problems. Convergence to steady state is generally faster than with locally explicit boundary-point schemes.

Thomas, P. D.↗

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↗

Jacobian Free-Newton Krylov Discontinuous Galerkin Method and Physics-Based Preconditioning for Nuclear Reactor Simulations

Multidimensional, higher-order (2nd and higher) numerical methods have come to the forefront in recent years due to significant advances of computer technology and numerical algorithms, and have shown great potential as viable design tools for realistic applications. To achieve this goal, implicit high-order accurate coupling of the multiphysics simulations is a critical component. One of the issues that arise from multiphysics simulation is the necessity to resolve multiple time scales. For example, the dynamical time scales of neutron kinetics, fluid dynamics and heat conduction significantly differ (typically >1010 magnitude), with the dominant (fastest) physical mode also changing during the course of transient [Pope and Mousseau, 2007]. This leads to the severe time step restriction for stability in traditional multiphysics (i.e. operator split, semi-implicit discretization) simulations. The lower order methods suffer from an undesirable numerical dissipation. Thus implicit, higher order accurate scheme is necessary to perform seamlessly-coupled multiphysics simulations that can be used to analyze the “what-if” regulatory accident scenarios, or to design and optimize engineering systems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

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↗

Using exact solutions to develop an implicit scheme for the baroclinic primitive equations

The exact solutions presently obtained by means of a novel method for nonlinear initial value problems are used in the development of numerical schemes for the computer solution of these problems. The method is applied to a new, fully implicit scheme on a vertical slice of the isentropic baroclinic equations. It was not possible to find a global scale phenomenon that could be simulated by the baroclinic primitive equations on a vertical slice.

Marchesin, D.↗

A spectral collocation method for compressible, non-similar boundary layers

An efficient and highly accurate algorithm based on a spectral collocation method is developed for numerical solution of the compressible, two-dimensional and axisymmetric boundary layer equations. The numerical method incorporates a fifth-order, fully implicit marching scheme in the streamwise (timelike) dimension and a spectral collocation method based on Chebyshev polynomial expansions in the wall-normal (spacelike) dimension. The spectral collocation algorithm is used to derive the nonsimilar mean velocity and temperature profiles in the boundary layer of a 'fuselage' (cylinder) in a high-speed (Mach 5) flow parallel to its axis. The stability of the flow is shown to be sensitive to the gradual streamwise evolution of the mean flow and it is concluded that the effects of transverse curvature on stability should not be ignored routinely.

Pruett, C. D.↗

Numerical approximation of boundary conditions with applications to inviscid equations of gas dynamics

A comprehensive overview of the state of the art of well-posedness and stability analysis of difference approximations for initial boundary value problems of the hyperbolic type is presented. The applicability of recent theoretical development to practical calculations for nonlinear gas dynamics is examined. The one dimensional inviscid gas dynamics equations in conservation law form are selected for numerical experiments. The class of implicit schemes developed from linear multistep methods in ordinary differential equations is chosen and the use of linear extrapolation as an explicit or implicit boundary scheme is emphasized. Specification of boundary data in the primitive variables and computation in terms of the conservative variables in the interior is discussed. Some numerical examples for the quasi-one-dimensional nozzle are given.

Yee, H. C.↗

Implicit Preconditioning for Explicit Multigrid Solvers on Cut-Cell Cartesian Meshes

This work assesses the effectiveness of linearized implicit Euler preconditioning for multigrid solvers using an unpreconditioned, Jacobian-free Newton Krylov method to converge the linear system of equations. Multigrid convergence rates improve to approximately 0.75 across the cases tested including a Mach 2 supersonic wedge, transonic NACA 0012 airfoil, and ONERA M6 wing. While larger Krylov subspaces increase the convergence rate, they also increase the computational cost, such that 4-8 Krylov vectors often offers the fastest turnaround. Further reductions in computational cost are achieved with a sequential hybrid preconditioner that begins with the explicit multigrid solver before transitioning to the preconditioned algorithm later on. In addition, a novel implementation of dual time stepping is extended to include both common BDF methods as well as high-order implicit Runge-Kutta schemes. This particular formulation, which uses A −1 preconditioning, is amenable to matrix-free solvers, and the L-stable methods are especially suited for meshes with arbitrarily small cut-cells. Asymptotic order of convergence is demonstrated for BDF1, BDF2, SDIRK2, and 3rd-order Radau IIA time integration with unsteady 2D vortex simulations.

ARMD↗

Stable boundary approximations for a class of implicit schemes for the one-dimensional inviscid equations of gas dynamics

The applicability to practical calculations of recent theoretical developments in the stability analysis of difference approximations for initial-boundary-value problems of the hyperbolic type. For the numerical experiments, select the one-dimensional inviscid gas-dynamic equations in conservation-law form is selected. A class of implicit schemes based on linear multistep methods for ordinary differential equations is chosen and the use of space or space-time extrapolations as implicit or explicit boundary schemes is emphasized. Some numerical examples with various inflow-outflow conditions highlight the commonly discussed issues: explicit versus implicit boundary schemes, unconditionally stable schemes, and underspecification or overspecification of boundary conditions.

Yee, H. C.↗

Euler solutions to nonlinear acoustics of non-lifting hovering rotor blades

For the first time a computational fluid dynamics (CFD) method is used to calculate directly the high-speed impulsive (HSI) noise of a non-lifting hovering rotor blade out to a distance of over three rotor radii. In order to accurately propagate the acoustic wave in a stable and efficient manner, an implicit upwind-biased Euler method is solved on a grid with points clustered along the line of propagation. A detailed validation of the code is performed for a rectangular rotor blade at tip Mach numbers ranging from 0.88 to 0.92. The agreement with experiment is excellent at both the sonic cylinder and at 2.18 rotor radii. The agreement at 3.09 rotor radii is still very good, showing improvements over the results from the best previous method. Grid sensitivity studies indicate that with special attention to the location of the boundaries a grid with approximately 60,000 points is adequate. This results in a computational time of approximately 40 minutes on a Cray-XMP. The practicality of the method to calculate HSI noise is demonstrated by expanding the scope of the investigation to examine the rectangular blade as well as a highly swept and tapered blade over a tip Mach number range of 0.80 to 0.95. Comparisons with experimental data are excellent and the advantages of planform modifications are clearly evident. New insight is gained into the mechanisms of nonlinear propagation and the minimum distance at which a valid comparison of different rotors can be made: approximately two rotor radii from the center of rotation.

Baeder, J. D.↗

Euler solutions to nonlinear acoustics of non-lifting rotor blades

For the first time a computational fluid dynamics (CFD) method is used to calculate directly the high-speed impulsive (HSI) noise of a non-lifting hovering rotor blade out to a distance of over three rotor radii. In order to accurately propagate the acoustic wave in a stable and efficient manner, an implicit upwind-biased Euler method is solved on a grid with points clustered along the line of propagation. A detailed validation of the code is performed for a rectangular rotor blade at tip Mach numbers ranging from 0.88 to 0.92. The agreement with experiment is excellent at both the sonic cylinder and at 2.18 rotor radii. The agreement at 3.09 rotor radii is still very good, showing improvements over the results from the best previous method. Grid sensitivity studies indicate that with special attention to the location of the boundaries a grid with approximately 60,000 points is adequate. This results in a computational time of approximately 40 minutes on a Cray-XMP. The practicality of the method to calculate HSI noise is demonstrated by expanding the scope of the investigation to examine the rectangular blade as well as a highly swept and tapered blade over a tip Mach number range of 0.80 to 0.95. Comparisons with experimental data are excellent and the advantages of planform modifications are clearly evident. New insight is gained into the mechanisms of nonlinear propagation and the minimum distance at which a valid comparison of different rotors can be made: approximately two rotor radii from the center of rotation.

Baeder, J. D.↗

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↗