SEARCH · Search NASA

Results for “Accelerated convergence”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

All sources NASA NTRS DOE OSTI

NASA NTRS1982

A vectorized, finite-volume, adaptive grid algorithm applied to planetary entry problems

An adaptive grid, finite-volume method has been applied to problems in planetary entry for computing complete flowfields. The adaption algorithm is implicit in nature and is keyed to resolve user specified gradients. The finite-volume algorithm is explicit, utilizing a maximum time step advancement at each grid point to accelerate convergence to the steady state. The present version of the code is for the laminar flow of a perfect gas. The role of the adaption algorithm in resolving various features of blunt body/wake flow for planetary entry conditions is emphasized.

Gnoffo, P. A.↗

NASA NTRS1982

A vectorized, finite-volume, adaptive-grid algorithm for Navier-Stokes calculations

An adaptive grid, finite-volume method has been used to solve the Navier-Stokes equations for complete (forebody and afterbody) flowfields around blunt bodies. The code, which is applicable for axisymmetric or two-dimensional flows, allows the mesh to adjust during the computation to provide a closer spacing of mesh points in regions of high gradients, thus minimizing the number of required computational points. The solution technique is explicit, utilizing a maximum time-step advancement at each grid point to accelerate convergence to the steady state. The code has been fully vectorized for efficient solution on the CYBER 203 computer. A very flexible rezoning routine is used to concentrate mesh points anywhere in the field, either by a user-defined weighting function or by allowing high gradient regions to adjust the grid. The grid adjustment routine is implicit in nature and represents a very small portion of the total computational cost. Currently, the code runs in approximately 0.000016 seconds per grid point per iteration.

Gnoffo, P. A.↗

NASA NTRS1983

A multi-grid method for the computation of viscid/inviscid interactions on airfoils

An improved version of the 'GRUMFOIL' code has been developed for the computation of airfoil flows. The method employs a conservative difference scheme for the potential equation, integral methods for the boundary layer, and viscous coupling conditions that fully account for the wake and strong interaction effects at trailing edges. The improved version uses Jameson's 'MAD' scheme to accelerate convergence of the inviscid solution, an improved 2nd order artificial viscosity and far field 'TARE' correction to reduce spatial truncation errors and Carter's semi-inverse method for the viscous solution. Results are presented which demonstrate a factor of ten reduction in computing cost.

Melnik, R. E.↗

NASA NTRS1983

An enhanced version of an implicit code for the Euler equations

A two-dimensional implicit finite-difference code is applied to the inviscid Euler equations to compute transonic flow past airfoils in order to provide well-documented standard test cases for the general user community. The code is an improved version of Steger's 1976 implicit code. Enhancements include the use of up-wind differencing in supersonic regions before shocks and a variable time step to accelerate convergence. An airfoil grid generation routine based on algebraic techniques is employed. The grids are clustered near shocks to improve resolution. Computed results are compared with other numerical results from the literature.

Pulliam, T. H.↗

NASA NTRS1983

Multiple-gridding of the Euler equations with an implicit scheme

The multiple-grid scheme of Ni (1981) for the solution of the unsteady Euler equations for quasi-one-dimensional transonic flow problems is analyzed according to its ability to accelerate convergence to a steady state solution, its applicability to an implicit scheme, its accuracy, and its stability limits. This scheme is applied successfully to McCormack's (1981) implicit method of solving quasi-one-dimensional transonic flow problems for CFL numbers significantly greater than unity. It is determined that the second order accuracy of this implicit method is preserved by employing the multiple gridding. However, stability limitations that are flow dependent are introduced into the implicit method by the use of the multiple-grid scheme which will curtail its use under certain flow conditions. A scaling modification for the multiple grid scheme is developed which further improves its performance when used with explicit and artificially-damped implicit methods without any increase in computational work.

Stubbs, R. M.↗

NASA NTRS1983

Numerical computation of transonic flow governed by the full-potential equation

Basic concepts associated with the numerical solution of elliptic partial differential equations are introduced, and procedures used to solve the full potential equation for transonic flow fields are discussed. Governing equations, classical relaxation schemes and concepts regarding transonic, full potential equation algorithms are covered. The equation transformation and grid generation procedures; full potential spatial differencing schemes; full potential iteration schemes, emphasizing convergence acceleration; and three dimensional applications are presented.

Holst, T. L.↗

NASA NTRS1983

Three-dimensional unsteady Euler equation solutions using flux vector splitting

A method for numerically solving the three dimensional unsteady Euler equations using flux vector splitting is developed. The equations are cast in curvilinear coordinates and a finite volume discretization is used. An explicit upwind second-order predictor-corrector scheme is used to solve the discretized equations. The scheme is stable for a CFL number of two and local time stepping is used to accelerate convergence for steady-state problems. Characteristic variable boundary conditions are developed and used in the far field and at surfaces. No additional dissipation terms are included in the scheme. Numerical results are compared with results from an existing three dimensional Euler code and experimental data.

Whitfield, D. L.↗

NASA NTRS1984

Comparison of the full potential and Euler formulations for computing transonic airfoil flows

A quantitative comparison between the Euler and full potential formulations with respect to speed and accuracy is presented. The robustness of the codes used is tested by a number of transonic airfoil cases. The computed results are from four transonic airfoil computer codes. The full potential codes use fully implicit iteration algorithms. The first Euler code uses a fully implicit ADI iteration scheme. The second Euler code uses an explicit Runge Kutta time stepping algorithm which is enhanced by a multigrid convergence acceleration scheme. Quantitative comparisons are made using various plots of lift coefficient versus the average mesh spacing along the airfoil. Besides yielding an asymptotic limit to the lift coefficient, these results also demonstrate the truncation error behavior of the various codes. Quantitative conclusions regarding the full potential and Euler formulations with respect to accuracy, speed, and robustness can be presented.

Flores, J.↗

NASA NTRS1984

An implicit form for the Osher upwind scheme

Conservative upwind schemes for the Euler equations, such as the Osher scheme, accurately resolve flow discontinuities and correctly model the physics of the problem. However, these schemes require many more arithmetic operations per integration step than simple central-difference schemes and hence result in large computing times. An implicit version of the first-order- and second-order-accurate Osher schemes in two spatial dimensions and generalized coordinates is developed in this study. Because implicit schemes permit the use of large integration steps, in many cases they require fewer integration steps to reach steady-state (especially in calculations on grids with widely varying mesh-cell sizes). The implicit scheme developed in this study accelerated convergence speeds by almost an order of magnitude in the problems considered. Test cases include quasi-one-dimensional nozzle flow and supersonic flow past a cylinder.

Rai, M. M.↗

NASA NTRS1984

Calculation of quasi-one-dimensional flows with shocks

The two-point subsonic method of Wornom (1983) is modified to permit calculation of transonic flows with shocks using artificial density and/or artificial pressure. This method, which requires no numerical boundary conditions, is then used to calculate transonic flow for large and small CFL (Courant-Friedrichs-Lewy) numbers. Convergence acceleration is achieved for small CFL numbers by using multi-grid.

Wornom, S. F.↗

NASA NTRS1982

Relaxation solution of the full Euler equations

A numerical procedure for the relaxation solution of the full steady Euler equations is described. By embedding the Euler system in a second order surrogate system, central differencing may be used in subsonic regions while retaining matrix forms well suited to iterative solution procedures and convergence acceleration techniques. Hence, this method allows the development of stable, fully conservative differencing schemes for the solution of quite general inviscid flow problems. Results are presented for both subcritical and shocked supercritical internal flows. Comparisons are made with a standard time dependent solution algorithm. Previously announced in STAR as N82-24859

Johnson, G. M.↗

NASA NTRS1984

Three-dimensional unsteady Euler equations solution using flux vector splitting

A method for numerically solving the three-dimensional unsteady Euler equations using flux vector splitting is developed. The equations are cast in curvilinear coordinates and a finite volume discretization is used. An explicit upwind second-order predictor-corrector scheme is used to solve the discretized equations. The scheme is stable for a CFL number of 2 and local time stepping is used to accelerate convergence for steady-state problems. Characteristic variable boundary conditions are developed and used in the far-field and at surfaces. No additional dissipation terms are included in the scheme. Numerical results are compared with results from an existing three-dimensional Euler code and experimental data.

Whitfield, D. L.↗

NASA NTRS1985

A multistage time-stepping scheme for the Navier-Stokes equations

A class of explicit multistage time-stepping schemes is used to construct an algorithm for solving the compressible Navier-Stokes equations. Flexibility in treating arbitrary geometries is obtained with a finite-volume formulation. Numerical efficiency is achieved by employing techniques for accelerating convergence to steady state. Computer processing is enhanced through vectorization of the algorithm. The scheme is evaluated by solving laminar and turbulent flows over a flat plate and an NACA 0012 airfoil. Numerical results are compared with theoretical solutions or other numerical solutions and/or experimental data.

Swanson, R. C.↗

NASA NTRS1985

A multistage time-stepping scheme for the Navier-Stokes equations

Swanson, R. C.↗

NASA NTRS1985

Numerical solution of the Euler equations for high-speed, blended wing-body configurations

Simulation of high-speed three-dimensional flow about blended wing-body combinations is investigated. A finite-volume explicit scheme with Runge-Kutta time integration is used to solve the compressible Euler equations in order to simulate the flow. The method, augmented by carefully chosen dissipative terms and convergence accelerators such as enthalpy damping and maximum local time-stepping, has been found to be very efficient in solving high-speed flows involving strong shocks. An analytic method for generating the body geometry and an algebraic method for quasi-three-dimensional grid generation are described. Results are presented for various blended wing-body configurations at different Mach numbers and angles of attack.

Moitra, A.↗

NASA NTRS1987

Applications of Wynn's epsilon-algorithm to transonic flow-calculations

Convergence acceleration of iterative solutions of potential and Euler equations, based on Wynn's epsilon-algorithm, is demonstrated. The extra computational work, to apply the technique, is negligible, while the storage requirement is definitely affordable with the present computers, at least, for two-dimensional inviscid flow problems.

Hafez, M.↗

NASA NTRS1987

A combined Eulerian-Lagrangian analysis for computation of two-phase flows

A combined Eulerian-Lagrangian analysis, which combines a linearized block implicit Navier-Stokes analysis for the continuous phase with a Lagrangian analysis for the motion of the droplet phase to simulate evaporating two-phase flows, has been developed. A unique aspect of this analysis is that the Lagrangian equations for the droplet motion have been transformed into the Eulerian computational space using coordinate transformation resulting in better computational efficiency. Use of the present implicit procedure for the continuous phase makes it possible to efficiently use a locally highly refined mesh. The coupling of the continuous phase and the droplet phase analyses is such that it allows the use of convergence acceleration techniques for steady-state problems, as well as making it possible to simulate transient flows. A rapidly evaporating two-phase flow caused by spray of liquid nitrogen in gaseous nitrogen has been used as a test problem to demonstrate the computer code using this analysis.

Sabnis, J. S.↗

NASA NTRS1987

Extrapolation methods for vector sequences

This paper derives, describes, and compares five extrapolation methods for accelerating convergence of vector sequences or transforming divergent vector sequences to convergent ones. These methods are the scalar epsilon algorithm (SEA), vector epsilon algorithm (VEA), topological epsilon algorithm (TEA), minimal polynomial extrapolation (MPE), and reduced rank extrapolation (RRE). MPE and RRE are first derived and proven to give the exact solution for the right 'essential degree' k. Then, Brezinski's (1975) generalization of the Shanks-Schmidt transform is presented; the generalized form leads from systems of equations to TEA. The necessary connections are then made with SEA and VEA. The algorithms are extended to the nonlinear case by cycling, the error analysis for MPE and VEA is sketched, and the theoretical support for quadratic convergence is discussed. Strategies for practical implementation of the methods are considered.

Smith, David A.↗