Search NASA⌕ Search

SEARCH · Search NASA

Results for “implicit and explicit algorithms”

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 127 records · Page 7

High Performance Parallel Methods for Space Weather Simulations

This is the final report of our NASA AISRP grant entitled 'High Performance Parallel Methods for Space Weather Simulations'. The main thrust of the proposal was to achieve significant progress towards new high-performance methods which would greatly accelerate global MHD simulations and eventually make it possible to develop first-principles based space weather simulations which run much faster than real time. We are pleased to report that with the help of this award we made major progress in this direction and developed the first parallel implicit global MHD code with adaptive mesh refinement. The main limitation of all earlier global space physics MHD codes was the explicit time stepping algorithm. Explicit time steps are limited by the Courant-Friedrichs-Lewy (CFL) condition, which essentially ensures that no information travels more than a cell size during a time step. This condition represents a non-linear penalty for highly resolved calculations, since finer grid resolution (and consequently smaller computational cells) not only results in more computational cells, but also in smaller time steps.

Hunter, Paul↗

Finite element dynamic analysis on CDC STAR-100 computer

Computational algorithms are presented for the finite element dynamic analysis of structures on the CDC STAR-100 computer. The spatial behavior is described using higher-order finite elements. The temporal behavior is approximated by using either the central difference explicit scheme or Newmark's implicit scheme. In each case the analysis is broken up into a number of basic macro-operations. Discussion is focused on the organization of the computation and the mode of storage of different arrays to take advantage of the STAR pipeline capability. The potential of the proposed algorithms is discussed and CPU times are given for performing the different macro-operations for a shell modeled by higher order composite shallow shell elements having 80 degrees of freedom.

Noor, A. K.↗

Computations of Unsteady Viscous Compressible Flows Using Adaptive Mesh Refinement in Curvilinear Body-fitted Grid Systems

A methodology for accurate and efficient simulation of unsteady, compressible flows is presented. The cornerstones of the methodology are a special discretization of the Navier-Stokes equations on structured body-fitted grid systems and an efficient solution-adaptive mesh refinement technique for structured grids. The discretization employs an explicit multidimensional upwind scheme for the inviscid fluxes and an implicit treatment of the viscous terms. The mesh refinement technique is based on the AMR algorithm of Berger and Colella. In this approach, cells on each level of refinement are organized into a small number of topologically rectangular blocks, each containing several thousand cells. The small number of blocks leads to small overhead in managing data, while their size and regular topology means that a high degree of optimization can be achieved on computers with vector processors.

Steinthorsson, E.↗

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↗

Finite element algorithms for compressible flow computation on a supercomputer

Methods of applying computational fluid dynamics techniques to engineering problems are discussed. The linking factors between theoretical and applied research are the shape and weight functions which produce the Galerkin finite element schemes. The flow is unsteady, viscous, heat conducting and compressible, and steady-state flows are the asymptotic limit of unsteady flows. All flows are described by the time-averaged Navier-Stokes equations (NSE) with mass and energy conservation. Local curvilinear intrinsic coordinates are applied to discretize the NSE in arbitrary geometric domains. A modified weighted residuals approach defines the discrete analogs of the physical systems modeled and a general interpolants method is used to derive families of numerical models, both implicit and explicit, finite difference and finite elemnt, from a single point of departure. Time-dependent element approximations are achieved with a progressive assembly of generalized elements method. Hyperbolic steady-state Euler algorithms and quasi-parabolic are spatial marching algorithms for solving the discretized equations. Application of the techniques is illustrated through calculation of the compressible flow around a hypersonic flight vehicle at 100,000 ft at zero angle of attack at speeds of Mach 4-10.

Spradley, L. W.↗

Adaptive Numerical Algorithms in Space Weather Modeling

Space weather describes the various processes in the Sun-Earth system that present danger to human health and technology. The goal of space weather forecasting is to provide an opportunity to mitigate these negative effects. Physics-based space weather modeling is characterized by disparate temporal and spatial scales as well as by different physics in different domains. A multi-physics system can be modeled by a software framework comprising of several components. Each component corresponds to a physics domain, and each component is represented by one or more numerical models. The publicly available Space Weather Modeling Framework (SWMF) can execute and couple together several components distributed over a parallel machine in a flexible and efficient manner. The framework also allows resolving disparate spatial and temporal scales with independent spatial and temporal discretizations in the various models. Several of the computationally most expensive domains of the framework are modeled by the Block-Adaptive Tree Solar wind Roe Upwind Scheme (BATS-R-US) code that can solve various forms of the magnetohydrodynamics (MHD) equations, including Hall, semi-relativistic, multi-species and multi-fluid MHD, anisotropic pressure, radiative transport and heat conduction. Modeling disparate scales within BATS-R-US is achieved by a block-adaptive mesh both in Cartesian and generalized coordinates. Most recently we have created a new core for BATS-R-US: the Block-Adaptive Tree Library (BATL) that provides a general toolkit for creating, load balancing and message passing in a 1, 2 or 3 dimensional block-adaptive grid. We describe the algorithms of BATL and demonstrate its efficiency and scaling properties for various problems. BATS-R-US uses several time-integration schemes to address multiple time-scales: explicit time stepping with fixed or local time steps, partially steady-state evolution, point-implicit, semi-implicit, explicit/implicit, and fully implicit numerical schemes. Depending on the application, we find that different time stepping methods are optimal. Several of the time integration schemes exploit the block-based granularity of the grid structure. The framework and the adaptive algorithms enable physics based space weather modeling and even forecasting.

Toth, Gabor↗

An adaptive implicit/explicit finite element scheme for compressible viscous high speed flow

An adaptive implicit/explicit finite element procedure for the solution of three-dimensional problems of steady compressible viscous high-speed flows is presented. In the vicinity of solid walls, a grid-exhibiting structure in the normal direction is employed, while away from this region the grid is totally unstructured. The implicit form of the algorithm is used near solid walls, with the grid structure being utilized in an equation solution approach based upon line relaxation. The explicit form of the algorithm is used elsewhere. Grid adaptation is achieved by means of adaptive remeshing. To illustrate the performance of the proposed method, solutions are obtained for the problems of shock-boundary layer interaction and shock-shock interaction on a swept cylindrical leading edge. Comparisons are made with experimental observations.

Hassan, O.↗

The simulation of 2D compressible viscous high speed flow by the finite element method

Am implicit/explicit procedure for the solution of problems of two-dimensional steady compressible viscous high-speed flows is presented. In the vicinity of solid walls, a grid which need only exhibit structure in the normal direction is employed while, away from this region, the grid is totally unstructured. The implicit form of the algorithm is used near solid walls, with the grid structure being utilized in an equation solution approach, based upon line relaxation. The explicit form of the algorithm is used elsewhere. Grid adaptation is achieved by means of adaptive remeshing. To illustrate the performance of the proposed method, problems of shock-boundary layer interaction and flow over a simulated forebody at high Mach number are included.

Hassan, O.↗

Upwind MacCormack Euler solver with non-equilibrium chemistry

A computer code, designated UMPIRE, is currently under development to solve the Euler equations in two dimensions with non-equilibrium chemistry. UMPIRE employs an explicit MacCormack algorithm with dissipation introduced via Roe's flux-difference split upwind method. The code also has the capability to employ a point-implicit methodology for flows where stiffness is introduced through the chemical source term. A technique consisting of diagonal sweeps across the computational domain from each corner is presented, which is used to reduce storage and execution requirements. Results depicting one dimensional shock tube flow for both calorically perfect gas and thermally perfect, dissociating nitrogen are presented to verify current capabilities of the program. Also, computational results from a chemical reactor vessel with no fluid dynamic effects are presented to check the chemistry capability and to verify the point implicit strategy.

Sherer, Scott E.↗

A viscous shock-layer flowfield analysis by an explicit-implicit method

An implicit analogue of a widely used explicit method to external axisymmetric laminar flows with strong entropy gradients is extended. The details of the "numerics" of the implicit part are provided in a body oriented coordinate system with a moving outer (shock) boundary during the transient part of the solutions. The limiting values of the Courant number are obtained when the shock boundary is treated explicitly. The solution algorithm outlined includes the treatment of the source term associated with the equations in weak conservation form. From the results obtained for two sample problems, it becomes clear that accuracy of predictions is, indeed, very good at higher values of the Courant number. There is a significant saving in overall computing time, depending on the Courant number used and the flow Reynolds number. These properties combined with the simplicity of programming the implicit analog may appeal to researchers for using it in the analysis of 3-D flow problems.

Gupta, R. M.↗

A Comparison of Three Programming Models for Adaptive Applications

We study the performance and programming effort for two major classes of adaptive applications under three leading parallel programming models. We find that all three models can achieve scalable performance on the state-of-the-art multiprocessor machines. The basic parallel algorithms needed for different programming models to deliver their best performance are similar, but the implementations differ greatly, far beyond the fact of using explicit messages versus implicit loads/stores. Compared with MPI and SHMEM, CC-SAS (cache-coherent shared address space) provides substantial ease of programming at the conceptual and program orchestration level, which often leads to the performance gain. However it may also suffer from the poor spatial locality of physically distributed shared data on large number of processors. Our CC-SAS implementation of the PARMETIS partitioner itself runs faster than in the other two programming models, and generates more balanced result for our application.

Shan, Hong-Zhang↗

Viscous shock-layer flowfield analysis by an explicit-implicit method

The present work extends the recently reported implicit analogue of MacCormack's earlier widely-used explicit method to external axisymmetric laminar flows with strong entropy gradients. The details of the 'numerics' of the implicit part are provided in a body-oriented coordinate system with a moving outer (shock) boundary during the transient part of the solutions. The limiting values of the Courant number are obtained when the shock boundary is treated explicitly. The solution algorithm outlined includes the treatment of the source term associated with the equations in weak conservation form. From the results obtained for two sample problems, it becomes clear that accuracy of predictions is, indeed, very good at higher values of the Courant number. There is a significant saving in overall computing time, depending on the Courant number used and the flow Reynolds number. These properties combined with the simplicity of programming the implicit analogue may appeal to researchers for using it in the analysis of three-dimensional flow problems.

Gupta, R. N.↗

Convergence speeding up in the calculation of the viscous flow about an airfoil

A finite volume method to solve the three dimensional Navier-Stokes equations was developed. It is based on a cell-vertex scheme with central differences and explicit Runge-Kutta time steps. A good convergence for a stationary solution was obtained by the use of local time steps, implicit smoothing of the residues, a multigrid algorithm, and a carefully controlled artificial dissipative term. The method is illustrated by results for transonic profiles and airfoils. The method allows a routine solution of the Navier-Stokes equations.

Radespiel, R.↗

Multigrid Strategies for Viscous Flow Solvers on Anisotropic Unstructured Meshes

Unstructured multigrid techniques for relieving the stiffness associated with high-Reynolds number viscous flow simulations on extremely stretched grids are investigated. One approach consists of employing a semi-coarsening or directional-coarsening technique, based on the directions of strong coupling within the mesh, in order to construct more optimal coarse grid levels. An alternate approach is developed which employs directional implicit smoothing with regular fully coarsened multigrid levels. The directional implicit smoothing is obtained by constructing implicit lines in the unstructured mesh based on the directions of strong coupling. Both approaches yield large increases in convergence rates over the traditional explicit full-coarsening multigrid algorithm. However, maximum benefits are achieved by combining the two approaches in a coupled manner into a single algorithm. An order of magnitude increase in convergence rate over the traditional explicit full-coarsening algorithm is demonstrated, and convergence rates for high-Reynolds number viscous flows which are independent of the grid aspect ratio are obtained. Further acceleration is provided by incorporating low-Mach-number preconditioning techniques, and a Newton-GMRES strategy which employs the multigrid scheme as a preconditioner. The compounding effects of these various techniques on speed of convergence is documented through several example test cases.

Movriplis, Dimitri J.↗

Generalized formulation of a class of explicit and implicit TVD schemes

A one parameter family of second order explicit and implicit total variation diminishing (TVD) schemes is reformulated so that a simpler and wider group of limiters is included. The resulting scheme can be viewed as a symmetrical algorithm with a variety of numerical dissipation terms that are designed for weak solutions of hyperbolic problems. This is a generalization of Roe and Davis's recent works to a wider class of symmetric schemes other than Lax-Wendroff. The main properties of the present class of schemes are that they can be implicit, and when steady state calculations are sought, the numerical solution is independent of the time step.

Yee, H. C.↗

Adaptive explicit and implicit finite element methods for transient thermal analysis

The application of adaptive finite element methods to the solution of transient heat conduction problems in two dimensions is investigated. The computational domain is represented by an unstructured assembly of linear triangular elements and the mesh adaptation is achieved by local regeneration of the grid, using an error estimation procedure coupled to an automatic triangular mesh generator. Two alternative solution procedures are considered. In the first procedure, the solution is advanced by explicit timestepping, with domain decomposition being used to improve the computational efficiency of the method. In the second procedure, an algorithm for constructing continuous lines which pass only once through each node of the mesh is employed. The lines are used as the basis of a fully implicit method, in which the equation system is solved by line relaxation using a block tridiagonal equation solver. The numerical performance of the two procedures is compared for the analysis of a problem involving a moving heat source applied to a convectively cooled cylindrical leading edge.

Probert, E. J.↗

Application and implementation of transient algorithms in computer programs

A brief introduction is given to the nonlinear finite element programs developed at Lawrence Livermore National Laboratory. The four programs are DYNA3D and DYNA2D, which are explicit hydrocodes, and NIKE3D and NIKE2D, which are implicit programs. The main emphasis is on DYNA3D with asides about the other programs. During the past year several new features were added to DYNA3D, and major improvements were made in the computational efficiency of the shell and beam elements. Most of these new features and improvements will eventually make their way into the other programs. The emphasis in the computational mechanics effort was always, and continues to be, efficiency. To get the most out of the supercomputers, all Crays, the programs were vectorized where possible. Several of the more interesting capabilities of DYNA3D will be described and the impact on efficiency will be discussed. Some of the recent work on NIKE3D and NIKE2D will also be presented. In the belief that a single example is worth a thousand equations, the theory is skipped entirely and the examples presented.

Benson, David J.↗

Parabolized Navier-Stokes algorithm for chemically reacting flows

A second-order parabolized Navier-Stokes algorithm based on the MacCormack (1969) explicit scheme is used to study three-dimensional chemically reacting flows with finite-rate chemistry. The method can treat the chemical source term implicitly, and it accounts for the multicomponent diffusion and convection of the chemical species. The method is demonstrated with the nonreacting case of a Mach-3 flow over a double-wedge compression corner and the case of streamwise hydrogen injection at sonic velocity in a Mach-2.44 vitiated air stream.

Kamath, H.↗