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 109 records · Page 6

Quasiconformal mappings and grid generation

A finite difference scheme is developed for constructing quasiconformal mappings for arbitrary simply and doubly connected regions. Computational grids are generated to reduce elliptic equations to canonical form. Examples of conformal mappings on surfaces are also included.

Mastin, C. W.↗

Transformation of two and three-dimensional regions by elliptic systems

The research during this period continued to expand the class of numerical algorithms that can be accurately and efficiently implemented on overlapping grids. Whereas previous calculations have been used to solve elliptic equations and to find the steady-state solution of parabolic equations, the present work is aimed towards developing time-accurate solution techniques for parabolic and hyperbolic equations. The primary difficulty here is in the correct treatment of the interior boundary nodes that must be updated at each iteration. The implementation of explicit methods is straightforward. However, the common practice of lagging these values when using an implicit methods leads to inconsistencies in the difference equation. One way to avoid this problem is to alternately calculate with an implicit and an explicit method on each subgrid. With this procedure, the explicit method generates boundary values at the next time level which are then used by the implicit step. It can be shown that when a backward implicit method is combined with a forward explicit method, the composite method is second order accurate and unconditionally stable for linear problems. A second area in which progress can be reported is in the distribution of grid points on curves and surfaces.

Mastin, E. W.↗

A function space approach to state and model error estimation for elliptic systems

An approach is advanced for the concurrent estimation of the state and of the model errors of a system described by elliptic equations. The estimates are obtained by a deterministic least-squares approach that seeks to minimize a quadratic functional of the model errors, or equivalently, to find the vector of smallest norm subject to linear constraints in a suitably defined function space. The minimum norm solution can be obtained by solving either a Fredholm integral equation of the second kind for the case with continuously distributed data or a related matrix equation for the problem with discretely located measurements. Solution of either one of these equations is obtained in a batch-processing mode in which all of the data is processed simultaneously or, in certain restricted geometries, in a spatially scanning mode in which the data is processed recursively. After the methods for computation of the optimal esimates are developed, an analysis of the second-order statistics of the estimates and of the corresponding estimation error is conducted. Based on this analysis, explicit expressions for the mean-square estimation error associated with both the state and model error estimates are then developed. While this paper focuses on theoretical developments, applications arising in the area of large structure static shape determination are contained in a closely related paper (Rodriguez and Scheid, 1982).

Rodriguez, G.↗

Multigrid solutions to quasi-elliptic schemes

Quasi-elliptic schemes arise from central differencing or finite element discretization of elliptic systems with odd order derivatives on non-staggered grids. They are somewhat unstable and less accurate then corresponding staggered-grid schemes. When usual multigrid solvers are applied to them, the asymptotic algebraic convergence is necessarily slow. Nevertheless, it is shown by mode analyses and numerical experiments that the usual FMG algorithm is very efficient in solving quasi-elliptic equations to the level of truncation errors. Also, a new type of multigrid algorithm is presented, mode analyzed and tested, for which even the asymptotic algebraic convergence is fast. The essence of that algorithm is applicable to other kinds of problems, including highly indefinite ones.

Brandt, A.↗

Multigrid solutions to quasi-elliptic schemes

Quasi-elliptic schemes arise from central differencing or finite element discretization of elliptic systems with odd order derivatives on non-staggered grids. They are somewhat unstable and less accurate than corresponding staggered-grid schemes. When usual multigrid solvers are applied to them, the asymptotic algebraic convergence is necessarily slow. Nevertheless, it is shown by mode analyses and numerical experiments that the usual FMG algorithm is very efficient in solving quasi-elliptic equations to the level of truncation errors. Also, a new type of multigrid algorithm is presented, mode analyzed and tested, for which even the asymptotic algebraic convergence is fast. The essence of that algorithm is applicable to other kinds of problems, including highly indefinite ones.

Brandt, A.↗

A method of calculating the total flow from a given sea surface topography

Using a simple dynamical model of a wind-driven ocean circulation of the Stommel type, and an analytical basis developed to objectively analyze the sea surface height residuals from an altimeter and, in the process, to determine the total flow instead of just the near surface geostrophic component associated with the given sea surface topography. The method is based on first deriving the solution to the forced problem for a given wind stress required to develop a hypothetical true or perfect data field and to establishing the basis for the objective analysis. The stream function and the surface height field for the forced problem are developed in terms of certain characteristic functions with the same expansion coefficients for both fields. These characteristic functions are simply the solutions for a homogeneous elliptic equation for the stream function and the solutions of an inhomogeneous balance equation for the height field. For the objective analysis, using a sample of randomly selected height values from the true data field, the height field characteristic functions are used to fit the given topography in a least squares sense. The resulting expansion coefficients then permit the synthesis of the total flow field via the stream function characteristic modes and the solution is perfectly well behaved even along the equator. The method of solution is easily adaptable to realistic ocean basis by straight forward numerical methods. The analytical basis of the theory and the results for an ideal rectangular basin on a beta plane are described.

Rao, Desiraju B.↗

The use of multigrid techniques in the solution of the Elrod algorithm for a dynamically loaded journal bearing

A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed, utilizing a multigrid iterative technique. The code is compared with a presently existing direct solution in terms of computational time and accuracy. The model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobssen-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via liquid striations. The mixed nature of the equations (elliptic in the full film zone and nonelliptic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.

Woods, Claudia M.↗

Unstructured multigrid methods

The use of the multigrid procedure with a sequence of unnested coarser grids is discussed. Validity of the procedure is assessed by considering the solution of a single linear elliptic equation. It is demonstrated how a scheme with the optimum order of operations can be constructed. Application to the solution of the Euler equations is considered.

Loehner, R.↗

Isothermal magnetostatic atmospheres. II - Similarity solutions with current proportional to the magnetic potential cubed

The paper presents a family of isothermal magnetostatic atmospheres with one ignorable coordinate corresponding to a uniform gravitational field in a plane geometry. The distributed current in the model J is directed along the x-axis, where x is the horizontal ignorable coordinate. The current J is taken to be proportional to the cube of the magnetostatic potential A and falls off exponentially with distance vertical to the base with an e-folding distance equal to the gravitational scale height. A range of similarity solution examples are displayed depending on the values of the similarity parameters. Each similarity parameter corresponds to a symmetry of the underlying nonlinear elliptic equation for A. The similarity parameters also determine the source currents for the potential field solution of the family. The solutions show the interplay between the gravitational force, the J & B force (B, magnetic field induction) and the gas pressure gradient.

Webb, G. M.↗

Body force circulation and the Antarctic Ozone minimum

A dynamical mechanism, which is relevant to the ozone-depletion problem and which involves a 'body force' circulation discussed by Eliassen (1951), is considered. The body force problem and its application to 'generic' upper-tropospheric wave-driving are discussed theoretically. Following a review of the interhemispheric differences in the winter and early-spring circulation, the elliptic equation governing the residual mean meridional streamfunction is derived, and its analytic-solution properties in negligible shear are discussed. Finally, a numerical solution is derived using the observed August winds under the assumption of radiative equilibrium, and the effect of diabatic heating is discussed.

Dunkerton, Timothy J.↗

Incompressible and anelastic flow simulations on numerically generated grids

In the numerical simulation of incompressible and anelastic flows, it is necessary to solve an elliptic equation at each time step. When the boundaries of such flows are nonrectangular, it may be advantageous to solve the equations on a new, numerically generated coordinate grid, in which the property of orthogonality has been preserved. Flow equations in general curvilinear coordinates maintaining the conservative form are given for both anelastic models using the momentum equations, and for incompressible models, using the vorticity equation. The general problem of grid-generation in two dimensions is presented, and a quasi-conformal transformation technique is discussed in detail. Some examples of grids generated by this technique are exhibited. Three examples of the flow of a stratified fluid over obstacles are presented, in which the grid-generation permits some new results to be obtained.

Sharman, R. D.↗

A multigrid solver for semi-implicit global shallow-water models

A multigrid solver is developed for the discretized two-dimensional elliptic equation on the sphere that arises from a semiimplicit time discretization of the global shallow-water equations. Different formulations of the semiimplicit scheme result in variable-coefficient Helmholtz-type equations for which no fast direct solvers are available. The efficiency of the multigrid solver is optimal, in the sense that the total operation count is proportional to the number of unknowns. Numerical experiments using initial data derived from actual 300-mb height and wind velocity fields indicate that the present model has very good accuracy and stability properties.

Barros, Saulo R. M.↗

Quadrature imposition of compatibility conditions in Chebyshev methods

Often, in solving an elliptic equation with Neumann boundary conditions, a compatibility condition has to be imposed for well-posedness. This condition involves integrals of the forcing function. When pseudospectral Chebyshev methods are used to discretize the partial differential equation, these integrals have to be approximated by an appropriate quadrature formula. The Gauss-Chebyshev (or any variant of it, like the Gauss-Lobatto) formula can not be used here since the integrals under consideration do not include the weight function. A natural candidate to be used in approximating the integrals is the Clenshaw-Curtis formula, however it is shown that this is the wrong choice and it may lead to divergence if time dependent methods are used to march the solution to steady state. The correct quadrature formula is developed for these problems. This formula takes into account the degree of the polynomials involved. It is shown that this formula leads to a well conditioned Chebyshev approximation to the differential equations and that the compatibility condition is automatically satisfied.

Gottlieb, D.↗

Domain decomposition methods for nonconforming finite element spaces of Lagrange-type

In this article, we consider the application of three popular domain decomposition methods to Lagrange-type nonconforming finite element discretizations of scalar, self-adjoint, second order elliptic equations. The additive Schwarz method of Dryja and Widlund, the vertex space method of Smith, and the balancing method of Mandel applied to nonconforming elements are shown to converge at a rate no worse than their applications to the standard conforming piecewise linear Galerkin discretization. Essentially, the theory for the nonconforming elements is inherited from the existing theory for the conforming elements with only modest modification by constructing an isomorphism between the nonconforming finite element space and a space of continuous piecewise linear functions.

Cowsar, Lawrence C.↗

Relaxation schemes for Chebyshev spectral multigrid methods

Two relaxation schemes for Chebyshev spectral multigrid methods are presented for elliptic equations with Dirichlet boundary conditions. The first scheme is a pointwise-preconditioned Richardson relaxation scheme and the second is a line relaxation scheme. The line relaxation scheme provides an efficient and relatively simple approach for solving two-dimensional spectral equations. Numerical examples and comparisons with other methods are given.

Kang, Yimin↗

An adaptive grid with directional control

An adaptive grid generator for adaptive node movement is here derived by combining a variational formulation of Winslow's (1981) variable-diffusion method with a directional control functional. By applying harmonic-function theory, it becomes possible to define conditions under which there exist unique solutions of the resulting elliptic equations. The results obtained for the grid generator's application to the complex problem posed by the fluid instability-driven magnetic field reconnection demonstrate one-tenth the computational cost of either a Eulerian grid or an adaptive grid without directional control.

Brackbill, J. U.↗

Automatic multi-block grid generation for high-lift configuration wings

A new method for automatic multi-block grid generation is described. The method combines the Modified Advancing Front Method as a Predictor with an elliptic scheme as a corrector. It advances a collection of cells by one cell height in the outward direction using Modified Advancing Front Method, and then corrects newly-obtained cell positions by solving elliptic equations. This predictor-corrector type scheme is repeatedly applied until the field of interest is filled with hexahedral grid cells. Given the configuration surface grid, the scheme produces block layouts as well as grid cells with overall smoothness as its output. The present method saves human-time and reduces the burden on the user in generating grids for general 3-D configurations. It was used to generate multi-block grids for wings in their high-lift configuration.

Kim, Byoungsoo↗

Development of an automatic block generation algorithm

A method for automatic multiblock grid generation is described. The method combines the modified advancing front method as a predictor with an elliptic scheme as a corrector. It advances a collection of cells by one cell height in the outward direction using modified advancing front method, and then corrects newly-obtained cell positions by solving elliptic equations. This predictor-corrector type scheme is repeatedly applied until the field of interest is filled with hexahedral grid cells. Given the configuration surface grid, the scheme produces block layouts as well as grid cells with overall smoothness as its output. The method saves human-time and reduces the burden on the user in generating grids for general 3D configurations. It is used to generate multiblock grids for wings in their high-lift configuration.

Eberhardt, Scott↗