Implicit boundary conditions for the solution of the parabolized Navier-Stokes equations for supersonic flows
Previously announced in STAR as N81-32875
SEARCH · Search NASA
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.
Previously announced in STAR as N81-32875
Previously announced in STAR as N81-33870
Previously cited in issue 18, p. 2839, Accession no. A82-37173
In an effort to improve forecast accuracy, the horizontal accuracy of gridpoint forecast models at a number of numerical weather prediction (NWP) centers was increased from second order to fourth order. The current GLAS model uses second-order explicit finite-difference formulas in the vertical and fourth-order explicit finite-difference formulas in the horizontal. Experiments are described which indicate the increased forecast accuracy gained by use of compact fourth-order finite differences in a simple baroclinic model. Tables show an increase in forecast accuracy by a factor of 100-150 by use of fourth-order instead of second-order vertical discretization.
A rapid computation of a sequence of transonic flow solutions has to be performed in many areas of aerodynamic technology. The employment of low-cost vector array processors makes the conduction of such calculations economically feasible. However, for a full utilization of the new hardware, the developed algorithms must take advantage of the special characteristics of the vector array processor. The present investigation has the objective to develop an efficient algorithm for solving transonic flow problems governed by mixed partial differential equations on an array processor.
Explore the source record for details and available documents.
Previously cited in issue 5, p. 582, Accession no. A83-16593
Previously cited in issue 5, p. 579, Accession no. A83-16536
Numerical results show that, for large time steps, the factorization error can be significant, even for the slowly propagating Rossby modes. A new scheme is formulated based on a more accurate factorization of the equations. By grouping separately the terms of the equations which give rise to the fast and slow motion, the equations are factored more accurately. The fast-slow factorization eliminated the factorization error. If each of the fast and slow factors are factored again according to spatial components, the resulting scheme only involves the solution of one dimensional linear systems, and computational efficient. It is shown that the factorization error for the slow made component is negligible for this new scheme.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Two hybrid upwind models are defined for solving the Euler equations. The algorithms both employ approximate factorization (AF) in crossplane and symmetric block Gauss-Seidel relaxation in the third direction. One approach adds an additional factorization step to lower the number of required grid point operations for inversion of the block tridiagonal matrices; however, the move permits only one third of the operations to be vectorized. Finite difference solutions are calculated on a C-H-type grid, in this case enveloping a slender, sharp-edged delta wing. Sample data are provided for the calculated vortex flow for Re of 10,000, at a 20.5 deg angle of attack, represented in a crossflow velocity vector plot and in a spanwise pressure coefficient distribution. The AF scheme, without additional factorization, when used with a grid covering 51 x 51 x 72 points provides a convergent solution with no time step lasting longer than 0.00001 sec.