Search NASA⌕ Search

SEARCH · Search NASA

Results for “Implicit Runge-Kutta”

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 55 records · Page 3

Conservation properties of numerical integration methods for systems of ordinary differential equations

If a system of ordinary differential equations represents a property conserving system that can be expressed linearly (e.g., conservation of mass), it is then desirable that the numerical integration method used conserve the same quantity. It is shown that both linear multistep methods and Runge-Kutta methods are 'conservative' and that Newton-type methods used to solve the implicit equations preserve the inherent conservation of the numerical method. It is further shown that a method used by several authors is not conservative.

Rosenbaum, J. S.↗

Investigation of Advanced Counterrotation Blade Configuration Concepts for High Speed Turboprop Systems. Task 2: Unsteady Ducted Propfan Analysis

The primary objective was the development of a time dependent 3-D Euler/Navier-Stokes aerodynamic analysis to predict unsteady compressible transonic flows about ducted and unducted propfan propulsion systems at angle of attack. The resulting computer codes are referred to as Advanced Ducted Propfan Analysis Codes (ADPAC). A computer program user's manual is presented for the ADPAC. Aerodynamic calculations were based on a four stage Runge-Kutta time marching finite volume solution technique with added numerical dissipation. A time accurate implicit residual smoothing operator was used for unsteady flow predictions. For unducted propfans, a single H-type grid was used to discretize each blade passage of the complete propeller. For ducted propfans, a coupled system of five grid blocks utilizing an embedded C grid about the cowl leading edge was used to discretize each blade passage. Grid systems were generated by a combined algebraic/elliptic algorithm developed specifically for ducted propfans. Numerical calculations were compared with experimental data for both ducted and unducted flows.

Hall, Edward J.↗

A fast upwind solver for the Euler equations on three-dimensional unstructured meshes

An upwind scheme is presented for solving the three-dimensional Euler equations on unstructured tetrahedral meshes. Spatial discretization is accomplished by a cell-centered finite-volume formulation using flux-difference splitting. Higher-order differences are formed by a novel cell reconstruction process which results in computational times per cell comparable to those of structured codes. The approach yields highly resolved solutions in regions of smooth flow while avoiding oscillations across shocks without explicit limiting. Solutions are advanced in time by a 3-stage Runge-Kutta time-stepping scheme with convergence accelerated to steady state by local time stepping and implicit residual smoothing. Solutions are presented for a range of configurations in the transonic speed regime to demonstrate code accuracy, speed, and robustness. The results include an assessment of grid sensitivity and convergence acceleration by mesh sequencing.

Frink, Neal T.↗

Investigation of advanced counterrotation blade configuration concepts for high speed turboprop systems. Task 2: Unsteady ducted propfan analysis computer program users manual

The primary objective of this study was the development of a time-dependent three-dimensional Euler/Navier-Stokes aerodynamic analysis to predict unsteady compressible transonic flows about ducted and unducted propfan propulsion systems at angle of attack. The computer codes resulting from this study are referred to as Advanced Ducted Propfan Analysis Codes (ADPAC). This report is intended to serve as a computer program user's manual for the ADPAC developed under Task 2 of NASA Contract NAS3-25270, Unsteady Ducted Propfan Analysis. Aerodynamic calculations were based on a four-stage Runge-Kutta time-marching finite volume solution technique with added numerical dissipation. A time-accurate implicit residual smoothing operator was utilized for unsteady flow predictions. For unducted propfans, a single H-type grid was used to discretize each blade passage of the complete propeller. For ducted propfans, a coupled system of five grid blocks utilizing an embedded C-grid about the cowl leading edge was used to discretize each blade passage. Grid systems were generated by a combined algebraic/elliptic algorithm developed specifically for ducted propfans. Numerical calculations were compared with experimental data for both ducted and unducted propfan flows. The solution scheme demonstrated efficiency and accuracy comparable with other schemes of this class.

Hall, Edward J.↗

An ILLIAC program for the numerical simulation of homogeneous incompressible turbulence

An algorithm and ILLIAC computer program, developed for the simulation of homogeneous incompressible turbulence in the presence of an applied mean strain, are described. The turbulence field is represented spatially by a truncated triple Fourier series (spectral method) and followed in time using a fourth-order Runge-Kutta algorithm. These include: (1) transformation of variables suggested by Taylor's sudden-distortion theory; (2) implicit viscous diffusion by use of an integrating factor; (3) implicit pressure calculation suggested by Taylor's sudden-distortion theory, and (4) inexpensive control of aliasing by random and phased coordinate shifts.

Rogallo, R. S.↗

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 solution of compressible turbulent flow on unstructured meshes using a two-equation model

The system of equations consisting of the full Navier-Stokes equations and two turbulence equations was solved for in the steady state using a multigrid strategy on unstructured meshes. The flow equations and turbulence equations are solved in a loosely coupled manner. The flow equations are advanced in time using a multistage Runge-Kutta time stepping scheme with a stability bound local time step, while the turbulence equations are advanced in a point-implicit scheme with a time step which guarantees stability and positively. Low Reynolds number modifications to the original two equation model are incorporated in a manner which results in well behaved equations for arbitrarily small wall distances. A variety of aerodynamic flows are solved for, initializing all quantities with uniform freestream values, and resulting in rapid and uniform convergence rates for the flow and turbulence equations.

Mavriplis, D. J.↗

Multigrid solution of compressible turbulent flow on unstructured meshes using a two-equation model

The system of equations consisting of the full Navier-Stokes equations and two turbulence equations has been solved for in the steady-state using a multigrid strategy on unstructured meshes. The flow equations and turbulence equations are solved in a loosely coupled manner. The flow equations are advanced in time using a multistage Runge-Kutta time stepping scheme with a stability bound local time-step, while the turbulence equations are advanced in a point-implicit scheme with a time-step which guarantees stability and positivity. Low Reynolds number modifications to the original two-equation model are incorporated in a manner which results in well behaved equations for arbitrarily small wall distances. A variety of aerodynamic flows are solved for, initializing all quantities with uniform freestream values, and resulting in rapid and uniform convergence rates for the flow and turbulence equations.

Mavriplis, D. J.↗

The efficient calculation of chemically reacting flow

A semi-implicit finite volume formulation is used to study flows with chemical reactions. In this formulation the source terms resulting from the chemical reactions are treated implicitly and the resulting system of partial differential equations is solved using two time-stepping schemes. The first is based on the Runge-Kutta method while the second is based on an Adams predictor-corrector method. Results show that improvements in computational efficiency depend to a large extent on the manner in which the source term is treated. Further, analysis and computation indicate that the Runge-Kutta method is more efficient than the Adams methods. Finally, an adaptive time stepping scheme is developed to study problems involving shock ignition. Calculations for a hydrogen-air system agree well with other methods.

Eklund, D. R.↗

Formulation of boundary conditions for the multigrid acceleration of the Euler and Navier Stokes equations

An explicit, Multigrid algorithm was written to solve the Euler and Navier-Stokes equations with special consideration given to the coarse mesh boundary conditions. These are formulated in a manner consistent with the interior solution, utilizing forcing terms to prevent coarse-mesh truncation error from affecting the fine-mesh solution. A 4-Stage Hybrid Runge-Kutta Scheme is used to advance the solution in time, and Multigrid convergence is further enhanced by using local time-stepping and implicit residual smoothing. Details of the algorithm are presented along with a description of Jameson's standard Multigrid method and a new approach to formulating the Multigrid equations.

Jentink, Thomas Neil↗

On the Solution of the Three-Dimensional Flowfield About a Flow-Through Nacelle

The solution of the three dimensional flow field for a flow through nacelle was studied. Both inviscid and viscous inviscid interacting solutions were examined. Inviscid solutions were obtained with two different computational procedures for solving the three dimensional Euler equations. The first procedure employs an alternating direction implicit numerical algorithm, and required the development of a complete computational model for the nacelle problem. The second computational technique employs a fourth order Runge-Kutta numerical algorithm which was modified to fit the nacelle problem. Viscous effects on the flow field were evaluated with a viscous inviscid interacting computational model. This model was constructed by coupling the explicit Euler solution procedure with a flag entrainment boundary layer solution procedure in a global iteration scheme. The computational techniques were used to compute the flow field for a long duct turbofan engine nacelle at free stream Mach numbers of 0.80 and 0.94 and angles of attack of 0 and 4 deg.

Compton, William Bernard↗

Non-linear effects on sound propagation in a variable area duct carrying high subsonic Mach number flows

The general one-dimensional non-linear equation for the acoustic velocity potential in a variable area duct carrying high subsonic Mach number flows is presented and solved numerically using an implicit finite difference scheme. For the linearized equation with no flow, the present scheme is compared with the exact solution and the fourth-order Runge-Kutta method with excellent agreement for dimensionless time periods. Non-linear solutions are more sensitive to Mach numbers and exciting amplitudes and less sensitive to exciting frequencies. In general, non-linear effects can be safely neglected for low Mach number flows but must be accounted for when high Mach number flows are encountered.

Lumsdaine, E.↗

Spectral methods for modeling supersonic chemically reacting flow fields

A numerical algorithm was developed for solving the equations describing chemically reacting supersonic flows. The algorithm employs a two-stage Runge-Kutta method for integrating the equations in time and a Chebyshev spectral method for integrating the equations in space. The accuracy and efficiency of the technique were assessed by comparison with an existing implicit finite-difference procedure for modeling chemically reacting flows. The comparison showed that the procedure presented yields equivalent accuracy on much coarser grids as compared to the finite-difference procedure with resultant significant gains in computational efficiency.

Drummond, J. P.↗

An explicit Runge-Kutta method for 3D turbulent incompressible flows

A computer code has been developed to solve for the steady-state solution of the 3D incompressible Reynolds-averaged Navier-Stokes equations. The approach is based on the cell-center, central-difference, finite-volume formulation and an explicit one-step, multistage Runge-Kutta time-stepping scheme. The Baldwin-Lomax turbulence model is used. Techniques to accelerate the rate of convergence to a steady-state solution include the preconditioned method, the local time stepping, and the implicit residual smoothing. Improvements in computational efficiency have been demonstrated in several areas. This numerical procedure has been used to simulate the turbulent horseshoe vortex flow around an airfoil/flat-plate juncture.

Sung, Chao-Ho↗

Computer program for solving laminar, transitional, or turbulent compressible boundary-layer equations for two-dimensional and axisymmetric flow

A numerical algorithm and computer program are presented for solving the laminar, transitional, or turbulent two dimensional or axisymmetric compressible boundary-layer equations for perfect-gas flows. The governing equations are solved by an iterative three-point implicit finite-difference procedure. The software, program VGBLP, is a modification of the approach presented in NASA TR R-368 and NASA TM X-2458, respectively. The major modifications are: (1) replacement of the fourth-order Runge-Kutta integration technique with a finite-difference procedure for numerically solving the equations required to initiate the parabolic marching procedure; (2) introduction of the Blottner variable-grid scheme; (3) implementation of an iteration scheme allowing the coupled system of equations to be converged to a specified accuracy level; and (4) inclusion of an iteration scheme for variable-entropy calculations. These modifications to the approach presented in NASA TR R-368 and NASA TM X-2458 yield a software package with high computational efficiency and flexibility. Turbulence-closure options include either two-layer eddy-viscosity or mixing-length models. Eddy conductivity is modeled as a function of eddy viscosity through a static turbulent Prandtl number formulation. Several options are provided for specifying the static turbulent Prandtl number. The transitional boundary layer is treated through a streamwise intermittency function which modifies the turbulence-closure model. This model is based on the probability distribution of turbulent spots and ranges from zero to unity for laminar and turbulent flow, respectively. Several test cases are presented as guides for potential users of the software.

Harris, J. E.↗

Comparison of three explicit multigrid methods for the Euler and Navier-Stokes equations

Three explicit multigrid methods, Ni's method, Jameson's finite-volume method, and a finite-difference method based on Brandt's work, are described and compared for two model problems. All three methods use an explicit multistage Runge-Kutta scheme on the fine grid, and this scheme is also described. Convergence histories for inviscid flow over a bump in a channel for the fine-grid scheme alone show that convergence rate is proportional to Courant number and that implicit residual smoothing can significantly accelerate the scheme. Ni's method was slightly slower than the implicitly-smoothed scheme alone. Brandt's and Jameson's methods are shown to be equivalent in form but differ in their node versus cell-centered implementations. They are about 8.5 times faster than Ni's method in terms of CPU time. Results for an oblique shock/boundary layer interaction problem verify the accuracy of the finite-difference code. All methods slowed considerably on the stretched viscous grid but Brandt's method was still 2.1 times faster than Ni's method.

Chima, Rodrick V.↗

Comparison of three explicit multigrid methods for the Euler and Navier-Stokes equations

Three explicit multigrid methods, Ni's method, Jameson's finite-volume method, and a finite-difference method based on Brandt's work, are described and compared for two model problems. All three methods use an explicit multistage Runge-Kutta scheme on the fine grid, and this scheme is also described. Convergence histories for inviscid flow over a bump in a channel for the fine-grid scheme alone show that convergence rate is proportional to Courant number and that implicit residual smoothing can significantly accelerate the scheme. Ni's method was slightly slower than the implicitly-smoothed scheme alone. Brandt's and Jameson's methods are shown to be equivalent in form but differ in their node versus cell-centered implementations. They are about 8.5 times faster than Ni's method in terms of CPU time. Results for an oblique shock/boundary layer interaction problem verify the accuracy of the finite-difference code. All methods slowed considerably on the stretched viscous grid but Brandt's method was still 2.1 times faster than Ni's method.

Chima, Rodrick V.↗

Accuracy of schemes for the Euler equations with non-uniform meshes

The effect of non-uniform grids on the solution of the Euler equations is analyzed. A Runge-Kutta type scheme based on a finite volume formulation is considered. It is shown that for arbitrary grids the scheme can be inconsistent even though it is second-order accurate for uniform grids. An improvement is suggested which leads to at least first-order accuracy for general grids. Test cases are presented in both two- and three-space dimensions. Applications to finite difference and implicit algorithms are also given.

Turkel, E.↗