Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit solvers”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

On High-Order/Low-Order and Micro-Macro Methods for Implicit Time-Stepping of the BGK Model

In this paper, a high-order/low-order (HOLO) method is combined with a micro-macro (MM) decomposition to accelerate iterative solvers in fully implicit time-stepping of the Bhatnagar–Gross–Krook (BGK) equation for gas dynamics. The MM formulation represents a kinetic distribution as the sum of a local Maxwellian and a perturbation. In highly collisional regimes, the perturbation away from initial and boundary layers is small and can be compressed to reduce the overall storage cost of the distribution. The convergence behavior of the MM methods, the usual HOLO method, and the standard source iteration method is analyzed on a linear BGK model. Both the HOLO and MM methods are implemented using a discontinuous Galerkin (DG) discretization in phase space, which naturally preserves the consistency between high- and low-order models required by the HOLO approach. Furthermore, the accuracy and performance of these methods are compared on the Sod shock tube problem and a sudden wall heating boundary layer problem. Overall, the results demonstrate the robustness of the MM and HOLO approaches and illustrate the compression benefits enabled by the MM formulation when the kinetic distribution is near equilibrium.

BGK model↗
DOE OSTI2025

Realizability-preserving discontinuous Galerkin method for spectral two-moment radiation transport in special relativity

Here we present a realizability-preserving numerical method for solving a spectral two-moment model to simulate the transport of massless, neutral particles interacting with a steady background material moving with relativistic velocities. The model is obtained as the special relativistic limit of a four-momentum-conservative general relativistic two-moment model. Using a maximum-entropy closure, we solve for the Eulerian-frame energy and momentum. The proposed numerical method is designed to preserve moment realizability, which corresponds to moments defined by a nonnegative phase-space density. The realizability-preserving method is achieved with the following key components: (i) a discontinuous Galerkin phase-space discretization with specially constructed numerical fluxes in the spatial and energy dimensions; (ii) a strong stability-preserving implicit-explicit time-integration method; (iii) a realizability-preserving conserved to primitive moment solver; (iv) a realizability-preserving implicit collision solver; and (v) a realizability-enforcing limiter. Component (iii) is necessitated by the closure procedure, which closes higher order moments nonlinearly in terms of primitive moments. The nonlinear conserved to primitive and the implicit collision solves are formulated as fixed-point problems, which are solved with custom iterative solvers designed to preserve the realizability of each iterate. With a series of numerical tests, we demonstrate the accuracy and robustness of this discontinuous-Galerkin-implicit-explicit method.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

A Performance Portable, Fully Implicit Landau Collision Operator with Batched Linear Solvers

Modern accelerators use hierarchical parallel programming models that enable massive multithreading within a processing element (PE), with multiple PEs per device driven by traditional processes. Batching is a technique for exposing PE-level parallelism in algorithms that have traditionally run on MPI processes or multiple threads within a single process. Opportunities for batching arise in, for example, kinetic discretizations of magnetized plasmas where collisions are advanced in velocity space at each spatial point independently. This paper builds on previous work on a high-performance, fully nonlinear, Landau collision operator by batching the linear solver, as well as batching the spatial point problems and adding new support for multiple grids for multiscale, multispecies problems. An anisotropic relaxation verification test that agrees well with previously published results and analytical models is presented. The performance results from NVIDIA A100 and AMD MI250X nodes are presented with hardware utilization analysis for each architecture. Finally, the entire implicit Landau operator time advance is implemented in Kokkos for performance portability, running entirely on the device and is available in the PETSc numerical library.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Deploy Nalu/Kokkos algorithmic infrastructure with performance benchmarking.

The former Nalu interior heterogeneous algorithm design, which was originally designed to manage matrix assembly operations over all elemental topology types, has been modified to operate over homogeneous collections of mesh entities. This newly templated kernel design allows for removal of workset variable resize operations that were formerly required at each loop over a Sierra ToolKit (STK) bucket (nominally, 512 entities in size). Extensive usage of the Standard Template Library (STL) std::vector has been removed in favor of intrinsic Kokkos memory views. In this milestone effort, the transition to Kokkos as the underlying infrastructure to support performance and portability on many-core architectures has been deployed for key matrix algorithmic kernels. A unit-test driven design effort has developed a homogeneous entity algorithm that employs a team-based thread parallelism construct. The STK Single Instruction Multiple Data (SIMD) infrastructure is used to interleave data for improved vectorization. The collective algorithm design, which allows for concurrent threading and SIMD management, has been deployed for the core low-Mach element- based algorithm. Several tests to ascertain SIMD performance on Intel KNL and Haswell architectures have been carried out. The performance test matrix includes evaluation of both low- and higher-order methods. The higher-order low-Mach methodology builds on polynomial promotion of the core low-order control volume nite element method (CVFEM). Performance testing of the Kokkos-view/SIMD design indicates low-order matrix assembly kernel speed-up ranging between two and four times depending on mesh loading and node count. Better speedups are observed for higher-order meshes (currently only P=2 has been tested) especially on KNL. The increased workload per element on higher-order meshes bene ts from the wide SIMD width on KNL machines. Combining multiple threads with SIMD on KNL achieves a 4.6x speedup over the baseline, with assembly timings faster than that observed on Haswell architecture. The computational workload of higher-order meshes, therefore, seems ideally suited for the many-core architecture and justi es further exploration of higher-order on NGP platforms. A Trilinos/Tpetra-based multi-threaded GMRES preconditioned by symmetric Gauss Seidel (SGS) represents the core solver infrastructure for the low-Mach advection/diffusion implicit solves. The threaded solver stack has been tested on small problems on NREL's Peregrine system using the newly developed and deployed Kokkos-view/SIMD kernels. fforts are underway to deploy the Tpetra-based solver stack on NERSC Cori system to benchmark its performance at scale on KNL machines.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

High-order methods for wind turbine simulations and moving to next-generation platforms

The goal of the ExaWind project is to enable predictive simulations of wind farms comprised of many megawatt-scale turbines situated in complex terrain. Predictive simulations will require computational fluid dynamics (CFD) simulations for which the mesh resolves the geometry of the turbines and captures the rotation and large deflections of blades. Whereas such simulations for a single turbine are arguably petascale class, multi-turbine wind farm simulations will require exascale-class resources. The primary physics codes in the ExaWind project are Nalu-Wind, which is an unstructured-grid solver for the acoustically incompressible Navier-Stokes equations, and OpenFAST, which is a whole-turbine simulation code. The Nalu-Wind model consists of the mass-continuity Poisson-type equation for pressure and a momentum equation for the velocity. For such modeling approaches, simulation times are dominated by linear-system setup and solution for the continuity and momentum systems. For the ExaWind challenge problem, the moving meshes greatly affect overall solver costs as reinitialization of matrices and recomputation of preconditioners is required at every time step. This milestone represents an effort to increase the fidelity of Nalu-Wind at a fixed resolution through the implementation of a tensor-product based, matrix-free high order scheme. High order finite element methods have increased local work per datum communicated and have the potential to provide significantly more accurate solutions at a fixed number of degrees of freedom. Previous to this milestone, Nalu-Wind had an arbitrary order Control Volume Finite Element Method discretization as a solver option, but it required too much memory and was too slow to be of practical use. The work in this milestone addresses these issues by first implementing an implicit, high order solver that only partially assembles the global system. This reduces the memory footprint of the high-order scheme by orders of magnitude for higher polynomial orders. Second, a faster, tensor-product based method for evaluating the action of the left-hand side was implemented. This reduces the amount of computational work required by the scheme and dramatically enhanced the time-to-solution on example problems. Finally, this milestone is an evaluation of the value of high order methods in the wind application space. With the enhancements to memory and computational cost, accuracy vs. time-to-solution was evaluated for several resolutions on an under-resolved Taylor Green vortex test case. Results show that the high order scheme is cost-competitive with the production low-order schemes in Nalu-Wind, being moderately more expensive than the production edge-based vertex centered finite volume scheme. The evaluation of accuracy on the test case shows a potential benefit to high order at the highest resolution while not deteriorating accuracy on the lowest tested resolution. More work is needed to show value in the wind application, but positive strides have been made.

17 WIND ENERGY↗
DOE OSTI2024

Handling Iterative Solvers in an Algorithmic Differentiation Framework Using Implicit Methods

Differentiable programming is a powerful concept as it enables the seemly propagation of gradients through functions, algorithms, and/or whole physics simulations. These gradients are useful for a wide variety of applications, including sensitivity studies and machine learning, but one of particular interest is optimization. Gradient-based optimization, enabled through automatic/algorithmic differentiation (AD), can be used on predictive physical models to efficiently optimize a set of design variables. AD methods are a particularly promising approach to complex physics simulations because they can be shown to scale well with an increasing number of design variables; however, care must be taken when coupling between different models or different states of a single model.

algorithmic differentiation↗
DOE OSTI2023

Implementation and verification of a user-defined element (UEL) for coupled thermal-hydraulic-mechanical-chemical (THMC) processes in saturated geological media

Efficient and accurate modeling of the coupled thermal-hydraulic-mechanical-chemical (THMC) processes in various rock formations is indispensable for designing energy geo-structures such as underground repositories for high-level nuclear wastes. Here, this work focuses on developing and verifying an implicit finite element solver for generic coupled THMC problems in geological settings. Starting from the mass, momentum, and energy balance laws, a specialized set of governing equations and a thermoporoelastic constitutive model is derived. This system is then solved by an implicit finite element (FE) scheme. Specifically, the residuals and the Jacobians are scripted in a user-defined element (UEL) subroutine which is then combined with the general-purpose FE software Abaqus Standard to solve initial-boundary value problems. Considering the complexity of the system, the UEL development follows a stepwise manner by first solving the coupled hydraulic-mechanical (HM) and thermal-hydraulic-mechanical (THM) equations before moving on to the full THMC problem. Each implementation step consists of at least one verification test by comparing computed results with closed-form analytical solutions to ensure that the various coupling effects are correctly realized. To demonstrate the robustness of the algorithm and to validate the UEL, a three-dimensional case study is performed with reference to the in-situ heating test of ATLAS at Belgium in 1980s. A hypothetical radionuclide leakage event is then simulated by activating the chemical-concentration degree of freedom and prescribing a constant high concentration at the heater's surface. The model predicts a limited contaminated regime after six years considering both diffusion and advection effects on species transport.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2014

A phase-field model coupled with lattice kinetics solver for modeling crystal growth in furnaces

In this study, we present a new numerical model for crystal growth in a vertical solidification system. This model takes into account the buoyancy induced convective flow and its effect on the crystal growth process. The evolution of the crystal growth interface is simulated using the phase-field method. Two novel phase-field models are developed to model the crystal growth interface in vertical gradient furnaces with two temperature profile setups: 1) fixed wall temperature profile setup and 2) time-dependent temperature profile setup. A semi-implicit lattice kinetics solver based on the Boltzmann equation is employed to model the unsteady incompressible flow. This model is used to investigate the effect of furnace operational conditions on crystal growth interface profiles and growth velocities. For a simple case of macroscopic radial growth, the phase-field model is validated against an analytical solution. Crystal growth in vertical gradient furnaces with two temperature profile setups have been also investigated using the developed model. The numerical simulations reveal that for a certain set of temperature boundary conditions, the heat transport in the melt near the phase interface is diffusion dominant and advection is suppressed.

Lin, Guang↗
DOE OSTI2021

Considering computational speed vs. accuracy: Choosing appropriate mesoscale RVE boundary conditions

Modeling a material’s microstructure using continuum theories allows for inspection of the relationship between coarse scale and fine scale behaviors. Computational limits generally require selection of a sub-volume from a bulk sample in order to directly model the microstructure. Boundary conditions are applied to the sub-volume to mimic the excluded bulk material. Appropriate selection of boundary conditions helps effectively determine the appropriate spatial scale required of the sub-volume. Applicable boundary conditions include direct displacement, periodic, and uniform traction. While direct displacement and periodic boundary conditions are commonly used, uniform traction boundary conditions have seen limited use due to rigid body stability issues in simulations of compression or shear deformation. A new application of uniform traction boundary conditions was developed through linear constraint equations, similar to approaches employed by direct displacement and periodic boundary conditions, to quench rigid body motions with minimal interference of the relative deformation of the model. These boundary conditions were tested by compressing several synthetically generated periodic microstructures using the finite element method. Evaluating the effective stiffness along the compression axis, the direct displacement boundary condition produced the stiffest response, whereas the uniform traction boundary condition produced the most compliant. Periodic boundary conditions produced the same response for all volumes analyzed and both the direct displacement and uniform traction boundary conditions trended toward the periodic response as the domain volume increased. Computational performance was also evaluated for each boundary condition using implicit and explicit solvers. Direct displacement boundary conditions presented the lowest computational cost of all of the boundary conditions followed by periodic then uniform traction. The computational expense of periodic and uniform traction boundary conditions limited the viable spatial scale and mesh resolutions able to be simulated. Selection of appropriate boundary conditions for specific uses need to be a balance between allowable computational expense and accuracy of the method. Techniques for evaluating which boundary conditions to use are discussed.

42 ENGINEERING↗
DOE OSTI2022

Quasi-Helmholtz decomposition, Gauss' laws and charge conservation for finite element particle-in-cell

Development of particle-in-cell (PIC) methods using finite element based methods (FEMs) have been a topic of renewed interest; this has largely been driven by (a) the ability of finite element methods to better model geometry, (b) better understanding of function spaces that are necessary to represent all Maxwell quantities, and (c) more recently, the fundamental rubrics that should be obeyed in space and time so as to satisfy Gauss' laws and the equation of continuity. In that vein, methods have been developed recently that satisfy these equations and are agnostic to time stepping methods. While this development is indeed a significant advance, it should be noted that implicit FEM transient solvers support an underlying null space that corresponds to a gradient of a scalar potential ∇Φ(r) (or t∇Φ(r) in the case of wave equation solvers). While explicit schemes do not suffer from this drawback, they are only conditionally stable with time step sizes that are mesh dependent and very small. Furthermore, the null space produces spurious charge that can corrupt the desired physics of a PIC simulation. The way to overcome this bottleneck, and indeed, satisfy all four Maxwell's equation is to use a quasi-Helmholtz formulation on a tessellation. In the re-formulation presented, we strictly satisfy the equation of continuity and Gauss' laws for both the electric and magnetic flux densities. Results illustrating the efficacy of this scheme will be demonstrated by analyzing non-neutral beams with space-charge and the adiabatic expansion of a neutral plasma with realistic parameters (Debye length and real mass ratios).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2013

A multi-dimensional Vlasov-Fokker-Planck code for arbitrarily anisotropic high-energy-density plasmas

To study the kinetic physics of High-Energy-Density Laboratory Plasmas, we have developed the parallel relativistic 2D3P Vlasov-Fokker-Planck code Oshun. The numerical scheme uses a Cartesian mesh in configuration-space and incorporates a spherical harmonic expansion of the electron distribution function in momentum-space. The expansion is truncated such that the necessary angular resolution of the distribution function is retained for a given problem. Finite collisionality causes rapid decay of the high-order harmonics, thereby providing a natural truncation mechanism for the expansion. The code has both fully explicit and implicit field-solvers and employs a linearized Fokker-Planck collision operator. Oshun has been benchmarked against well-known problems, in the highly kinetic limit to model collisionless relativistic instabilities, and in the hydrodynamic limit to recover transport coefficients. The performance of the code, its applicability, and its limitations are discussed in the context of simple problems with relevance to inertial fusion energy.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2014

Implementation of Parallel Adaptive-Krylov Exponential Solvers for Stiff Problems

Recently exponential integrators have been receiving increased attention as a means of solving large stiff systems of ODEs. Preliminary performance analysis demonstrated that exponential integrators hold promise compared to state-of-the-art implicit methods. However, much work remains to be done to understand in detail possible computational advantages these methods may offer in practice. This is particularly true for supercomputer-scale problems as there has been very little work on parallelizing exponential methods. In this paper we describe an implementation of a suite of parallel exponential solvers. Additionally, we present some performance tests on four stiff benchmark problems of a particular adaptive-Krylov exponential propagation iterative Runge--Kutta (EPIRK) method from the suite, and compare efficiency with the Newton--Krylov implicit solver CVODE.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Efficient discontinuous Galerkin implementations and preconditioners for implicit unsteady compressible flow simulations

This work presents and compares efficient implementations of high-order discontinuous Galerkin methods: a modal matrix-free discontinuous Galerkin (DG) method, a hybridizable discontinuous Galerkin (HDG) method, and a primal formulation of HDG, applied to the implicit solution of unsteady compressible flows. The matrix-free implementation allows for a reduction of the memory footprint of the solver when dealing with implicit time-accurate discretizations. HDG reduces the number of globally-coupled degrees of freedom relative to DG, at high order, by statically condensing element-interior degrees of freedom from the system in favor of face unknowns. The primal formulation further reduces the element-interior degrees of freedom by eliminating the gradient as a separate unknown. This paper introduces a p-multigrid preconditioner implementation for these discretizations and presents results for various flow problems. Benefits of the p-multigrid strategy relative to simpler, less expensive, preconditioners are observed for stiff systems, such as those arising from low-Mach number flows at high-order approximation. The p-multigrid preconditioner also shows excellent scalability for parallel computations. Finally, additional savings in both speed and memory occur with a matrix-free/reduced version of the preconditioner.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Implementation and (Inverse Modified) Error Analysis for Implicitly Templated ODE-Nets

We focus on learning unknown dynamics from data using ODE-nets templated on implicit numerical initial value problem solvers. First, we perform inverse modified error analysis of the ODE-nets using unrolled implicit schemes for ease of interpretation. It is shown that training an ODE-net using an unrolled implicit scheme returns a close approximation of an inverse modified differential equation (IMDE). In addition, we establish a theoretical basis for hyperparameter selection when training such ODE-nets, whereas current strategies usually treat numerical integration of ODE-nets as a black box. We thus formulate an adaptive algorithm which monitors the level of error and adapts the number of (unrolled) implicit solution iterations during the training process, so that the error of the unrolled approximation is less than the current learning loss. This helps accelerate training while maintaining accuracy. Several numerical experiments are performed to demonstrate the advantages of the proposed algorithm compared to nonadaptive unrollings and validate the theoretical analysis. Here, we also note that this approach naturally allows for incorporating partially known physical terms in the equations, giving rise to what is termed “gray box” identification.

ODE-nets↗
DOE OSTI2020

Demonstration of a new unstructured mesh IMC x-ray transport capability in LAP codes

In this document, the Advanced Simulation and Computing (ASC) Transport Project’s Jayenne team presents evidence that the Los Alamos National Laboratory (LANL) Level 2 milestone statement, Demonstrate a new unstructured mesh IMC x-ray transport capability in LAP codes, due Q4 FY20, has been satisfied with the release and integration of the Jayenne team’s Implicit Monte Carlo (IMC) solver libraries into the lumos multiphysics solver. The Jayenne project’s software includes the algorithms and features prescribed by the milestone description. The lumos software is maintained by the Lagrangian Applications Project (LAP) along with the hydrodynamics code flag and operates under the same ASC program as Jayenne. A set of demonstration problems has been specified, executed, and analyzed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗