Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit”

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 199 records · Page 11

Modeling wave propagation in elastic solids via high-order accurate implicit-mesh discontinuous Galerkin methods

Here, a high-order accurate implicit-mesh discontinuous Galerkin framework for wave propagation in single-phase and bi-phase solids is presented. The framework belongs to the embedded-boundary techniques and its novelty regards the spatial discretization, which enables boundary and interface conditions to be enforced with high-order accuracy on curved embedded geometries. High-order accuracy is achieved via high-order quadrature rules for implicitly-defined domains and boundaries, whilst a cell-merging strategy addresses the presence of small cut cells. The framework is used to discretize the governing equations of elastodynamics, written using a first-order hyperbolic momentum-strain formulation, and an exact Riemann solver is employed to compute the numerical flux at the interface between dissimilar materials with general anisotropic properties. The space-discretized equations are then advanced in time using explicit high-order Runge–Kutta algorithms. Several two- and three-dimensional numerical tests including dynamic adaptive mesh refinement are presented to demonstrate the high-order accuracy and the capability of the method in the elastodynamic analysis of single- and bi-phases solids containing complex geometries.

42 ENGINEERING↗

A set of parallel, implicit methods for a reconstructed discontinuous Galerkin method for compressible flows on 3D hybrid grids

A set of implicit methods are proposed for a third-order hierarchical WENO reconstructed discontinuous Galerkin method for compressible flows on 3D hybrid grids. An attractive feature in these methods are the application of the Jacobian matrix based on the P1 element approximation, resulting in a huge reduction of memory requirement compared with DG (P2). Also, three approaches -- analytical derivation, divided differencing, and automatic differentiation (AD) are presented to construct the Jacobian matrix respectively, where the AD approach shows the best robustness. A variety of compressible flow problems are computed to demonstrate the fast convergence property of the implemented flow solver. Furthermore, an SPMD (single program, multiple data) programming paradigm based on MPI is proposed to achieve parallelism. The numerical results on complex geometries indicate that this low-storage implicit method can provide a viable and attractive DG solution for complicated flows of practical importance.

97 MATHEMATICS AND COMPUTING↗

A multi-dimensional, energy- and charge-conserving, nonlinearly implicit, electromagnetic Vlasov–Darwin particle-in-cell algorithm

For decades, the Vlasov–Darwin model has been recognized to be attractive for particle-in-cell (PIC) kinetic plasma simulations in non-radiative electromagnetic regimes, to avoid radiative noise issues and gain computational efficiency. However, the Darwin model results in an elliptic set of field equations that renders conventional explicit time integration unconditionally unstable. We explore a fully implicit PIC algorithm for the Vlasov–Darwin model in multiple dimensions, which overcomes many difficulties of traditional semi-implicit Darwin PIC algorithms. The finite-difference scheme for Darwin field equations and particle equations of motion is space–time-centered, employing particle sub-cycling and orbit-averaging. This algorithm conserves total energy, local charge, canonical-momentum in the ignorable direction, and preserves the Coulomb gauge exactly. An asymptotically well-posed fluid preconditioner allows efficient use of large cell sizes, which are determined by accuracy considerations, not stability, and can be orders of magnitude larger than required in a standard explicit electromagnetic PIC simulation. Finally, we demonstrate the accuracy and efficiency properties of the algorithm with various numerical experiments in 2D–3V.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A pseudospectral implicit particle-in-cell method with exact energy and charge conservation

The standard particle-in-cell (PIC) method employs explicit finite-difference (FD) methods (e.g. the leap-frog scheme) for both spatial and temporal integrations. Here, we employ a pseudospectral method for solving the Poisson equation and a fully implicit time integration to achieve exact energy conservation. The advantage of a pseudospectral field solver is its spectral accuracy in solving field solutions. Earlier studies of implicit time integration of PIC FD equations can enforce exact energy exchange between field and particles, resulting in exact energy-conserving schemes. Here, we prove that the exact energy conservation property can be carried over to the pseudospectral scheme. Simultaneously, we provide a solution to ensure a pseudospectral charge continuity equation. We demonstrate the new scheme in a 2D electrostatic PIC code. In conclusion, theoretical results are confirmed via numerical examples.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An efficient mixed-precision, hybrid CPU-GPU implementation of a nonlinearly implicit one-dimensional particle-in-cell algorithm

Recently, a fully implicit, energy- and charge-conserving particle-in-cell method has been developed for multi-scale, full-f kinetic simulations [G. Chen, et al., J. Comput. Phys. 230, 18 (2011)]. The method employs a Jacobian-free Newton-Krylov (JFNK) solver and is capable of using very large timesteps without loss of numerical stability or accuracy. A fundamental feature of the method is the segregation of particle orbit integrations from the field solver, while remaining fully self-consistent. This provides great flexibility, and dramatically improves the solver efficiency by reducing the degrees of freedom of the associated nonlinear system. However, it requires a particle push per nonlinear residual evaluation, which makes the particle push the most time-consuming operation in the algorithm. This paper describes a very efficient mixed-precision, hybrid CPU-GPU implementation of the implicit PIC algorithm. The JFNK solver is kept on the CPU (in double precision), while the inherent data parallelism of the particle mover is exploited by implementing it in single-precision on a graphics processing unit (GPU) using CUDA. Performance-oriented optimizations, with the aid of an analytical performance model, the roofline model, are employed. Despite being highly dynamic, the adaptive, charge-conserving particle mover algorithm achieves up to 300 400 GOp/s (including single-precision floating-point, integer, and logic operations) on a Nvidia GeForce GTX580, corresponding to 20 25% absolute GPU efficiency (against the peak theoretical performance) and 50-70% intrinsic efficiency (against the algorithm s maximum operational throughput, which neglects all latencies). This is about 200-300 times faster than an equivalent serial CPU implementation. When the single-precision GPU particle mover is combined with a double-precision CPU JFNK field solver, overall performance gains 100 vs. the double-precision CPU-only serial version are obtained, with no apparent loss of robustness or accuracy when applied to a challenging long-time scale ion acoustic wave simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An analytical particle mover for the charge- and energy-conserving, nonlinearly implicit, electrostatic particle-in-cell algorithm

We propose a 1D analytical particle mover for the recent charge- and energy-conserving electrostatic particle-in-cell (PIC) algorithm in Ref. [G. Chen, L. Chacón, D.C. Barnes, An energy- and charge-conserving, implicit, electrostatic particle-in-cell algorithm, Journal of Computational Physics 230 (2011) 7018–7036]. The approach computes particle orbits exactly for a given piece-wise linear electric field. The resulting PIC algorithm maintains the exact charge and energy conservation properties of the original algorithm, but with improved performance (both in efficiency and robustness against the number of particles and timestep). We demonstrate the advantageous properties of the scheme with a challenging multiscale numerical test case, the ion acoustic wave. Using the analytical mover as a reference, we demonstrate that the choice of error estimator in the Crank–Nicolson mover has significant impact on the overall performance of the implicit PIC algorithm. The generalization of the approach to the multi-dimensional case is outlined, based on a novel and simple charge conserving interpolation scheme.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Corrected Implicit Monte Carlo

Here in this work we develop a set of nonlinear correction equations to enforce a consistent time-implicit emission temperature for the original semi-implicit IMC equations. We present two possible forms of correction equations: one results in a set of non-linear, zero-dimensional, non-negative, explicit correction equations, and the other results in a non-linear, non-negative, Boltzman transport correction equation. The zero-dimensional correction equations adheres to the maximum principle for the material temperature, regardless of frequency-dependence, but does not prevent maximum principle violation in the photon intensity, eventually leading to material overheating. The Boltzman transport correction guarantees adherence to the maximum principle for frequency-independent simulations, at the cost of evaluating a reduced source non-linear Boltzman equation. Finally, we present numerical evidence suggesting that the Boltzman transport correction, in its current form, significantly improves time step limitations but does not guarantee adherence to the maximum principle for frequency-dependent simulations.

97 MATHEMATICS AND COMPUTING↗

A fully implicit, conservative, non-linear, electromagnetic hybrid particle-ion/fluid-electron algorithm

The quasi-neutral hybrid model with kinetic ions and fluid electrons is a promising approach for bridging the inherent multi-scale nature of many problems in space and laboratory plasmas. A novel, implicit, particle-in-cell based scheme for the hybrid model is derived for fully 3D electromagnetic problems with multiple ion species, which features global mass, momentum and energy conservation. The scheme includes sub-cycling and orbit-averaging for the ions, with cell-centered finite differences and implicit midpoint time advance. To reduce discrete particle noise, the scheme allows arbitrary-order shape functions for the particle-mesh interpolations and the application of conservative binomial smoothing. The algorithm is verified for a number of test problems to demonstrate the correctness of the implementation, the unique conservation properties, and the favorable stability properties of the new scheme. In particular, there is no indication of unstable growth of the finite-grid instability for a population of cold ions drifting through a uniform spatial mesh, in a set-up where several commonly used non-conservative schemes are highly unstable.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

An efficient, conservative, time-implicit solver for the fully kinetic arbitrary-species 1D-2V Vlasov-Ampère system

In this paper, we consider the solution of the fully kinetic (including electrons) Vlasov-Ampère system in a one-dimensional physical space and two-dimensional velocity space (1D-2V) for an arbitrary number of species with a time-implicit Eulerian algorithm. The problem of velocity-space meshing for disparate thermal and bulk velocities is dealt with by an adaptive coordinate transformation of the Vlasov equation for each species, which is then discretized, including the resulting inertial terms. Mass, momentum, and energy are conserved, and Gauss's law is enforced to within the nonlinear convergence tolerance of the iterative solver through a set of nonlinear constraint functions while permitting significant flexibility in choosing discretizations in time, configuration, and velocity space. We mitigate the temporal stiffness introduced by, e.g., the plasma frequency through the use of high-order/low-order (HOLO) acceleration of the iterative implicit solver. We present several numerical results for canonical problems of varying degrees of complexity, including the multiscale ion-acoustic shock wave problem, which demonstrate the efficacy, accuracy, and efficiency of the scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tusas: A fully implicit parallel approach for coupled phase-field equations

In this study, we develop a fully-coupled, fully-implicit approach for phase-field modeling of solidification in metals and alloys. Predictive simulation of solidification in pure metals and metal alloys remains a significant challenge in the field of materials science, as microstructure formation during the solidification process plays a critical role in the properties and performance of the solid material. Our simulation approach consists of a finite element spatial discretization of the fully-coupled nonlinear system of partial differential equations at the microscale, which is treated implicitly in time with a preconditioned Jacobian-free Newton-Krylov method. The approach is algorithmically scalable as well as efficient due to an effective preconditioning strategy based on algebraic multigrid and block factorization. We implement this approach in the open-source Tusas framework, which is a general, flexible tool developed in C++ for solving coupled systems of nonlinear partial differential equations. The performance of our approach is analyzed in terms of algorithmic scalability and efficiency, while the computational performance of Tusas is presented in terms of parallel scalability and efficiency on emerging heterogeneous architectures. We demonstrate that modern algorithms, discretizations, and computational science, and heterogeneous hardware provide a robust route for predictive phase-field simulation of microstructure evolution during additive manufacturing.

97 MATHEMATICS AND COMPUTING↗

Concurrent implicit spectral deferred correction scheme for low-Mach number combustion with detailed chemistry

We present a parallel multi-implicit time integration scheme for the advection-diffusion-reaction systems arising from the equations governing low-Mach number combustion with complex chemistry. Here, our strategy employs parallelisation across the method to accelerate the serial Multi-Implicit Spectral Deferred Correction (MISDC) scheme used to couple the advection, diffusion, and reaction processes. In our approach, the diffusion solves and the reaction solves are performed concurrently by different processors. Our analysis shows that the proposed parallel scheme is stable for stiff problems and that the sweeps converge to the fixed-point solution at a faster rate than with serial MISDC. We present numerical examples to demonstrate that the new algorithm is high-order accurate in time, and achieves a parallel speedup compared to serial MISDC.

97 MATHEMATICS AND COMPUTING↗

Reducing the Spatial Discretization Error of Thermal Emission in Implicit Monte Carlo Simulations

Implicit Monte Carlo simulations of thermal radiative transport can exhibit what is known as teleportation error in problems with strong coupling between radiation and matter. Teleportation error occurs when energy deposited in a localized region of a spatial zone is emitted throughout the zone in the next time step. Teleportation error is commonly reduced by biasing the positions of photon thermal emission using a fit to the spatial distribution of temperature to the fourth power. The current work samples and stores locations along photon paths based on absorption probabilities. These locations are used as sites for emission in the subsequent time step. This method of teleportation correction is demonstrated in several sample problems, and is validated against an Implicit Monte Carlo Diffusion Method, which does not exhibit teleportation error. We report the new method reduces teleportation error relative to the source tilting method, and enables the use of lower spatial resolutions than would be required to mitigate teleportation error using the source tilting method.

97 MATHEMATICS AND COMPUTING↗

Toward textbook multigrid efficiency for fully implicit resistive magnetohydrodynamics

Multigrid methods can solve some classes of elliptic and parabolic equations to accuracy below the truncation error with a work-cost equivalent to a few residual calculations – so-called “textbook” multigrid efficiency. We investigate methods to solve the system of equations that arise in time dependent magnetohydrodynamics (MHD) simulations with textbook multigrid efficiency. We apply multigrid techniques such as geometric interpolation, full approximate storage, Gauss-Seidel smoothers, and defect correction for fully implicit, nonlinear, second-order finite volume discretizations of MHD. We apply these methods to a standard resistive MHD benchmark problem, the GEM reconnection problem, and add a strong magnetic guide field, which is a critical characteristic of magnetically confined fusion plasmas. We show that our multigrid methods can achieve near textbook efficiency on fully implicit resistive MHD simulations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A comparative study of Rosenbrock-type and implicit Runge-Kutta time integration for discontinuous Galerkin method for unsteady 3D compressible Navier-Stokes equations

A comparative study of two classes of third-order implicit time integration schemes is presented for a third-order hierarchical WENO reconstructed discontinuous Galerkin (rDG) method to solve the 3D unsteady compressible Navier-Stokes equations: — 1) the explicit first stage, single diagonally implicit Runge-Kutta (ESDIRK3) scheme, and 2) the Rosenbrock-Wanner (ROW) schemes based on the differential algebraic equations (DAEs) of Index-2. Compared with the ESDIRK3 scheme, a remarkable feature of the ROW schemes is that, they only require one approximate Jacobian matrix calculation every time step, thus considerably reducing the overall computational cost. A variety of test cases, ranging from inviscid flows to DNS of turbulent flows, are presented to assess the performance of these schemes. Here, numerical experiments demonstrate that the third-order ROW scheme for the DAEs of index-2 can not only achieve the designed formal order of temporal convergence accuracy in a benchmark test, but also require significantly less computing time than its ESDIRK3 counterpart to converge to the same level of discretization errors in all of the flow simulations in this study, indicating that the ROW methods provide an attractive alternative for the higher-order time-accurate integration of the unsteady compressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗

Towards Robust and Accurate Implicit Gradient Methods for Second- and Third-Order Nodal-Gradient Cell-Centered Finite-Volume Discretizations on Tetrahedral Grids

In this paper, we introduce implicit gradient methods as alternatives to conventional least-squares gradient methods for second- and third-order nodal-gradient cell-centered finite-volume discretizations, where solutions are stored at cells but gradients are stored at nodes. Because of the unique configuration of solutions and gradients, implicit gradient systems developed for the node-centered edge-based discretization method can be directly applied once the numerical solutions are interpolated from cells to nodes with sufficient accuracy. The resulting defect-correction solver can be loosely coupled with a flow-equation solver, and at convergence, solutions and gradients that satisfy the corresponding residual equations are obtained. Each iteration is relatively cheap compared with least-squares methods involving hundreds of neighbors. Numerical results are presented for accuracy verification studies and some simple but realistic flow problems.

Computational Fluid Dynamics↗

A Study of the von Neumann Stability Analysis of a Semi-implicit Numerical Method Applied Over the Radial Impurity Transport Equation in Tokamak Plasma

The radial impurity transport equation for tokamak plasma is a form of diffusion–convection–reaction equation. The impurity transport equation is solved to determine the distribution of impurity (non-fuel) ion species with different ionization states perpendicular to magnetic surfaces of tokamak plasma. The equation for each charge (ionization) state Z is a non-linear, second-order in space, first-order in time, parabolic partial differential equation coupled to the previous Z − 1 and the next Z + 1 charge states of the impurity species through its reaction term. The number of differential equations to be solved simultaneously is hence determined by the number of ionization states of the impurity species studied. The solution to the set of these coupled equations can be obtained using a semi-implicit numerical method applied on it. The present study describes the application of von Neumann stability analysis over the semi-implicit numerical method applied over the radial impurity transport equation and determines a generic stability criterion for the method. The stability analysis is further illustrated using the geometry of Aditya tokamak installed at the Institute for Plasma Research Gandhinagar, India as an example. The impurity species considered is oxygen (Atomic number = 8). This leads to a set of eight coupled equations for charge states Z = 1 to 8 over which von Neumann analysis is illustrated in present study.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗

Mitigating Implicit Bias as a Leader

Bias. It’s a word that makes most of us squirm. Bias implies to us that we are “bad people” and are being accused of deliberately discriminating against others. Yet, if you ask a social scientist, you will find that it doesn't mean that at all; implicit bias is a neurologically based, energy-saving short cut. Our brains apply mental models to make thousands of quick decisions every day: which brand of milk to buy at the store or when to turn the wheel to avoid a traffic accident. Lastly, we form our implicit biases subconsciously over time, influenced by our upbringing, societal norms, and life experiences.

99 GENERAL AND MISCELLANEOUS↗