Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “implicit schemes”

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 253 records · Page 14

Fourier Analysis of the Multilevel QD Method with {alpha}-Approximation For Time-Dependent Radiative Transfer Problems

Thermal radiation transfer (TRT) problems describe interaction of photon radiation with matter. They are defined by the time-dependent radiative transfer (RT) equation for the specific intensity I coupled with the energy balance (EB) equation. This class of problems is characterised by high dimensionality, multiple scales and strong nonlinearity. In this paper we analyze the multilevel quasi-diffusion (QD) method for solving TRT problems. This is a nonlinear method of moments with exact closures. The QD method enables one to reduce dimensionality of the original radiative transfer problem. It is formulated by a nonlinear system of equations consisting of (i) the high-order RT (HORT) equation for the intensity of photon radiation and (ii) low-order equations for the angular and energy moments of the intensity. The nonlinear closures are formulated by means of stable factors. The low-order problem brings the radiative transfer model to the level of multi-physics equations. The multilevel QD (MLQD) method possesses attractive features for efficient multi-physics coupling. To calculate the high-order RT solution we apply the {alpha}-approximation which assumes that the intensity changes exponentially in time over a time step. The {alpha}-approximation leads to the steady-state RT equation with a modified opacity and enables one to avoid storing the high-dimensional solution from the previous time step. The rate of change is evaluated by the solution of the time-dependent low-order QD (LOQD) equations for moments. We note that the HORT equation in the {alpha}-approximation contains an extra nonlinear term. It affects the iterative behaviour of the MLQD method. The obtained computational results indicated that the rate of convergence is slower compared to the rate when the time-dependent HORT is used to calculate the intensity. In this paper we perform an iterative stability analysis of the MLQD method in a discretized form and analyze convergence of outer (transport) iterations on a time step. We consider multigroup TRT problems in 1D slab geometry. The fully implicit scheme is used to discretize equations in time. The HORT equation is approximated with the method of step characteristics. A finite volume method is applied for spatial discretization of multigroup LOQD equations. The grey (one-group) LOQD equations are algebraically consistent with the multigroup LOQD equations. To perform Fourier analysis a model TRT problem in an infinite homogeneous medium is considered. The system of nonlinear equations of the MLQD method is linearized near an equilibrium solution at some given temperature. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

On a fourth order accurate implicit finite difference scheme for hyperbolic conservation laws. I - Nonstiff strongly dynamic problems

An implicit finite difference method of fourth order accuracy in space and time is introduced for the numerical solution of one-dimensional systems of hyperbolic conservation laws. The basic form of the method is a two-level scheme which is unconditionally stable and nondissipative. The scheme uses only three mesh points at level t and three mesh points at level t + delta t. The dissipative version of the basic method given is conditionally stable under the CFL (Courant-Friedrichs-Lewy) condition. This version is particularly useful for the numerical solution of problems with strong but nonstiff dynamic features, where the CFL restriction is reasonable on accuracy grounds. Numerical results are provided to illustrate properties of the proposed method.

Harten, A.↗

The Implicit and Explicit alpha-mu Schemes

Artificial numerical dissipation is an important issue in large Reynolds number computations. In such computations, the artificial dissipation inherent in traditional numerical schemes can overwhelm the physical dissipation and yield inaccurate results on meshes of practical size. In the present work, the space-time conservation element and solution element method is used to construct new and accurate numerical schemes such that artificial numerical dissipation will not overwhelm physical dissipation. Specifically, these schemes have the property that numerical dissipation vanishes when the physical viscosity goes to zero. These new schemes therefore accurately model the physical dissipation even when it is extremely small. The method of space-time conservation element and solution element, currently under development, is a nontraditional numerical method for solving conservation laws. The method is developed on the basis of local and global flux conservation in a space-time domain, in which space and time are treated in a unified manner. Explicit solvers for model and fluid dynamic conservation laws have previously been investigated. In this paper, we introduce a new concept in the design of implicit schemes, and use it to construct two highly accurate solvers for a convection-diffusion equation. The two schemes become identical in the pure convection case, and in the pure diffusion case. The implicit schemes are applicable over the whole Reynolds number range, from purely diffusive equations to purely inviscid (convective) equations. The stability and consistency of the schemes are analyzed, and some numerical results are presented. It is shown that, in the inviscid case, the new schemes become explicit and their amplification factors are identical to those of the Leapfrog scheme. On the other hand, in the pure diffusion case, their principal amplification factor becomes the amplification factor of the Crank-Nicolson scheme. We also construct an explicit solver with the treatment of diffusion being based on that in the implicit solvers. The explicit solver has only a CFL stability limitation on the Courant number, yet it retains the second-order spatial accuracy of the implicit schemes.

Chang, Sin-Chung↗

A full-implicit-continuous-Eulerian (FICE) scheme for multidimensional transient magnetohydrodynamic (MHD) flows

A full implicit continuous Eulerian (FICE) scheme is developed for solving multidimensional transient MHD flow problems. The physical system under consideration is a general case of a transient MHD flow in which an initial steady state is subject to a finite amplitude disturbance. The governing equations are described, their finite difference formulation is presented and the FICE algorithm is given. The boundary conditions are treated by classifying them into physical and computational ones. The usefulness of the FICE algorithm is demonstrated using a physical example concerning the dynamical response of the static solar atmosphere due to a representative photospheric disturbance.

Wu, S. T.↗

An implicit, conservative, zonal-boundary scheme for Euler equation calculations

A zonal, or patched, grid approach is one in which the flow region of interest is divided into subregions which are then discretized independently, using existing grid generators. The equations of motion are integrated in each subregion in conjunction with zonal boundary schemes which allow proper information transfer across interfaces that separate subregions. The zonal approach greatly simplifies the treatment of complex geometries and also the addition of grid points to selected regions of the flow. A conservative, zonal boundary condition that could be used with explicit schemes was extended so that it can be used with existing second order accurate implicit integration schemes such as the Beam-Warming and Osher schemes. In the test case considered, the implicit schemes increased the rate of convergence considerably (by a factor of about 30 over that of the explicit scheme). Results demonstrating the time accuracy of the zonal scheme and the feasibility of performing calculations on zones that move relative to each other are also presented.

Rai, M. M.↗

Implicit conservative characteristic modeling schemes for the Euler equations - A new approach

An implicit characteristic-modeling solution scheme for the Euler equations is presented. The scheme does not require the governing equations to be written in characteristic variables or the flux terms to be split into positive and negative contributions. For the two-dimensional problem of a shock wave reflecting from a flat plate, this feature and the simple solution algorithm combine to reduce the computational work per mesh point by 40 percent from that required by a standard, central-difference, implicit, solution algorithm. Application of the method to the quasi-one-dimensional nozzle flow equations for subsonic and supersonic flows without shocks shows the method to be well-conditioned for large time steps.

Wornom, S. F.↗

An implicit, conservative, zonal-boundary scheme for Euler equation calculations

A 'zonal', or 'patched-grid', approach is one in which the flow region of interest is divided into subregions which are then discretized independently, using existing grid generators. The equations of motion are integrated in each subregion in conjunction with zonal-boundary schemes which allow proper information transfer across interfaces that separate subregions. The zonal approach greatly simplifies the treatment of complex geometries and also the addition of grid points to selected regions of the flow. In this study a conservative, zonal-boundary condition that could be used with explicit schemes has been extended so that it can be used with existing second-order-accurate implicit integration schemes such as the Beam-Warming and Osher schemes. In the test case considered, the implicit schemes increased the rate of convergence considerably (by a factor of about 30 over that of the explicit scheme). Results demonstrating the time-accuracy of the zonal scheme and the feasibility of performing calculations on zones that move relative to each other are also presented.

Rai, M. M.↗

An Implicit, Conservative, Zonal-Boundary Scheme for Euler Equation Calculations

A "zonal," or "patched-grid," approach is one in which the flow region of interest is divided into subregions which are then discretized independently, using existing grid generators. The equations of motion are integrated in each subregion in conjunction with zonal-boundary schemes which allow proper information transfer across interfaces that separate subregions. The zonal approach greatly simplifies the treatment of complex geometries and also the addition of grid points to selected regions of the flow. In this study a conservative, zonal-boundary condition that could be used with explicit schemes has been extended so that it can be used with existing second-order accurate implicit integration schemes such as the Beam-Warming and Osher schemes. In the test case considered, the implicit schemes increased the rate of convergence considerably (by a factor of about 30 over that of the explicit scheme). Results demonstrating the time-accuracy of the zonal scheme and the feasibility of performing calculations on zones that move relative to each other are also presented.

Rai, Man Mohan↗

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↗

Hyperbolic/parabolic development for the GIM-STAR code

Flow fields in supersonic inlet configurations were computed using the eliptic GIM code on the STAR computer. Spillage flow under the lower cowl was calculated to be 33% of the incoming stream. The shock/boundary layer interaction on the upper propulsive surface was computed including separation. All shocks produced by the flow system were captured. Linearized block implicit (LBI) schemes were examined to determine their application to the GIM code. Pure explicit methods have stability limitations and fully implicit schemes are inherently inefficient; however, LBI schemes show promise as an effective compromise. A quasiparabolic version of the GIM code was developed using elastical parabolized Navier-Stokes methods combined with quasitime relaxation. This scheme is referred to as quasiparabolic although it applies equally well to hyperbolic supersonic inviscid flows. Second order windward differences are used in the marching coordinate and either explicit or linear block implicit time relaxation can be incorporated.

Spradley, L. W.↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

Efficient iterative solution methods are being developed for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. Thus, the extra work required by iterative schemes can also be designed to perform efficiently on current and future generation scalable, missively parallel machines. An obvious candidate for iteratively solving the system of coupled nonlinear algebraic equations arising in CFD applications is the Newton method. Newton's method was implemented in existing finite difference and finite volume methods. Depending on the complexity of the problem, the number of Newton iterations needed per step to solve the discretized system of equations can, however, vary dramatically from a few to several hundred. Another popular approach based on the classical conjugate gradient method, known as the GMRES (Generalized Minimum Residual) algorithm is investigated. The GMRES algorithm was used in the past by a number of researchers for solving steady viscous and inviscid flow problems with considerable success. Here, the suitability of this algorithm is investigated for solving the system of nonlinear equations that arise in unsteady Navier-Stokes solvers at each time step. Unlike the Newton method which attempts to drive the error in the solution at each and every node down to zero, the GMRES algorithm only seeks to minimize the L2 norm of the error. In the GMRES algorithm the changes in the flow properties from one time step to the next are assumed to be the sum of a set of orthogonal vectors. By choosing the number of vectors to a reasonably small value N (between 5 and 20) the work required for advancing the solution from one time step to the next may be kept to (N+1) times that of a noniterative scheme. Many of the operations required by the GMRES algorithm such as matrix-vector multiplies, matrix additions and subtractions can all be vectorized and parallelized efficiently.

Sankar, Lakshmi N.↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

The development of efficient iterative solution methods for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations is discussed. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. In this work, another approach based on the classical conjugate gradient method, known as the Generalized Minimum Residual (GMRES) algorithm is investigated. The GMRES algorithm has been used in the past by a number of researchers for solving steady viscous and inviscid flow problems. Here, we investigate the suitability of this algorithm for solving the system of non-linear equations that arise in unsteady Navier-Stokes solvers at each time step.

Sankar, Lakshmi N.↗

A compatible high-order meshless method for the Stokes equations with applications to suspension flows

A stable numerical solution of the steady Stokes problem requires compatibility between the choice of velocity and pressure approximation that has traditionally proven problematic for meshless methods. Here in this work, we present a discretization that couples a staggered scheme for pressure approximation with a divergence-free velocity reconstruction to obtain an adaptive, high-order, finite difference-like discretization that can be efficiently solved with conventional algebraic multigrid techniques. We use analytic benchmarks to demonstrate equal-order convergence for both velocity and pressure when solving problems with curvilinear geometries. In order to study problems in dense suspensions, we couple the solution for the flow to the equations of motion for freely suspended particles in an implicit monolithic scheme. The combination of high-order accuracy with fully-implicit schemes allows the accurate resolution of stiff lubrication forces directly from the solution of the Stokes problem without the need to introduce sub-grid lubrication models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An L-U implicit multigrid algorithm for the three-dimensional Euler equations

An LU implicit multigrid scheme is developed for the calculation of three-dimensional transonic flow through rotating cascades. This numerical method solves the unsteady Euler equations of gas dynamics in a finite-volume form. The implicit scheme makes it possible to take a much larger time step than is normally permitted in most explicit schemes, while the multigrid method is incorporated to accelerate the convergence rate for steady state calculations. Using this method, computational storage requirements are comparable to those of explicit schemes, while operation counts are considerably less than those found in the more widely-used ADI schemes.

Yokota, Jeffrey W.↗

Adaptive implicit-explicit and parallel element-by-element iteration schemes

Adaptive implicit-explicit (AIE) and grouped element-by-element (GEBE) iteration schemes are presented for the finite element solution of large-scale problems in computational mechanics and physics. The AIE approach is based on the dynamic arrangement of the elements into differently treated groups. The GEBE procedure, which is a way of rewriting the EBE formulation to make its parallel processing potential and implementation more clear, is based on the static arrangement of the elements into groups with no inter-element coupling within each group. Various numerical tests performed demonstrate the savings in the CPU time and memory.

Tezduyar, T. E.↗

Implicit approximate-factorization schemes for the efficient solution of steady transonic flow problems

Implicit approximate-factorization algorithms (AF) are developed for the solution of steady-state transonic flow problems. The performance of the AF solution method is evaluated relative to that of the standard solution method for transonic flow problems, successive line over-relaxation (SLOR). Both methods are applied to the solution of the nonlinear, two-dimensional transonic small-disturbance equation. Results indicate that the AF method requires substantially less computer time than SLOR to solve the nonlinear finite-difference matrix equation for a transonic flow field. This increase in computational efficiency is achieved with no appreciable increase in computer storage or coding complexity.

Ballhaus, W. F.↗