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.

138 records · Page 8
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

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.↗
NASA NTRS1987

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.↗
NASA NTRS1998

Computational Investigation and Validation of Twin-Tail Buffet Response Including Dynamics and Control

Multidisciplinary tools for prediction of single rectangular-tail buffet are extended to single swept-back-tail buffet in transonic-speed flow, and multidisciplinary tools for prediction and control of twin-tail buffet are developed and presented. The configuration model consists of a sharp-edged delta wing with single or twin tails that are oriented normal to the wing surface. The tails are treated as cantilevered beams fixed at the root and allowed to oscillate in both bending and torsion. This complex multidisciplinary problem is solved sequentially using three sets of equations on a dynamic single or multi-block grid structure. The first set is the unsteady, compressible, Reynolds-averaged Navier-Stokes equations which are used for obtaining the flow field vector and the aerodynamic loads on the tails. The Navier-Stokes equations are solved accurately in time using the implicit, upwind, flux-difference splitting, finite volume scheme. The second set is the coupled bending and torsion aeroelastic equations of cantilevered beams which are used for obtaining the bending and torsion deflections of the tails. The aeroelastic equations'are solved accurately in time using, a fifth-order-accurate Runge-Kutta scheme. The third set is the grid-displacement equations and the rigid-body dynamics equations, which are used for updating the grid coordinates due to the tail deflections and rigid-body motions. The tail-buffet phenomenon is predicted for highly-swept, single vertical tail placed at the plane of geometric symmetry, and for highly-swept, vertical twin tails placed at three different spanwise separation distances. The investigation demonstrates the effects of structural inertial coupling and uncoupling of the bending and torsion modes of vibration, spanwise positions of the twin-tail, angle of attack, and pitching and rolling dynamic motions of the configuration model on the tail buffet loading and response. The fundamental issue of twin-tail buffet alleviation is addressed using two active flow-control methods. These methods are the tangential leading-edge blowing and the flow suction from the leading-edge vortex cores along their paths. Qualitative and quantitative comparisons with the available experimental data are presented. The comparisons indicate that the present multidisciplinary aeroelastic analysis tools are robust, accurate and efficient.

Kandil, Osama A.↗
NASA NTRS1985

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.↗
NASA NTRS1991

Effects of leading-edge flap oscillation on unsteady delta wing flow and rock control

The isolated and interdisciplinary problems of unsteady fluid dynamics and rigid-body dynamics and control of delta wings with and without leading-edge flap oscillation are considered. For the fluid dynamics problem, the unsteady, compressible, thin-layer Navier-Stokes (NS) equations, which are written relative to a moving frame of reference, are solved along with the unsteady, linearized, Navier-displacement (ND) equations. The NS equations are solved for the flowfield using an implicit finite-volume scheme. The ND equations are solved for the grid deformation, if the leading-edge flaps oscillate, using an ADI scheme. For the dynamics and control problem, the Euler equation of rigid-body rolling motion for a wing and its flaps are solved interactively with the fluid dynamics equations for the wing-rock motion and subsequently for its control. A four-stage Runge-Kutta scheme is used to explicitly integrate the dynamics equation.

Kandil, Osama A.↗
NASA NTRS1992

Investigation of upwind, multigrid, multiblock numerical schemes for three dimensional flows. Volume 1: Runge-Kutta methods for a thin layer Navier-Stokes solver

A state-of-the-art computer code has been developed that incorporates a modified Runge-Kutta time integration scheme, upwind numerical techniques, multigrid acceleration, and multi-block capabilities (RUMM). A three-dimensional thin-layer formulation of the Navier-Stokes equations is employed. For turbulent flow cases, the Baldwin-Lomax algebraic turbulence model is used. Two different upwind techniques are available: van Leer's flux-vector splitting and Roe's flux-difference splitting. Full approximation multi-grid plus implicit residual and corrector smoothing were implemented to enhance the rate of convergence. Multi-block capabilities were developed to provide geometric flexibility. This feature allows the developed computer code to accommodate any grid topology or grid configuration with multiple topologies. The results shown in this dissertation were chosen to validate the computer code and display its geometric flexibility, which is provided by the multi-block structure.

Cannizzaro, Frank E.↗
NASA NTRS1994

Fourth order difference methods for hyperbolic IBVP's

Fourth order difference approximations of initial-boundary value problems for hyperbolic partial differential equations are considered. We use the method of lines approach with both explicit and compact implicit difference operators in space. The explicit operator satisfies an energy estimate leading to strict stability. For the implicit operator we develop boundary conditions and give a complete proof of strong stability using the Laplace transform technique. We also present numerical experiments for the linear advection equation and Burgers' equation with discontinuities in the solution or in its derivative. The first equation is used for modeling contact discontinuities in fluid dynamics, the second one for modeling shocks and rarefaction waves. The time discretization is done with a third order Runge-Kutta TVD method. For solutions with discontinuities in the solution itself we add a filter based on second order viscosity. In case of the non-linear Burger's equation we use a flux splitting technique that results in an energy estimate for certain different approximations, in which case also an entropy condition is fulfilled. In particular we shall demonstrate that the unsplit conservative form produces a non-physical shock instead of the physically correct rarefaction wave. In the numerical experiments we compare our fourth order methods with a standard second order one and with a third order TVD-method. The results show that the fourth order methods are the only ones that give good results for all the considered test problems.

Gustafsson, Bertil↗
NASA NTRS1993

A multigrid nonoscillatory method for computing high speed flows

A multigrid method using different smoothers has been developed to solve the Euler equations discretized by a nonoscillatory scheme up to fourth order accuracy. The best smoothing property is provided by a five-stage Runge-Kutta technique with optimized coefficients, yet the most efficient smoother is a backward Euler technique in factored and diagonalized form. The singlegrid solution for a hypersonic, viscous conic flow is in excellent agreement with the solution obtained by the third order MUSCL and Roe's method. Mach 8 inviscid flow computations for a complete entry probe have shown that the accuracy is at least as good as the symmetric TVD scheme of Yee and Harten. The implicit multigrid method is four times more efficient than the explicit multigrid technique and 3.5 times faster than the single-grid implicit technique. For a Mach 8.7 inviscid flow over a blunt delta wing at 30 deg incidence, the CPU reduction factor from the three-level multigrid computation is 2.2 on a grid of 37 x 41 x 73 nodes.

Li, C. P.↗
NASA NTRS2016

Overview of the NASA Glenn Flux Reconstruction Based High-Order Unstructured Grid Code

A computational fluid dynamics code based on the flux reconstruction (FR) method is currently being developed at NASA Glenn Research Center to ultimately provide a large- eddy simulation capability that is both accurate and efficient for complex aeropropulsion flows. The FR approach offers a simple and efficient method that is easy to implement and accurate to an arbitrary order on common grid cell geometries. The governing compressible Navier-Stokes equations are discretized in time using various explicit Runge-Kutta schemes, with the default being the 3-stage/3rd-order strong stability preserving scheme. The code is written in modern Fortran (i.e., Fortran 2008) and parallelization is attained through MPI for execution on distributed-memory high-performance computing systems. An h- refinement study of the isentropic Euler vortex problem is able to empirically demonstrate the capability of the FR method to achieve super-accuracy for inviscid flows. Additionally, the code is applied to the Taylor-Green vortex problem, performing numerous implicit large-eddy simulations across a range of grid resolutions and solution orders. The solution found by a pseudo-spectral code is commonly used as a reference solution to this problem, and the FR code is able to reproduce this solution using approximately the same grid resolution. Finally, an examination of the code's performance demonstrates good parallel scaling, as well as an implementation of the FR method with a computational cost/degree- of-freedom/time-step that is essentially independent of the solution order of accuracy for structured geometries.

High-Order Methods↗
NASA NTRS2018

Solution of Ordinary Differential Equations in Gradient-Based Multidisciplinary Design Optimization

A gradient-based approach to multidisciplinary design optimization enables efficient scalability to large numbers of design variables. However, the need for derivatives causes difficulties when integrating ordinary differential equations (ODEs) in models. To simplify this, we propose the use of the general linear methods framework, which unifies all Runge-Kutta and linear multistep methods. This approach enables rapid implementation of integration methods without the need to differentiate each one, even in a gradient-based optimization context. We also develop a new parallel time integration algorithm that enables vectorization across time steps. We present a set of benchmarking results using a stiff ODE, a non-stiff nonlinear ODE, and an orbital dynamics ODE, and compare integration methods. In a modular gradient-based multidisciplinary design optimization context, we find that the new parallel time integration algorithm with high-order implicit methods, especially Gauss-Legendre collocation, is the best choice for a broad range of problems.

Hwang, John T.↗
NASA NTRSDate not supplied

Explicit Discontinuous Galerkin Methods for Conservation Laws

The two explicit DG methods in this study are based on a ‘predictor-corrector’ formulation, the first introduced by Lörcher, Gassner, and Munz (2007, 2008) called space–time expansion discontinuous Galerkin or STE-DG scheme, and the second, introduced independently by the author (Huynh 2006, 2013) called the upwind moment scheme. The predictor step of the two methods is essentially identical using a Cauchy-Kovalevsky (CK) procedure, which involves no interaction of the data among neighboring cells. The corrector step also shares the same space-time integration formulation and is where interaction of the data among neighboring cells takes place; the difference, however, is in how the resulting space-time volume integral is estimated. As a consequence of the different estimates, for the case of advection in one spatial dimension (1D), the moment scheme has a CFL (Courant-Friedrichs-Lewy) condition of 1 for all p and is accurate to order 2p+1, i.e., it possesses the super accuracy property, whereas the STE-DG method has a more restrictive CFL condition and is accurate to the expected order of p+1. For 1D advection, compared with the CFL conditions of 1/(2p+1) of standard RK-DG (Runge-Kutta) scheme where space and time discretization are of the same order, the moment scheme allows a significantly larger time step size. It also turns out that the scheme yields a result identical to Van Leer’s scheme III (1977), which amounts to shifting the data a distance of advection corresponding to the time step and projecting the result onto the space of polynomial solutions. Contrary to Van Leer’s approach, however, the space-time ‘predictor-corrector’ formulation facilitates extensions to the case of systems of equations. Concerning 2D extensions, in the case of advection, when the flow is along the diagonal direction, the CFL conditions for the moment schemes become restrictive as will be shown by Fourier (Von Neumann) stability and accuracy analyses. Since the moment scheme employs the right Radau points as collocation points in time, the method is closely related to the implicit Radau IIA scheme, which is stable for any time step size. The role of Radau IIA in relieving stability restriction for these explicit DG schemes remains to be explored

Discontinuous Galerkin↗
NASA NTRS1988

Compact high order schemes for the Euler equations

An implicit approximate factorization (AF) algorithm is constructed which has the following characteistics. In 2-D: The scheme is unconditionally stable, has a 3 x 3 stencil and at steady state has a fourth order spatial accuracy. The temporal evolution is time accurate either to first or second order through choice of parameter. In 3-D: The scheme has almost the same properties as in 2-D except that it is now only conditionally stable, with the stability condition (the CFL number) being dependent on the cell aspect ratios, delta y/delta x and delta z/delta x. The stencil is still compact and fourth order accuracy at steady state is maintained. Numerical experiments on a 2-D shock-reflection problem show the expected improvement over lower order schemes, not only in accuracy (measured by the L sub 2 error) but also in the dispersion. It is also shown how the same technique is immediately extendable to Runge-Kutta type schemes resulting in improved stability in addition to the enhanced accuracy.

Abarbanel, Saul↗