Search NASA⌕ Search

SEARCH · Search NASA

Results for “ELLIPTIC EQUATION”

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 55 records · Page 3

An experiment in hurricane track prediction using parallel computing methods

The barotropic model is used to explore the advantages of parallel processing in deterministic forecasting. We apply this model to the track forecasting of hurricane Elena (1985). In this particular application, solutions to systems of elliptic equations are the essence of the computational mechanics. One set of equations is associated with the decomposition of the wind into irrotational and nondivergent components - this determines the initial nondivergent state. Another set is associated with recovery of the streamfunction from the forecasted vorticity. We demonstrate that direct parallel methods based on accelerated block cyclic reduction (BCR) significantly reduce the computational time required to solve the elliptic equations germane to this decomposition and forecast problem. A 72-h track prediction was made using incremental time steps of 16 min on a network of 3000 grid points nominally separated by 100 km. The prediction took 30 sec on the 8-processor Alliant FX/8 computer. This was a speed-up of 3.7 when compared to the one-processor version. The 72-h prediction of Elena's track was made as the storm moved toward Florida's west coast. Approximately 200 km west of Tampa Bay, Elena executed a dramatic recurvature that ultimately changed its course toward the northwest. Although the barotropic track forecast was unable to capture the hurricane's tight cycloidal looping maneuver, the subsequent northwesterly movement was accurately forecasted as was the location and timing of landfall near Mobile Bay.

Song, Chang G.↗

Mesh generation by conformal and quasiconformal mappings

It is pointed out that many recent advances in the finite-difference solution of elliptic equations have been limited to regions whose boundary contours coincide with coordinate lines of the Cartesian coordinate system. The reason for this is related to the fact that in the case of an arbitrary curvilinear coordinate system the original equation becomes much more complex. However, there is no added complexity if an orthogonal coordinate system is generated from a conformal mapping. In the present investigation, a finite difference method developed for the construction of conformal mappings has been generalized to construct quasi-conformal mappings. It is expected that the use of more sophisticated numerical algorithms could lead to improvements in both speed and accuracy. Quasi-conformal mappings have applications not only in the solution of elliptic equations but also in other areas such as orthogonal mesh generation on surfaces and the solution of certain fluid flow problems.

Mastin, C. W.↗

A solution of the variational equations for elliptic orbits in rotating coordinates

For elliptic reference orbits, formulas are given for the perturbation state transition matrix of the two-body problem. The formulas relate perturbations expressed in a local vertical rotating coordinate system and are valid for motion in the linear neighborhood of reference orbits with e in the range of 0 to 1. The elements of the state transition matrix are expressed in terms of natural parameters (horizontal and radial velocity, radius, eccentricity, true anomaly, etc.) at the initial and final points. In addition to the general form, a simplified version, valid for small eccentricity orbits, is given.

Jones, J. B.↗

Multigrid method for a vortex breakdown simulation

An inviscid model for a steady axisymmetric flow with swirl was studied. The governing equation is a nonlinear elliptic equation which has more than one solution for a certain range of the swirl parameter. The physically interesting solutions have closed streamlines that look like vortex breakdown (bubble-like solutions). A multigrid method is used to find these solutions. Using an FMG algorithm (nested iteration), the problem is solved in just a few multigrid cycles.

Taasan, S.↗

Full Multigrid Flow Solver

FMG3D (full multigrid 3 dimensions) is a pilot computer program that solves equations of fluid flow using a finite difference representation on a structured grid. Infrastructure exists for three dimensions but the current implementation treats only two dimensions. Written in Fortran 90, FMG3D takes advantage of the recursive subroutine feature, dynamic memory allocation, and structured-programming constructs of that language. FMG3D supports multi-block grids with three types of block-to-block interfaces: periodic, C-zero, and C-infinity. For all three types, grid points must match at interfaces. For periodic and C-infinity types, derivatives of grid metrics must be continuous at interfaces. The available equation sets are as follows: scalar elliptic equations, scalar convection equations, and the pressure-Poisson formulation of the Navier-Stokes equations for an incompressible fluid. All the equation sets are implemented with nonzero forcing functions to enable the use of user-specified solutions to assist in verification and validation. The equations are solved with a full multigrid scheme using a full approximation scheme to converge the solution on each succeeding grid level. Restriction to the next coarser mesh uses direct injection for variables and full weighting for residual quantities; prolongation of the coarse grid correction from the coarse mesh to the fine mesh uses bilinear interpolation; and prolongation of the coarse grid solution uses bicubic interpolation.

Mineck, Raymond E.↗

Numerical Study of Multigrid Methods with Various Smoothers for the Elliptical Grid Generation Equations

A robust solver for the elliptic grid generation equations is sought via a numerical study. The system of PDEs is discretized with finite differences, and multigrid methods are applied to the resulting nonlinear algebraic equations. Multigrid iterations are compared with respect to the robustness and efficiency. Different smoothers are tried to improve the convergence of iterations. The methods are applied to four 2D grid generation problems over a wide range of grid distortions. The results of the study help to select smoothing schemes and the overall multigrid procedures for elliptic grid generation.

Golik, W. L.↗

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

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 problem 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.↗

Relaxation schemes for spectral multigrid methods

The effectiveness of relaxation schemes for solving the systems of algebraic equations which arise from spectral discretizations of elliptic equations is examined. Iterative methods are an attractive alternative to direct methods because Fourier transform techniques enable the discrete matrix-vector products to be computed almost as efficiently as for corresponding but sparse finite difference discretizations. Preconditioning is found to be essential for acceptable rates of convergence. Preconditioners based on second-order finite difference methods are used. A comparison is made of the performance of different relaxation methods on model problems with a variety of conditions specified around the boundary. The investigations show that iterations based on incomplete LU decompositions provide the most efficient methods for solving these algebraic systems.

Phillips, Timothy N.↗

A barely implicit correction for flux-corrected transport

In virtue of adding one elliptic equation that must be implicitly solved, the 'barely implicit correction' method presented removes the stringent sidestep limit imposed by sound speed in the explicit methods. The barely implicit method is presently combined with a flux-corrected transport algorithm, which has been rendered fourth-order by the appropriate subtraction of corrected fluxes, in order to accurately represent the sharp gradients in subsonic flows. The multigrid MGRID technique (DeVore, 1984) is used to efficiently solve the elliptic pressure equation.

Patnaik, G.↗

A viscous flow analysis for the tip vortex generation process

A three dimensional, forward-marching, viscous flow analysis is applied to the tip vortex generation problem. The equations include a streamwise momentum equation, a streamwise vorticity equation, a continuity equation, and a secondary flow stream function equation. The numerical method used combines a consistently split linearized scheme for parabolic equations with a scalar iterative ADI scheme for elliptic equations. The analysis is used to identify the source of the tip vortex generation process, as well as to obtain detailed flow results for a rectangular planform wing immersed in a high Reynolds number free stream at 6 degree incidence.

Shamroth, S. J.↗

A viscous flow analysis of the tip vortex generation process

A viscous primary-secondary flow analysis designed for numerical solution by forward marching integration is applied to the tip vortex generation problem. Equations governing streamwise momentum, streamwise vorticity, and a gas law are solved in conjunction with equations governing scalar and vector surface potentials for the secondary velocities. The numerical method used combines a consistently split linearized block implicit (LBI) scheme for parabolic equations and a scalar iterative ADI scheme for elliptic equations. Computed results are presented for a wing of rectangular planform immersed in a high Reynolds number stream at 6 degrees incidence. The physical mechanism for generation of the tip vortex, as revealed by the analysis and computations, is discussed. Detailed flow results for the case of 6 degree incidence are included.

Shamroth, S. J.↗

On substructuring algorithms and solution techniques for the numerical approximation of partial differential equations

Substructuring methods are in common use in mechanics problems where typically the associated linear systems of algebraic equations are positive definite. Here these methods are extended to problems which lead to nonpositive definite, nonsymmetric matrices. The extension is based on an algorithm which carries out the block Gauss elimination procedure without the need for interchanges even when a pivot matrix is singular. Examples are provided wherein the method is used in connection with finite element solutions of the stationary Stokes equations and the Helmholtz equation, and dual methods for second-order elliptic equations.

Gunzburger, M. D.↗

Textbook Multigrid Efficiency for Leading Edge Stagnation

A multigrid solver is defined as having textbook multigrid efficiency (TME) if the solutions to the governing system of equations are attained in a computational work which is a small (less than 10) multiple of the operation count in evaluating the discrete residuals. TME in solving the incompressible inviscid fluid equations is demonstrated for leading- edge stagnation flows. The contributions of this paper include (1) a special formulation of the boundary conditions near stagnation allowing convergence of the Newton iterations on coarse grids, (2) the boundary relaxation technique to facilitate relaxation and residual restriction near the boundaries, (3) a modified relaxation scheme to prevent initial error amplification, and (4) new general analysis techniques for multigrid solvers. Convergence of algebraic errors below the level of discretization errors is attained by a full multigrid (FMG) solver with one full approximation scheme (F.4S) cycle per grid. Asymptotic convergence rates of the F.4S cycles for the full system of flow equations are very fast, approaching those for scalar elliptic equations.

Diskin, Boris↗

Textbook Multigrid Efficiency for Leading Edge Stagnation

A multigrid solver is defined as having textbook multigrid efficiency (TME) if the solutions to the governing system of equations are attained in a computational work which is a small (less than 10) multiple of the operation count in evaluating the discrete residuals. TME in solving the incompressible inviscid fluid equations is demonstrated for leading-edge stagnation flows. The contributions of this paper include (1) a special formulation of the boundary conditions near stagnation allowing convergence of the Newton iterations on coarse grids, (2) the boundary relaxation technique to facilitate relaxation and residual restriction near the boundaries, (3) a modified relaxation scheme to prevent initial error amplification, and (4) new general analysis techniques for multigrid solvers. Convergence of algebraic errors below the level of discretization errors is attained by a full multigrid (FMG) solver with one full approximation scheme (FAS) cycle per grid. Asymptotic convergence rates of the FAS cycles for the full system of flow equations are very fast, approaching those for scalar elliptic equations.

Diskin, Boris↗

A block space-marching method for the Navier-Stokes equations

A solution procedure is presented for predominantly supersonic viscous flows. The procedure approximately solves the Navier-Stokes equations by marching blocks of grid points in the streamwise direction and solving the fully elliptic equations within each block. In this manner elliptic effects of limited streamwise extent may be accurately calculated. Results are presented for calculations of a Mach 2 laminar flat-plate shock/boundary-layer interaction, and for a Mach 10 hypervelocity interceptor.

Imlay, Scott T.↗

A global multilevel atmospheric model using a vector semi-Lagrangian finite-difference scheme. I - Adiabatic formulation

An adiabatic global multilevel primitive equation model using a two time-level, semi-Lagrangian semi-implicit finite-difference integration scheme is presented. A Lorenz grid is used for vertical discretization and a C grid for the horizontal discretization. The momentum equation is discretized in vector form, thus avoiding problems near the poles. The 3D model equations are reduced by a linear transformation to a set of 2D elliptic equations, whose solution is found by means of an efficient direct solver. The model (with minimal physics) is integrated for 10 days starting from an initialized state derived from real data. A resolution of 16 levels in the vertical is used, with various horizontal resolutions. The model is found to be stable and efficient, and to give realistic output fields. Integrations with time steps of 10 min, 30 min, and 1 h are compared, and the differences are found to be acceptable.

Bates, J. R.↗