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 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Implicit flux-corrected transport scheme for low-speed flow

A new high-order nonlinear Eulerian convection algorithm, the barely implicit correction (BIC)-FCT method, is presented. The BIC-FCT makes it possible to perform accurate, multidimensional, slow-flow calculations in which the fluid expansion is important. Owing to its low cost even in two dimensions, fairly detailed chemistry models and other physical processes can be included. Areas of BIC-FCT applicability include premixed flames, diffusion flames, and turbulent jet flames.

Patnaik, G.↗
NASA NTRS1990

Implicit flux-split Euler schemes for unsteady aerodynamic analysis involving unstructured dynamic meshes

Improved algorithm for the solution of the time-dependent Euler equations are presented for unsteady aerodynamic analysis involving unstructured dynamic meshes. The improvements were developed recently to the spatial and temporal discretizations used by unstructured grid flow solvers. The spatial discretization involves a flux-split approach which is naturally dissipative and captures shock waves sharply with at most one grid point within the shock structure. The temporal discretization involves an implicit time-integration scheme using a Gauss-Seidel relaxation procedure which is computationally efficient for either steady or unsteady flow problems. For example, very large time steps may be used for rapid convergence to steady state, and the step size for unsteady cases may be selected for temporal accuracy rather than for numerical stability. Steady and unsteady flow results are presented for the NACA 0012 airfoil to demonstrate applications of the new Euler solvers. The unsteady results were obtained for the airfoil pitching harmonically about the quarter chord. The resulting instantaneous pressure distributions and lift and moment coefficients during a cycle of motion compare well with experimental data. A description of the Euler solvers is presented along with results and comparisons which assess the capability.

Batina, John T.↗
NASA NTRS1984

A conservative treatment of zonal boundaries for Euler equation calculations

Finite-difference calculations require the generation of a grid for the region of interest. A zonal approach, wherein the given region is subdivided into zones and the grid for each zone is generated independently, makes the grid-generation process for complicated topologies and for regions requiring selective grid refinement a fairly simple task. This approach results in new boundaries within the given region, that is, zonal boundaries at the interfaces of the various zones. The zonal-boundary scheme (the integration scheme used to update the points on the zonal boundary) for the Euler equations must be conservative, accurate, stable, and applicable to general curvilinear coordinate systems. A zonal-boundary scheme with these desirable properties is developed in this study. The scheme is designed for explicit, first-order-accurate integration schemes but can be modified to accommodate second-order-accurate explicit and implicit integration schemes. Results for inviscid flow, including supersonic flow over a cylinder, blast-wave diffraction by a ramp, and one-dimensional shock-tube flow are obtained on zonal grids. The conservative nature of the zonal-boundary scheme permits the smooth transition of the discontinuities associated with these flows from one zone to another. The calculations also demonstrate the continuity of contour lines across zonal boundaries that can be achieved with the present zonal scheme.

Rai, M. M.↗
NASA NTRS1986

A Conservation Treatment of Zonal Boundaries for Euler Equation Calculations

Finite-difference calculations require the generation of a grid for the region of interest. A zonal approach, wherein the given region is subdivided into zones and the grid for each zone is generated independently, makes the grid-generation process for complicated topologies and for regions requiring selective grid refinement a fairly simple task. This approach results in new boundaries within the given region, that is, zonal boundaries at the interfaces of the various zones. The zonal-boundary scheme (the integration scheme used to update the points on the zonal boundary) for the Euler equations must be conservative, accurate, stable, and applicable to general curvilinear coordinate systems. A zonal-boundary scheme with these desirable properties is developed in this study. The scheme is designed for explicit, first-order-accurate integration schemes but can be modified to accommodate second-order-accurate explicit and implicit integration schemes. Results for inviscid flow, including supersonic flow over a cylinder, blast-wave diffraction by a ramp, and one-dimensional shock-tube flow are obtained on zonal grids. The conservative nature of the zonal-boundary scheme permits the smooth transition of the discontinuities associated with these flows from one zone to another. The calculations also demonstrate the continuity of contour lines across zonal boundaries that can be achieved with the present zonal scheme.

Rai, Man Mohan↗
NASA NTRS1994

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on an MIMD (multiple instruction/multiple data stream) parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed, one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the iPSC/860.

Venkatakrishnan, V.↗
NASA NTRS1994

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on a multiple-instruction/multiple-data stream parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed: one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All of the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the Intel iPSC/860.

TRT-THEORETICAL↗
DOE OSTI2020

Robust Learning with Implicit Residual Networks

In this effort, we propose a new deep architecture utilizing residual blocks inspired by implicit discretization schemes. As opposed to the standard feed-forward networks, the outputs of the proposed implicit residual blocks are defined as the fixed points of the appropriately chosen nonlinear transformations. We show that this choice leads to the improved stability of both forward and backward propagations, has a favorable impact on the generalization power, and allows for control the robustness of the network with only a few hyperparameters. In addition, the proposed reformulation of ResNet does not introduce new parameters and can potentially lead to a reduction in the number of required layers due to improved forward stability. Finally, we derive the memory-efficient training algorithm, propose a stochastic regularization technique, and provide numerical results in support of our findings.

Reshniak, Viktor↗
DOE OSTI2024

Uniform accuracy of implicit-explicit Runge-Kutta (IMEX-RK) schemes for hyperbolic systems with relaxation

Implicit-explicit Runge-Kutta (IMEX-RK) schemes are popular methods to treat multiscale equations that contain a stiff part and a non-stiff part, where the stiff part is characterized by a small parameter. Here, in this work, we prove rigorously the uniform stability and uniform accuracy of a class of IMEX-RK schemes for a linear hyperbolic system with stiff relaxation. The result we obtain is optimal in the sense that it holds regardless of the value of and the order of accuracy is the same as the design order of the original scheme, i.e., there is no order reduction.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1999

Implicit Space-Time Conservation Element and Solution Element Schemes

Artificial numerical dissipation is in 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 implicit 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 new schemes presented are two highly accurate implicit 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 convection-dominated equations with very small viscosity. The stability and consistency of the schemes are analysed, 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.

Chang, Sin-Chung↗
NASA NTRS1989

Multigrid calculation of three-dimensional turbomachinery flows

Research was performed in the general area of computational aerodynamics, with particular emphasis on the development of efficient techniques for the solution of the Euler and Navier-Stokes equations for transonic flows through the complex blade passages associated with turbomachines. In particular, multigrid methods were developed, using both explicit and implicit time-stepping schemes as smoothing algorithms. The specific accomplishments of the research have included: (1) the development of an explicit multigrid method to solve the Euler equations for three-dimensional turbomachinery flows based upon the multigrid implementation of Jameson's explicit Runge-Kutta scheme (Jameson 1983); (2) the development of an implicit multigrid scheme for the three-dimensional Euler equations based upon lower-upper factorization; (3) the development of a multigrid scheme using a diagonalized alternating direction implicit (ADI) algorithm; (4) the extension of the diagonalized ADI multigrid method to solve the Euler equations of inviscid flow for three-dimensional turbomachinery flows; and also (5) the extension of the diagonalized ADI multigrid scheme to solve the Reynolds-averaged Navier-Stokes equations for two-dimensional turbomachinery flows.

Caughey, David A.↗
NASA NTRS2010

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↗
NASA NTRS1997

Robust Integration Schemes for Generalized Viscoplasticity with Internal-State Variables

The scope of the work in this presentation focuses on the development of algorithms for the integration of rate dependent constitutive equations. In view of their robustness; i.e., their superior stability and convergence properties for isotropic and anisotropic coupled viscoplastic-damage models, implicit integration schemes have been selected. This is the simplest in its class and is one of the most widely used implicit integrators at present.

Saleeb, Atef F.↗
NASA NTRS1985

Computing with high-resolution upwind schemes for hyperbolic equations

Computational aspects of modern high-resolution upwind finite-difference schemes for hyperbolic systems of conservation laws are examined. An operational unification is demonstrated for constructing a wide class of flux-difference-split and flux-split schemes based on the design principles underlying total variation diminishing (TVD) schemes. Consideration is also given to TVD scheme design by preprocessing, the extension of preprocessing and postprocessing approaches to general control volumes, the removal of expansion shocks and 'glitches', relaxation methods for implicit TVD schemes, and a new family of high-accuracy TVD schemes.

Chakravarthy, S. R.↗
NASA NTRS1980

Alternating direction implicit methods for parabolic equations with a mixed derivative

Alternating direction implicit (ADI) schemes for two-dimensional parabolic equations with a mixed derivative are constructed by using the class of all A(0)-stable linear two-step methods in conjunction with the method of approximate factorization. The mixed derivative is treated with an explicit two-step method which is compatible with an implicit A(0)-stable method. The parameter space for which the resulting ADI schemes are second-order accurate and unconditionally stable is determined. Some numerical examples are given.

Beam, R. M.↗
DOE OSTI2018

Numerical Method for Fractional Advection-Diffusion Equation with Heredity

We propose a method of construction of difference schemes for fractional partial differential equations with delay in time. For the fractional equation with two-sided diffusion, fractional transfer in time, and a functional aftereffect, we construct an implicit difference scheme. We use the shifted Grünwald–Letnikov formulas for the approximation of fractional derivatives with respect to spatial variables and the L1-algorithm for the approximation of fractional derivatives in time. Also we use piecewise constant interpolation and extrapolation by extending the discrete prehistory of the model in time. The algorithm is a fractional analog of a purely implicit method; on each time step, it is reduced to the solution of linear algebraic systems. We prove the stability of the method and find its order of convergence.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

High Order Strong Stability Preserving MultiDerivative Implicit and IMEX Runge--Kutta Methods with Asymptotic Preserving Properties

In this article we present a class of high order unconditionally strong stability preserving (SSP) implicit two-derivative Runge--Kutta schemes and SSP implicit-explicit (IMEX) multi-derivative Runge--Kutta schemes where the time-step restriction is independent of the stiff term. The unconditional SSP property for a method of order $p>2$ is unique among SSP methods and depends on a backward-in-time assumption on the derivative of the operator. We show that this backward derivative condition is satisfied in many relevant cases where SSP IMEX schemes are desired. We devise unconditionally SSP implicit Runge--Kutta schemes of order up to $p=4$ and IMEX Runge--Kutta schemes of order up to $p=3$. For the multiderivative IMEX schemes, we also derive and present the order conditions, which have not appeared previously. The unconditional SSP condition ensures that these methods are positivity preserving, and we present sufficient conditions under which such methods are also asymptotic preserving when applied to a range of problems, including a hyperbolic relaxation system, the Broadwell model, and the Bhatnagar--Gross--Krook kinetic equation. We present numerical results to support the theoretical results on a variety of problems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1977

Computations of supersonic viscous flow over a finite-width plate

Finite difference methods were applied to solve the parabolic Navier-Stokes equations for the flow over a finite width plate at 0 deg and 10 deg angles of attack. The methods were developed on the basis of the operator factorization concept resulting in the split of a three dimensional equation into successive two dimensional equations. Backward and centered implicit factorization schemes, were used and their results were compared. Available numerical solutions and experimental data obtained at low Reynolds number conditions were also used for comparison. The backward implicit method provides a more successful solution, which ranges from the merged layer to the strong interaction regimes. Detailed structures were revealed of the shear layer around and behind the side edge.

Li, C. P.↗
NASA NTRS1979

Alternating direction implicit methods for parabolic equations with a mixed derivative

Alternating direction implicit (ADI) schemes for two-dimensional parabolic equations with a mixed derivative are constructed by using the class of all A sub 0-stable linear two-step methods in conjunction with the method of approximation factorization. The mixed derivative is treated with an explicit two-step method which is compatible with an implicit A sub 0-stable method. The parameter space for which the resulting ADI schemes are second order accurate and unconditionally stable is determined. Some numerical examples are given.

Beam, R. M.↗