Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Runge Kutta 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 217 records · Page 12

Frequency Domain Calculations Of Acoustic Propagation

Two complex geometry problems are solved using the linearized Euler equations. The impedance mismatch method1 is used to impose the solid surfaces without the need to use a body-fitted grid. The problem is solved in the frequency domain to avoid long run times. Although the harmonic assumption eliminates all time dependence, a pseudo-time term is added to allow conventional iterative methods to be employed. A Jameson type, Runge-Kutta scheme is used to advance the solution in pseudo time. The spatial operator is based on a seven-point, sixth-order finite difference. Constant coefficient, sixth-derivative artificial dissipation is used throughout the domain. A buffer zone technique employing a complex frequency to damp all waves near the boundaries is used to minimize reflections. The results show that the method is capable of capturing the salient features of the scattering, but an excessive number of grid points are required to resolve the phenomena in the vicinity of the solid bodies because the wavelength of the acoustics is relatively short compared with the size of the bodies. Smoothly transitioning into the immersed boundary condition alleviates the difficulties, but a fine mesh is still required.

Lockard, David P.↗

Distributed Minimal Residual (DMR) method for acceleration of iterative algorithms

A new method for enhancing the convergence rate of iterative algorithms for the numerical integration of systems of partial differential equations was developed. It is termed the Distributed Minimal Residual (DMR) method and it is based on general Krylov subspace methods. The DMR method differs from the Krylov subspace methods by the fact that the iterative acceleration factors are different from equation to equation in the system. At the same time, the DMR method can be viewed as an incomplete Newton iteration method. The DMR method was applied to Euler equations of gas dynamics and incompressible Navier-Stokes equations. All numerical test cases were obtained using either explicit four stage Runge-Kutta or Euler implicit time integration. The formulation for the DMR method is general in nature and can be applied to explicit and implicit iterative algorithms for arbitrary systems of partial differential equations.

Lee, Seungsoo↗

An interactive adaptive remeshing algorithm for the two-dimensional Euler equations

An interactive adaptive remeshing algorithm utilizing a frontal grid generator and a variety of time integration schemes for the two-dimensional Euler equations on unstructured meshes is presented. Several device dependent interactive graphics interfaces have been developed along with a device independent DI-3000 interface which can be employed on any computer that has the supporting software including the Cray-2 supercomputers Voyager and Navier. The time integration methods available include: an explicit four stage Runge-Kutta and a fully implicit LU decomposition. A cell-centered finite volume upwind scheme utilizing Roe's approximate Riemann solver is developed. To obtain higher order accurate results a monotone linear reconstruction procedure proposed by Barth is utilized. Results for flow over a transonic circular arc and flow through a supersonic nozzle are examined.

Slack, David C.↗

A method of weighted residuals with trigonometric basis functions for sound transmission in circular ducts

The method of weighted residuals (MWR) in the form of a modified Galerkin method with trigonometric basis functions is used to compute the transmission of sound in an axisymmetric duct. The method is used to generate the axial wave number for uniform ducts. These are compared with exact solutions generated by a formal eigenvalue routine in the hard-wall case and a Runge-Kutta integration eigenvalue scheme in the soft-wall case. The method is applicable to both flow and no-flow cases.

Vo, P. T.↗

Computations of Flow Over the Hump Model Using Higher-Order Method With Turbulence Modeling

The flow over the two-dimensional hump model is computed by solving the RANS equations with kappa-omega (SST) model. The governing equations, the flow equations and the turbulent equations, are solved using the 5th order accurate weighted essentially non-oscillatory (WENO) scheme for space discretization and using explicit third order total-variation-diminishing (TVD) Runge-Kutta scheme for time integration. The WENO and the TVD methods and the formulas are explained in [1] and the application of ENO method to N-S equations is given in [2]. The solution method implemented in this computation is described in detail in [3].

Balakumar, P.↗

A cell-vertex multigrid method for the Navier-Stokes equations

A cell-vertex scheme for the Navier-Stokes equations, which is based on central difference approximations and Runge-Kutta time stepping, is described. Using local time stepping, implicit residual smoothing, a multigrid method, and carefully controlled artificial dissipative terms, very good convergence rates are obtained for a wide range of two- and three-dimensional flows over airfoils and wings. The accuracy of the code is examined by grid refinement studies and comparison with experimental data. For an accurate prediction of turbulent flows with strong separations, a modified version of the nonequilibrium turbulence model of Johnson and King is introduced, which is well suited for an implementation into three-dimensional Navier-Stokes codes. It is shown that the solutions for three-dimensional flows with strong separations can be dramatically improved, when a nonequilibrium model of turbulence is used.

Radespiel, R.↗

DEAN: A program for dynamic engine analysis

The Dynamic Engine Analysis program, DEAN, is a FORTRAN code implemented on the IBM/370 mainframe at NASA Lewis Research Center for digital simulation of turbofan engine dynamics. DEAN is an interactive program which allows the user to simulate engine subsystems as well as a full engine systems with relative ease. The nonlinear first order ordinary differential equations which define the engine model may be solved by one of four integration schemes, a second order Runge-Kutta, a fourth order Runge-Kutta, an Adams Predictor-Corrector, or Gear's method for still systems. The numerical data generated by the model equations are displayed at specified intervals between which the user may choose to modify various parameters affecting the model equations and transient execution. Following the transient run, versatile graphics capabilities allow close examination of the data. DEAN's modeling procedure and capabilities are demonstrated by generating a model of simple compressor rig.

Sadler, G. G.↗

DEAN - A program for Dynamic Engine ANalysis

The Dynamic Engine Analysis Program, DEAN, is a FORTRAN code implemented on the IBM/370 mainframe at NASA Lewis Research Center for digital simulation of turbofan engine dynamics. DEAN is an interactive program which allows the user to simulate engine subsystems as well as full engine systems with relative ease. The nonlinear first order ordinary differential equations which define the engine model may be solved by one of four integration schemes, a second order Runge-Kutta, a fourth order Runge-Kutta, an Adams Predictor-Corrector, or Gear's method for still systems. The numerical data generated by the model equations are displayed a specified intervals between which the user may choose to modify various parameters affecting the model equations and transient execution. Following the transient run, versatile graphics capabilities allow close examination of the data. DEAN's modeling procedure and capabilities are demonstrated by generating a model of simple compressor rig.

Sadler, G. G.↗

A multiple-block multigrid method for the solution of the three-dimensional Euler and Navier-Stokes equations

A multiple block multigrid method for the solution of the three dimensional Euler and Navier-Stokes equations is presented. The basic flow solver is a cell vertex method which employs central difference spatial approximations and Runge-Kutta time stepping. The use of local time stepping, implicit residual smoothing, multigrid techniques and variable coefficient numerical dissipation results in an efficient and robust scheme is discussed. The multiblock strategy places the block loop within the Runge-Kutta Loop such that accuracy and convergence are not affected by block boundaries. This has been verified by comparing the results of one and two block calculations in which the two block grid is generated by splitting the one block grid. Results are presented for both Euler and Navier-Stokes computations of wing/fuselage combinations.

Atkins, Harold↗

Nonlinear wave choked inlets

The quasi-one dimensional flow program was modified in two ways. The Runge-Kutta subroutine was replaced with a subroutine which used a modified divided difference form of the Adams Pece method and the matrix inversion routine was replaced with a pseudo inverse routine. Calculations were run using both the original and modified programs. Comparison of the calculations showed that the original Runge-Kutta routine could not detect singularity near the throat and was integrating across it. The modified version was able to detect the singularity and therefore gave more valid calculations.

Source record↗

Pseudo-time algorithms for the Navier-Stokes equations

A pseudo-time method is introduced to integrate the compressible Navier-Stokes equations to a steady state. This method is a generalization of a method used by Crocco and also by Allen and Cheng. We show that for a simple heat equation that this is just a renormalization of the time. For a convection-diffusion equation the renormalization is dependent only on the viscous terms. We implement the method for the Navier-Stokes equations using a Runge-Kutta type algorithm. This permits the time step to be chosen based on the inviscid model only. We also discuss the use of residual smoothing when viscous terms are present.

Swanson, R. C.↗

Unsteady Euler solution of transonic helicopter rotor flow

A new time-accurate Euler method is presented for calculating the transonic flow over a lifting or nonlifting rotor blade in both hover and forward flight. The approach is to solve the conservative Euler equations in a rotor-fixed frame of reference using a finite-volume method. The discretized equations are solved by using a Runge-Kutta multistage scheme with a new higher-order implicit residual smoothing procedure. Preliminary results were compared with wind-tunnel data. In all the cases considered, good agreement was found with experimental data.

Chang, I-Chung↗

A multi-block multigrid method for the solution of the Euler and Navier-Stokes equations for three-dimensional flows

A multi-block multigrid method for the solution of the three-dimensional Euler and Navier-Stokes equations is presented. The basic flow solver is a cell-vertex method which employs central-difference spatial approximations and Runge-Kutta time stepping. The use of local time stepping, implicit residual smoothing, multigrid techniques, and variable-coefficient numerical smoothing results in an efficient and robust scheme. The multi-block strategy places the block loop within the Runge-Kutta loop such that accuracy and convergence are not affected by block boundaries. This has been verified by comparing the results of one- and two-block calculations in which the two-block grid is generated by splitting the one-block grid. Results are presented for both Euler and Navier-Stokes computations of wings and wing-fuselage combinations.

Atkins, H. L.↗

Viscous analysis of three-dimensional rotor flows using a multigrid method

A three-dimensional code for rotating blade-row flow analysis was developed. The space discretization uses a cell-centered scheme with eigenvalues scaling for the artificial dissipation. The computational efficiency of a four-stage Runge-Kutta scheme is enhanced by using variable coefficients, implicit residual smoothing, and a full-multigrid method. An application is presented for the NASA rotor 67 transonic fan. Due to the blade stagger and twist, a zonal, non-periodic H-type grid is used to minimize the mesh skewness. The calculation is validated by comparing it with experiments in the range from the maximum flow rate to a near-stall condition. A detailed study of the flow structure near peak efficiency and near stall is presented by means of pressure distribution and particle traces inside boundary layers.

Arnone, A.↗

High-Order Implicit-Explicit Multi-Block Time-stepping Method for Hyperbolic PDEs

This work seeks to explore and improve the current time-stepping schemes used in computational fluid dynamics (CFD) in order to reduce overall computational time. A high-order scheme has been developed using a combination of implicit and explicit (IMEX) time-stepping Runge-Kutta (RK) schemes which increases numerical stability with respect to the time step size, resulting in decreased computational time. The IMEX scheme alone does not yield the desired increase in numerical stability, but when used in conjunction with an overlapping partitioned (multi-block) domain significant increase in stability is observed. To show this, the Overlapping-Partition IMEX (OP IMEX) scheme is applied to both one-dimensional (1D) and two-dimensional (2D) problems, the nonlinear viscous Burger's equation and 2D advection equation, respectively. The method uses two different summation by parts (SBP) derivative approximations, second-order and fourth-order accurate. The Dirichlet boundary conditions are imposed using the Simultaneous Approximation Term (SAT) penalty method. The 6-stage additive Runge-Kutta IMEX time integration schemes are fourth-order accurate in time. An increase in numerical stability 65 times greater than the fully explicit scheme is demonstrated to be achievable with the OP IMEX method applied to 1D Burger's equation. Results from the 2D, purely convective, advection equation show stability increases on the order of 10 times the explicit scheme using the OP IMEX method. Also, the domain partitioning method in this work shows potential for breaking the computational domain into manageable sizes such that implicit solutions for full three-dimensional CFD simulations can be computed using direct solving methods rather than the standard iterative methods currently used.

Nielsen, Tanner B.↗