Search NASA⌕ Search

SEARCH · Search NASA

Results for “Convergence rate”

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

WIND: Computer program for calculation of three dimensional potential compressible flow about wind turbine rotor blades

A computer program is presented which numerically solves an exact, full potential equation (FPE) for three dimensional, steady, inviscid flow through an isolated wind turbine rotor. The program automatically generates a three dimensional, boundary conforming grid and iteratively solves the FPE while fully accounting for both the rotating cascade and Coriolis effects. The numerical techniques incorporated involve rotated, type dependent finite differencing, a finite volume method, artificial viscosity in conservative form, and a successive line overrelaxation combined with the sequential grid refinement procedure to accelerate the iterative convergence rate. Consequently, the WIND program is capable of accurately analyzing incompressible and compressible flows, including those that are locally transonic and terminated by weak shocks. The program can also be used to analyze the flow around isolated aircraft propellers and helicopter rotors in hover as long as the total relative Mach number of the oncoming flow is subsonic.

Dulikravich, D. S.↗

Numerical Boundary Condition Procedures

Topics include numerical procedures for treating inflow and outflow boundaries, steady and unsteady discontinuous surfaces, far field boundaries, and multiblock grids. In addition, the effects of numerical boundary approximations on stability, accuracy, and convergence rate of the numerical solution are discussed.

Source record↗

Accelerated convergence of structured banded systems using constrained corrections

An efficient iterative method for solving a structured banded system of equations is described. The method was developed for a full potential flow program and uses a basic interation step, a dynamic relation step, and a multigrid concept of constraining iterative corrections. The solution of a large linear system of equations is examined. Efficient iterative methods have become attractive for large problems. In the nonlinear cases, these iterations may be effectively merged to improve convergence rates.

Kneile, K.↗

Implicit calculations of transonic flows using monotone methods

Implicit approximate-factorization algorithms have been developed that use monotone methods for the calculation of steady and unsteady transonic flows governed by the small-disturbance-potential equation. These algorithms use the new Engquist-Osher switch in the type-dependent differencing in place of the standard Murman-Cole switch. The resulting algorithms are more stable; hence, calculations can be done more efficiently. For steady flows, the convergence rate is about 35% faster, and for unsteady flows the allowable time step is about 10 times larger. These improvements are achieved with no increase in computer storage and with only minor modifications in codes that use the Murman-Cole switch. Also an implicit algorithm has been developed for the steady full-potential equation in one-dimension, which uses monotone methods.

Goorjian, P. M.↗

An implicit algorithm for the transonic full-potential equation in conservative form

A fast, implicit approximate factorization algorithm for the solution of the conservative full-potential equation for transonic flow in two and three dimensions is presented. Stability in supersonic regions is maintained by the use of an upwind evaluation of the density coefficient along all coordinate directions, providing an effective upwind difference of the streamwise terms for any orientation of the velocity vector and thereby enhancing the reliability of the algorithm. The algorithm is shown to provide rapid convergence for the computation of certain difficult two-dimensional test cases, including cases with fishtail shock patterns, demonstrating the reliability and efficiency of the procedure. Surface pressure coefficient distributions obtained by the present method are also found to be in good agreement with those computed by successive-line overrelaxation and a hybrid direct-solver/successive-line overrelaxation scheme, with significant reductions in CPU time required. A three-dimensional solution for a swept wing mounted between parallel walls is also presented which demonstrates the high convergence rate of the algorithm in three dimensions as well as two.

Holst, T.↗

The earthquake cycle in subduction zones

A simplified model of a subduction zone is presented, which incorporates the mechanical asymmetry induced by the subducted slab to anchor the subducting plate during post-seismic rebound and thus throw most of the coseismic stream release into the overthrust plate. The model predicts that the trench moves with respect to the deep mantle toward the subducting plate at a velocity equal to one-half of the convergence rate. A strong extensional pulse is propagated into the overthrust plate shortly after the earthquake, and although this extension changes into compression before the next earthquake in the cycle, the period of strong extension following the earthquake may be responsible for extensional tectonic features in the back-arc region.

Melosh, H. J.↗

Multiple-grid convergence acceleration of viscous and inviscid flow computations

A multiple-grid algorithm for use in efficiently obtaining steady solution to the Euler and Navier-Stokes equations is presented. The convergence of a simple, explicit fine-grid solution procedure is accelerated on a sequence of successively coarser grids by a coarse-grid information propagation method which rapidly eliminates transients from the computational domain. This use of multiple-gridding to increase the convergence rate results in substantially reduced work requirements for the numerical solution of a wide range of flow problems. Computational results are presented for subsonic and transonic inviscid flows and for laminar and turbulent, attached and separated, subsonic viscous flows. Work reduction factors as large as eight, in comparison to the basic fine-grid algorithm, were obtained. Possibilities for further performance improvement are discussed.

Johnson, G. M.↗

Implicit Total Variation Diminishing (TVD) schemes for steady-state calculations

The application of a new implicit unconditionally stable high resolution total variation diminishing (TVD) scheme to steady state calculations. It is a member of a one parameter family of explicit and implicit second order accurate schemes developed by Harten for the computation of weak solutions of hyperbolic conservation laws. This scheme is guaranteed not to generate spurious oscillations for a nonlinear scalar equation and a constant coefficient system. Numerical experiments show that this scheme not only has a rapid convergence rate, but also generates a highly resolved approximation to the steady state solution. A detailed implementation of the implicit scheme for the one and two dimensional compressible inviscid equations of gas dynamics is presented. Some numerical computations of one and two dimensional fluid flows containing shocks demonstrate the efficiency and accuracy of this new scheme.

Yee, H. C.↗

Preconditioners for the spectral multigrid method

The systems of algebraic equations which arise from spectral discretizations of elliptic equations are full and direct solutions of them are rarely feasible. Iterative methods are an attractive alternative because Fourier transform techniques enable the discrete matrix-vector products to be computed with nearly the same efficiency as is possible for corresponding but sparse finite difference discretizations. For realistic Dirichlet problems preconditioning is essential for acceptable convergence rates. A brief description of Chebyshev spectral approximations and spectral multigrid methods for elliptic problems is given. A survey of preconditioners for Dirichlet problems based on second-order finite difference methods is made. New preconditioning techniques based on higher order finite differences and on the spectral matrix itself are presented. The preconditioners are analyzed in terms of their spectra and numerical examples are presented.

Phillips, T. N.↗

Semidirect computations for transonic flow

A semidirect method, driven by a Poisson solver, was developed for inviscid transonic flow computations. It is an extension of a recently introduced algorithm for solving subsonic rotational flows. Shocks are captured by implementing a form of artificial compressibility. Nonisentropic cases are computed using a shock tracking procedure coupled with the Rankine-Hugoniot relationships. Results are presented for both subsonic and transonic flows. For the test geometry, an unstaggered cascade of 20 percent thick circular arc airfoils at zero angle of attack, shocks are crisply resolved in supercritical situations and the algorithm converges rapidly. In addition, the convergence rate appears to be nearly independent of the entropy and vorticity production at the shock.

Swisshelm, J. M.↗

New implicit boundary procedures - Theory and applications

Analytical techniques for the application of implicit boundary conditions for inviscid flows to shock and body boundary layer conditions involving the Euler equations are presented. The theory of characteristics is used to update boundary points with spatial second order accuracy. The method is useful for implicit schemes which feature approximate factorization, and as such is incorporated into an existing PNS code. Examples are provided in terms of flows over a cone, over a maneuverable reentry vehicle, and over a finned vehicle. Improvements in the convergence rate are demonstrated for the conical flow solutions.

Rai, M. M.↗

A multigrid method for the Euler equations

A multigrid algorithm has been developed for the numerical solution of the steady two-dimensional Euler equations. Flux vector splitting and one-sided differencing are employed to define the spatial discretization. Newton's method is used to solve the nonlinear equations, and a multigrid solver is used on each linear problem. The relaxation scheme for the linear problems is symmetric Gauss-Seidel. Standard restriction and interpolation operators are employed. Local mode analysis is used to predict the convergence rate of the multigrid process on the linear problems. Computed results for transonic flows over airfoils are presented.

Jespersen, D. C.↗

Implicit total variation diminishing (TVD) schemes for steady-state calculations

The application of a new implicit unconditionally stable high resolution total variation diminishing (TVD) scheme to steady state calculations. It is a member of a one parameter family of explicit and implicit second order accurate schemes developed by Harten for the computation of weak solutions of hyperbolic conservation laws. This scheme is guaranteed not to generate spurious oscillations for a nonlinear scalar equation and a constant coefficient system. Numerical experiments show that this scheme not only has a rapid convergence rate, but also generates a highly resolved approximation to the steady state solution. A detailed implementation of the implicit scheme for the one and two dimensional compressible inviscid equations of gas dynamics is presented. Some numerical computations of one and two dimensional fluid flows containing shocks demonstrate the efficiency and accuracy of this new scheme. Previously announced in STAR as N83-23085

Yee, H. C.↗

A method for solving the transonic full-potential equation for general configurations

A method is developed for solving the full-potential equation for two-dimensional and axisymmetric flow which retains the grid and boundary condition simplicity of the transonic small-disturbance codes. The method is based on a finite-volume formulation of the mass conservation equation in a Cartesian coordinate system, and is an extension of the method of Purvis and Burkhalter (1979). This finite-volume approach, combined with the simple boundary treatment, is shown to result in a highly robust method applicable to a wide range of geometries and flow conditions. The accuracy of the method is demonstrated for general geometries in two-dimensional and axisymmetric flows. The use of this method results in significant gains in convergence rate over the vertical-line over-relaxation scheme by incorporating an AF2-type algorithm (Ballhaus et al., 1978). It is suggested that the simplicity of this method shold allow a relatively easy extension to complex geometries in three-dimensional flows, and complex two-dimensional configurations such as multielement airfoils should be amenable to this method.

Wedan, B.↗

Effects of photon noise on speckle image reconstruction with the Knox-Thompson algorithm

An analysis of the effects of photon noise on astronomical speckle image reconstruction using the Knox-Thompson algorithm is presented. It is shown that the quantities resulting from the speckle average arre biased, but that the biases are easily estimated and compensated. Calculations are also made of the convergence rate for the speckle average as a function of the source brightness. An illustration of the effects of photon noise on the image recovery process is included.

Nisenson, P.↗

Modification to shock fitting program

A modified form of the Lepping - Argentiero single spacecraft, shock normal determination procedure is presented. The modified method incorporates a simple predictor-corrector algorithm which allows a faster convergence rate and the use of average values of the parameters for the starting vector.

Acuna, M. H.↗

Vectorized schemes for conical potential flow using the artificial density method

A method is developed to determine solutions to the full-potential equation for steady supersonic conical flow using the artificial density method. Various update schemes used generally for transonic potential solutions are investigated. The schemes are compared for speed and robustness. All versions of the computer code have been vectorized and are currently running on the CYBER-203 computer. The update schemes are vectorized, where possible, either fully (explicit schemes) or partially (implicit schemes). Since each version of the code differs only by the update scheme and elements other than the update scheme are completely vectorizable, comparisons of computational effort and convergence rate among schemes are a measure of the specific scheme's performance. Results are presented for circular and elliptical cones at angle of attack for subcritical and supercritical crossflows.

Bradley, P. F.↗