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.
An existence result was obtained for a nonlinear second-order equation in an exterior domain of IR(3). The proof relies on a variational formulation in weighted Sobolev spaces.
Elliptic partial differential equations are used to generate a smooth grid that permits a one-to-one mapping in such a way that mesh lines of the same family do not cross. Problems that arise due to lack of clustering at crucial points or intersections of mesh lines at highly acute angles, are examined and various forcing or source terms are used (to correct the problems) that are either compatible with the maximum principle or are so locally controlled that mesh lines do not intersect. Attention is given to various schematics of unclustered grids and grid detail about (highly cambered) airfoils.
Reflection laws of systems of elliptic equations, on-line programming to numerically solve nonlinear integral equations, and reduction of electrostriction problem
The equations of magnetohydrostatic equilibria for a plasma in a gravitational field are investigated analytically. For equilibria with one ignorable spatial coordinate, the equations reduce to a single nonlinear elliptic equation for the magnetic potential. Similarity solutions of the elliptic equation are obtained for the case of an isothermal atmosphere in a uniform gravitational field. The solutions are obtained from a consideration of the invariance group of the elliptic equation. The importance of symmetries of the elliptic equation also appears in the determination of conservation laws. It turns out that the elliptic equation can be written as a variational principle, and the symmetries of the variational functional lead (via Noether's theorem) to conservation laws for the equation. As an example of the application of the similarity solutions, a model magnetostatic atmosphere is constructed in which the current density J is proportional to the cube of the magnetic potential, and falls off exponentially with distance vertical to the base, with an 'e-folding' distance equal to the gravitational scale height. The solutions show the interplay between the gravitational force, the J x B force (B, magnetic field induction) and the gas pressure gradient.
Algorithm and subroutine for solving Kepler equation for elliptical orbits
Second order elliptic differential equation system solution reflection behavior, noting constant coefficients and boundary conditions
Reflection laws of high order elliptic differential equations in two independent variables with constant coefficients and unequal characteristics across analytic boundary conditions
A multilevel algorithm is presented that solves general second order elliptic partial differential equations on adaptive sparse grids. The multilevel algorithm consists of several V-cycles. Suitable discretizations provide that the discrete equation system can be solved in an efficient way. Numerical experiments show a convergence rate of order Omicron(1) for the multilevel algorithm.
Consideration is given specifically to sixth order elliptic partial differential equations in two independent real variables x, y such that the coefficients of the highest order terms are real constants. It is assumed that the differential operator has distinct characteristics and that it can be factored as a product of second order operators. By analytically continuing into the complex domain and using the complex characteristic coordinates of the differential equation, it is shown that its solutions, u, may be reflected across analytic arcs on which u satisfies certain analytic boundary conditions. Moreover, a method is given whereby one can determine a region into which the solution is extensible. It is seen that this region of reflection is dependent on the original domain of difinition of the solution, the arc and the coefficients of the highest order terms of the equation and not on any sufficiently small quantities; i.e., the reflection is global in nature. The method employed may be applied to similar differential equations of order 2n.
Downstream marching iterative schemes for the solution of the Parabolized or Thin Layer (PNS or TL) Navier-Stokes equations are described. Modifications of the primitive equation global relaxation sweep procedure result in efficient second-order marching schemes. These schemes take full account of the reduced order of the approximate equations as they behave like the SLOR for a single elliptic equation. The improved smoothing properties permit the introduction of Multi-Grid acceleration. The proposed algorithm is essentially Reynolds number independent and therefore can be applied to the solution of the subsonic Euler equations. The convergence rates are similar to those obtained by the Multi-Grid solution of a single elliptic equation; the storage is also comparable as only the pressure has to be stored on all levels. Extensions to three-dimensional and compressible subsonic flows are discussed. Numerical results are presented.
Downstream marching iterative schemes for the solution of the Parabolized or Thin Layer (PNS or TL) Navier-Stokes equations are described. Modifications of the primitive equation global relaxation sweep procedure result in efficient second-order marching schemes. These schemes take full account of the reduced order of the approximate equations as they behave like the SLOR for a single elliptic equation. The improved smoothing properties permit the introduction of Multi-Grid acceleration. The proposed algorithm is essentially Reynolds number independent and therefore can be applied to the solution of the subsonic Euler equations. The convergence rates are similar to those obtained by the Multi-Grid solution of a single elliptic equation; the storage is also comparable as only the pressure has to be stored on all levels. Extensions to three-dimensional and compressible subsonic flows are discussed. Numerical results are presented.
Higher-order operators for marching methods for elliptic equations are considered. Higher-order is understood in the sense of higher-order accuracy solutions to second-order Poisson equations, and in the sense of higher-order elliptic equations such as the biharmonic equation. The use of deferred corrections for overcoming stability problems is illustrated. Direct and iterative methods of extending the mesh size are considered. Multiple marching, patching, and influence extending techniques are described.
An efficient algorithm is presented for the solution of Kepler's equation f(E)=E-M-e sin E=0, where e is the eccentricity, M the mean anomaly and E the eccentric anomaly. This algorithm is based on simple initial approximations that are cubics in M, and an iterative scheme that is a slight generalization of the Newton-Raphson method. Extensive testing of this algorithm has been performed on the UNIVAC 1108 computer. Solutions for 20,000 pairs of values of e and M show that for single precision, 42.0% of the cases require one iteration, 57.8% two and 0.2% three. For double precision one additional iteration is required.
Several aspects of multigrid methods are briefly described. The main subjects include the development of very efficient multigrid algorithms for systems of elliptic equations (Cauchy-Riemann, Stokes, Navier-Stokes), as well as the development of control and prediction tools (based on local mode Fourier analysis), used to analyze, check and improve these algorithms. Preliminary research on multigrid algorithms for time dependent parabolic equations is also described. Improvements in existing multigrid processes and algorithms for elliptic equations were studied.
A direct three-dimensional elliptic solver is presented for application in a wide class of numerical methods for solving partial differential equations in physics and engineering. The derived algorithm and FORTRAN code implement Buzbee, Golub and Nielson's proposed extension of Buneman's Cyclic-Reduction Poisson solver to three dimensions. Both a 'most direct' cyclic reduction and a revised method (to eliminate roundoff error difficulties) are derived. Tests on an IBM 360/67 computer, using various optional combinations of subroutines, showed significant differences in accuracy and computing time, with the optimum subroutine combination depending on mesh size.
Parameter and domain dependence of eigenvalues of elliptic partial differential equations
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.
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.