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 559 records · Page 31

Numerical solution of compressible viscous flows at high Reynolds numbers

A new numerical method which was used to reduce the computation time required in fluid dynamics to solve the Navier-Stokes equations at flight Reynolds numbers is described. The method is the implicit analogue of the explicit finite different method. It uses this as its first stage, while the second stage removes the restrictive stability condition by recasting the difference equations in an implicit form. The resulting matrix equations to be solved are either upper or lower block bidiagonal equations. The new method makes it possible and practical to calculate many important three dimensional, high Reynolds number flow fields on computers.

Maccormack, R. W.↗

Choice of implicit and explicit operators for the upwind differencing method

The flux-vector and flux-difference splittings of Steger-Warming, van Leer and Roe are tested in all possible combinations on the implicit and explicit operators that can be distinguished in implicit relaxation methods for the steady Euler and Navier-Stokes equations. The tests include one-dimensional inviscid nozzle flow, and two-dimensional inviscid and viscous shock reflection. Roe's splitting, as anticipated, is found to uniformly yield the most accurate results. On the other hand, an approximate Roe splitting of the implicit operator (the complete Roe splitting is too complicated for practical use) proves to be the least robust with regard to convergence to the steady state. In this respect, the Steger-Warming splitting is the most robust; it leads to convergence when combined with any of the splittings in the explicit operator, although not necessarily in the most efficient way.

Liou, Meng-Sing↗

Choice of implicit and explicit operators for the upwind differencing method

The flux-vector and flux-difference splittings of Steger-Warming, Van Leer and Roe are tested in all possible combinations in the implicit and explicit operators that can be distinguished in implicit relaxation methods for the steady Euler and Navier-Stokes equations. The tests include one-dimensional inviscid nozzle flow, and two-dimensional inviscid and viscous shock reflection. Roe's splitting, as anticipated, is found to uniformly yield the most accurate results. On the other hand, an approximate Roe splitting of the implicit operator (the complete Roe splitting is too complicated for practical use) proves to be the least robust with regard to convergence to the steady state. In this respect, the Steger-Warming splitting is the most robust: it leads to convergence when combined with any of the splittings in the explicit operator, although not necessarily in the most efficient way.

Liou, Meng-Sing↗

FLIP MHD - A particle-in-cell method for magnetohydrodynamics

The fluid-implicit-particle, or 'FLIP' method presently extended to 2D and 3D MHD flow incorporates a Lagrangian field representation and yields a grid magnetic Reynolds number of up to 16 while preserving contact continuities that retain the Galilean invariance of the MHD flow equations. Analytical arguments and numerical examples demonstrate the conservation of mass, momentum, magnetic flux, and energy; 2D calculation results for the illustrative cases of contact discontinuity convection, Rayleigh-Taylor unstable flow.

Brackbill, J. U.↗

Overcoming Geometry-Induced Stiffness with IMplicit-Explicit (IMEX) Runge-Kutta Algorithms on Unstructured Grids with Applications to CEM, CFD, and CAA

My goal is to develop and implement efficient, accurate, and robust Implicit-Explicit Runge-Kutta (IMEX RK) methods [9] for overcoming geometry-induced stiffness with applications to computational electromagnetics (CEM), computational fluid dynamics (CFD) and computational aeroacoustics (CAA). IMEX algorithms solve the non-stiff portions of the domain using explicit methods, and isolate and solve the more expensive stiff portions using implicit methods. Current algorithms in CEM can only simulate purely harmonic (up to lOGHz plane wave) EM scattering by fighter aircraft, which are assumed to be pure metallic shells, and cannot handle the inclusion of coatings, penetration into and radiation out of the aircraft. Efficient MEX RK methods could potentially increase current CEM capabilities by 1-2 orders of magnitude, allowing scientists and engineers to attack more challenging and realistic problems.

Kanevsky, Alex↗

Analysis of composite ablators using massively parallel computation

In this work, the feasibility of using massively parallel computation to study the response of ablative materials is investigated. Explicit and implicit finite difference methods are used on a massively parallel computer, the Thinking Machines CM-5. The governing equations are a set of nonlinear partial differential equations. The governing equations are developed for three sample problems: (1) transpiration cooling, (2) ablative composite plate, and (3) restrained thermal growth testing. The transpiration cooling problem is solved using a solution scheme based solely on the explicit finite difference method. The results are compared with available analytical steady-state through-thickness temperature and pressure distributions and good agreement between the numerical and analytical solutions is found. It is also found that a solution scheme based on the explicit finite difference method has the following advantages: incorporates complex physics easily, results in a simple algorithm, and is easily parallelizable. However, a solution scheme of this kind needs very small time steps to maintain stability. A solution scheme based on the implicit finite difference method has the advantage that it does not require very small times steps to maintain stability. However, this kind of solution scheme has the disadvantages that complex physics cannot be easily incorporated into the algorithm and that the solution scheme is difficult to parallelize. A hybrid solution scheme is then developed to combine the strengths of the explicit and implicit finite difference methods and minimize their weaknesses. This is achieved by identifying the critical time scale associated with the governing equations and applying the appropriate finite difference method according to this critical time scale. The hybrid solution scheme is then applied to the ablative composite plate and restrained thermal growth problems. The gas storage term is included in the explicit pressure calculation of both problems. Results from ablative composite plate problems are compared with previous numerical results which did not include the gas storage term. It is found that the through-thickness temperature distribution is not affected much by the gas storage term. However, the through-thickness pressure and stress distributions, and the extent of chemical reactions are different from the previous numerical results. Two types of chemical reaction models are used in the restrained thermal growth testing problem: (1) pressure-independent Arrhenius type rate equations and (2) pressure-dependent Arrhenius type rate equations. The numerical results are compared to experimental results and the pressure-dependent model is able to capture the trend better than the pressure-independent one. Finally, a performance study is done on the hybrid algorithm using the ablative composite plate problem. It is found that there is a good speedup of performance on the CM-5. For 32 CPU's, the speedup of performance is 20. The efficiency of the algorithm is found to be a function of the size and execution time of a given problem and the effective parallelization of the algorithm. It also seems that there is an optimum number of CPU's to use for a given problem.

Shia, David↗

Additive Runge-Kutta Schemes for Convection-Diffusion-Reaction Equations

Additive Runge-Kutta (ARK) methods are investigated for application to the spatially discretized one- dimensional convection-diffusion-reaction (CDR) equations. Accuracy, stability, conservation, and dense-output are first considered for the general case when N different Runge-Kutta methods are grouped into a single composite method. Then, implicit-explicit, (N = 2), additive Runge-Kutta (ARK(sub 2)) methods from third- to fifth-order are presented that allow for integration of stiff terms by an L-stable, stiffly-accurate explicit, singly diagonally implicit Runge-Kutta (ESDIRK) method while the nonstiff terms are integrated with a traditional explicit Runge-Kutta method (ERK). Coupling error terms of the partitioned method are of equal order to those of the elemental methods. Derived ARK(sub 2) methods have vanishing stability functions for very large values of the stiff scaled eigenvalue, z['] yields -infinity, and retain high stability efficiency in the absence of stiffness, z['] yield 0. Extrapolation-type stage- value predictors are provided based on dense-output formulae. Optimized methods minimize both leading order ARK(sub 2) error terms and Butcher coefficient magnitudes as well as maximize conservation properties. Numerical tests of the new schemes on a CDR problem show negligible stiffness leakage and near classical order convergence rates. However, tests on three simple singular-perturbation problems reveal generally predictable order reduction. Error control is best managed with a PID-controller. While results for the fifth-order method are disappointing, both the new third- and fourth-order methods are at least as efficient as existing ARK(sub 2) methods.

Kennedy, Christopher A.↗

Fully implicit shock tracking

A tracking method for solving hyperbolic free boundary problems arising in fluid dynamics is presented. The principal feature of the new approach is that the implicit form is used to simultaneously treat both interior points and boundary conditions. In particular, the location of the free boundary (shock) surface is treated implicitly and coupled with all other unknowns. The method is presented in the context of unsteady one-dimensional flow in a variable area duct with an internal shock wave. The fully implicit method and other strategies for advancing the shock are compared for computing a steady solution via a time asymptotic approach. Issues regarding extension of the method to multiple dimensions are also discussed.

Bell, J. B.↗

High-Order/Low-Order methods for ocean modeling

We examine a High Order/Low Order (HOLO) approach for a z-level ocean model and show that the traditional semi-implicit and split-explicit methods, as well as a recent preconditioning strategy, can easily be cast in the framework of HOLO methods. The HOLO formulation admits an implicit-explicit method that is algorithmically scalable and second-order accurate, allowing timesteps much larger than the barotropic time scale. We demonstrate how HOLO approaches, in particular the implicit-explicit method, can provide a solid route for ocean simulation to heterogeneous computing and exascale environments.

16 TIDAL AND WAVE POWER↗

Fast solutions to the steady state compressible and incompressible fluid dynamic equations

For low speed flows the use of the compressible fluid dynamic equations is inefficient. The use of an explicit scheme requires delta t to be bounded by 1/c. However, the physical parameters change over time scales of order 1/u which is much larger. Hence, it is not appropriate to use explicit schemes for very subsonic flows. Implicit schemes are hard to vectorize and frequently do not converge quickly for very subsonic flows. If one is only interested in the steady state then a minor change to an existing code can greatly increase the efficiency of an explicit method. Even when using an implicit method the proposed changes increase the efficiency of the scheme. The Euler equations for low speed flows will be considered first and then incompressible flows. The method is generalized to include viscous effects. Supersonic flow is accelerated by essentially decoupling the equations.

Turkel, E.↗

Boyd Report1

Andrew Crow arrived at Lawrence Livermore National Laboratory with the intention of continuing work on the Complex Particle Kinetic (CPK) method developed D. Larson and D. Hewett. Andrew Crow had previously worked on duplicating the results of D. Hewett in his previous work. Since arrival, A. Crow has been working with D. Larson on a slightly different project. The current method, still under development, is a Particle in Cell (PIC) code with the following features: (1) all particles begin each timestep at a gridpoint; (2) particles are then advanced in time using a standard special advancement method. The exact method has not been decided upon, but there are many reliable methods from which to choose. (3) All particles within each cell undergo a simultaneous implicit collision step. This is the current area of focus. Currently, A. Crow is not aware of any method of performing implicit collisions over a large number of charged particles. Implicit methods for charged particle movement and electron-electron collisions, have been developed. The work of L. pareschi and G. Russo on the Time Relaxed Direct Simulation Monte Carlo method, also appears to be a good basis for implicit particle collisions. (4) Each individual particle will be divided into a set of particles with a Gaussian velocity distribution. This will collect some of the thermal effects created by the collisions. This algorithm has not been created. (5) Particles will be projected on to the grid points. Currently, a linear weighting technique is intended to be used, but has not settled upon. (6) Once on the gridpoints the particle number will be reduced using a set of quadrature points based on the third order velocity moments of the particles. The method proposed by R. Fox has been programmed and shown to conserve energy, momentum and mass to machine precision. In addition to reducing the number of particles this method will work to quiet the simulation it will behave as a higher order version of the Quiet DSMC method proposed by B. Albright et al. (7) These quadrature points then become the new particles for the next timestep. the advantage of this method can be many: The self force on ions can be easily removed since all particles begin on grid points. The size of the timesteps should not be limited by collision rate, and should only be impacted by particle travel time through the cell. The particle reduction technique should keep many of the higher order features of the particle distribution while reducing the number of particles in the system. It should also quite the variance in the system. The two largest unknowns, at this time are, how large a part numerical diffusion will play in the scheme and how computationally expensive each timestep will be.

42 ENGINEERING↗

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.

97 MATHEMATICS AND COMPUTING↗

Iterative Implicit Monte Carlo

Here, we describe a new Monte Carlo thermal radiation transport method that is fully implicit in the value of matter temperature used to calculate thermal emission. This method involves iterating on the matter temperature until convergence at the end of the time-step value of the matter temperature is obtained. Because the method is fully implicit, it eliminates the violations of the maximum principle that can occur in Implicit Monte Carlo (IMC) simulations on the problems on which we have tested it. The method has the drawback that it is considerably more expensive than IMC for simulations with cold opaque regions. We discuss the reasons for this, and discuss some ways that the number of iterations may be reduced.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Hybrid Gradient Method to Designing Bayesian Experiments for Implicit Models

Bayesian experimental design (BED) aims at designing an experiment to maximize the information gathering from the collected data. The optimal design is usually achieved by maximizing the mutual information (MI) between the data and the model parameters. When the analytical expression of the MI is unavailable, e.g.,having implicit models with intractable data distributions, a neural network-based lower bound of the MI was recently proposed and a gradient ascent method was used to maximize the lower bound [1]. However, the approach in [1] requires a pathwise sampling path to compute the gradient of the MI lower bound with respect to the design variables, and such a pathwise sampling path is usually inaccessible for implicit models. In this work, we propose a hybrid gradient approach that leverages recent advances in variational MI estimator and evolution strategies (ES)combined with black-box stochastic gradient ascent (SGA) to maximize the MI lower bound. This allows the design process to be achieved through a unified scalable procedure for implicit models without sampling path gradients. Several experiments demonstrate that our approach significantly improves the scalability of BED for implicit models in high-dimensional design space.

Zhang, Jiaxin↗

Stage-parallel fully implicit Runge–Kutta solvers for discontinuous Galerkin fluid simulations

In this paper, we develop new techniques for solving the large, coupled linear systems that arise from fully implicit Runge–Kutta methods. This method makes use of the iterative preconditioned GMRES algorithm for solving the linear systems, which has seen success for fluid flow problems and discontinuous Galerkin discretizations. By transforming the resulting linear system of equations, one can obtain a method which is much less computationally expensive than the untransformed formulation, and which compares competitively with other time-integration schemes, such as diagonally implicit Runge–Kutta (DIRK) methods. We develop and test several ILU-based preconditioners effective for these large systems. We additionally employ a parallel-in-time strategy to compute the Runge–Kutta stages simultaneously. Numerical experiments are performed on the Navier–Stokes equations using Euler vortex and 2D and 3D NACA airfoil test cases in serial and in parallel settings. In conclusion, the fully implicit Radau IIA Runge–Kutta methods compare favorably with equal-order DIRK methods in terms of accuracy, number of GMRES iterations, number of matrix–vector multiplications, and wall-clock time, for a wide range of time steps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗