Search NASASearch

SEARCH · Search NASA

Results for “Elliptic problems”

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 235 records · Page 13

Survey of the status of finite element methods for partial differential equations

The finite element methods (FEM) have proved to be a powerful technique for the solution of boundary value problems associated with partial differential equations of either elliptic, parabolic, or hyperbolic type. They also have a good potential for utilization on parallel computers particularly in relation to the concept of domain decomposition. This report is intended as an introduction to the FEM for the nonspecialist. It contains a survey which is totally nonexhaustive, and it also contains as an illustration, a report on some new results concerning two specific applications, namely a free boundary fluid-structure interaction problem and the Euler equations for inviscid flows.

Temam, Roger

Calculating satellite umbra/penumbra entry and exit positions and times

The problem of calculating earth satellite entry/exit positions and times through the earth's umbra and penumbra for elliptical satellite orbits is solved in closed form; i.e., without iteration, by reducing the problem to that of finding the roots of a quartic polynomial in a cartesian coordinate. Typical results from an algorithm constructed from the method are shown.

Mullins, Larry D.

Problem size, parallel architecture and optimal speedup

The communication and synchronization overhead inherent in parallel processing can lead to situations where adding processors to the solution method actually increases execution time. Problem type, problem size, and architecture type all affect the optimal number of processors to employ. The numerical solution of an elliptic partial differential equation is examined in order to study the relationship between problem size and architecture. The equation's domain is discretized into n sup 2 grid points which are divided into partitions and mapped onto the individual processor memories. The relationships between grid size, stencil type, partitioning strategy, processor execution time, and communication network type are analytically quantified. In so doing, the optimal number of processors was determined to assign to the solution, and identified (1) the smallest grid size which fully benefits from using all available processors, (2) the leverage on performance given by increasing processor speed or communication network speed, and (3) the suitability of various architectures for large numerical problems.

Nicol, David M.

Problem size, parallel architecture, and optimal speedup

The communication and synchronization overhead inherent in parallel processing can lead to situations where adding processors to the solution method actually increases execution time. Problem type, problem size, and architecture type all affect the optimal number of processors to employ. The numerical solution of an elliptic partial differential equation is examined in order to study the relationship between problem size and architecture. The equation's domain is discretized into n sup 2 grid points which are divided into partitions and mapped onto the individual processor memories. The relationships between grid size, stencil type, partitioning strategy, processor execution time, and communication network type are analytically quantified. In so doing, the optimal number of processors was determined to assign to the solution, and identified (1) the smallest grid size which fully benefits from using all available processors, (2) the leverage on performance given by increasing processor speed or communication network speed, and (3) the suitability of various architectures for large numerical problems.

Nicol, David M.

Preconditioned Minimal Residual Methods for Chebyshev Spectral Caluclations

The problem of preconditioning the pseudospectral Chebyshev approximation of an elliptic operator is considered. The numerical sensitiveness to variations of the coefficients of the operator are investigated for two classes of preconditioning matrices: one arising from finite differences, the other from finite elements. The preconditioned system is solved by a conjugate gradient type method, and by a DuFort-Frankel method with dynamical parameters. The methods are compared on some test problems with the Richardson method and with the minimal residual Richardson method.

Canuto, C.

Preconditioned minimal residual methods for Chebyshev spectral calculations

The problem of preconditioning the pseudospectral Chebyshev approximation of an elliptic operator is considered. The numerical sensitiveness to variations of the coefficients of the operator are investigated for two classes of preconditioning matrices: one arising from finite differences, the other from finite elements. The preconditioned system is solved by a conjugate gradient type method, and by a Dufort-Frankel method with dynamical parameters. The methods are compared on some test problems with the Richardson method and with the minimal residual Richardson method.

Canuto, C.

A minimal residual method for transonic potential flows

For transonic flow calculations, a combination of the successive line over-relaxation (SLOR) and the preconditioned conjugate gradient (CG) method has been suggested by Wong and Hafez (1981). This paper studies the method of minimal residual (MR) which avoids a combined iteration. This method is closely related to the CG method, may be regarded as a first-order gradient method, and is applicable to symmetric and nonsymmetric matrices. The problem is formulated as a nonlinear mixed elliptic-hyperbolic partial differential equation which includes an artificial viscosity and a switching function which is zero in subsonic regions and nonzero in supersonic regions. Alternatives to the SLOR method which provide faster convergence rates are introduced. The preconditioned MR algorithm is developed, and transonic potential flows around NACA 0012 airfoil are calculated for different Mach numbers and angles of attack. Preliminary results are presented, demonstrating that the MR algorithm requires no parameter estimation and rapidly converges for subsonic flows.

Wong, Y. S.

A new method for the aerodynamic analysis of lifting surfaces

The use of the original Ffowcs Williams and Hawkings equation to improve the solution to simple problems of two-dimensional and incompressible flow is studied. It is shown that a linear formulation, with the quadrupole term neglected, leads to better correlation with the results of potential theory. A solution to steady and two-dimensional problems is developed and applied to families of elliptic cylinders and symmetric airfoils.

Brandao, Mauricio Pazini

Towards a theory of automated elliptic mesh generation

The theory of elliptic mesh generation is reviewed and the fundamental problem of constructing computational space is discussed. It is argued that the construction of computational space is an NP-Complete problem and therefore requires a nonstandard approach for its solution. This leads to the development of graph-theoretic, combinatorial optimization and integer programming algorithms. Methods for the construction of two dimensional computational space are presented.

Cordova, J. Q.

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.

Preconditioned Mixed Spectral Element Methods for Elasticity and Stokes Problems

Preconditioned iterative methods for the indefinite systems obtained by discretizing the linear elasticity and Stokes problems with mixed spectral elements in three dimensions are introduced and analyzed. The resulting stiffness matrices have the structure of saddle point problems with a penalty term, which is associated with the Poisson ratio for elasticity problems or with stabilization techniques for Stokes problems. The main results of this paper show that the convergence rate of the resulting algorithms is independent of the penalty parameter, the number of spectral elements Nu and mildly dependent on the spectral degree eta via the inf-sup constant. The preconditioners proposed for the whole indefinite system are block-diagonal and block-triangular. Numerical experiments presented in the final section show that these algorithms are a practical and efficient strategy for the iterative solution of the indefinite problems arising from mixed spectral element discretizations of elliptic systems.

Pavarino, Luca F.

Relative Navigation In Elliptical Orbits Using An Iterative Nonlinear Filter

The two step filter is applied to process intersatellite radar measurements to determine the motion of one satellite relative to another in close elliptical orbits. This filter breaks a nonlinear estimation problem into two state vectors. The 'first step' state is chosen so as to have a linear measurement equation. This is nonlinearly related to the 'second step' state which describes the dynamics. Two different forms are used. In one, the first step state is the second step state vector augmented by the measurement equation. In the other, the first step and second step state vectors are of equal dimension. The two step filter is compared against an iterated extended Kalman filter and a Kalman filter using a change of variables. Analytical differences between the two step estimator and these conventional filters are highlighted. Special concerns for initializing the first step state covariance matrix and handling the possibility of numerically rank deficient covariance matrices are addressed. Numerical simulations are performed which show that the Two Step estimator produces a lower estimation bias under two circumstances; large apriori initial error; and small dimension observation vectors which require a longer arc of measurements to generate observability of the state.

Garrison, James L.

The dependence on morphology of the gas content in galactic disks

The classification S0 was introduced by Hubble to serve as a description of galaxies whose morphological characteristics seemed to lie between the disk-dominated spirals and the spheroidal elliptical systems. Since then there has been extensive discussion as to whether this classification sequence is also an evolutionary sequence. Many studies have focussed on a particular feature such as the luminosity profile, the bulge-to-disk ratio, or the nature of the interstellar matter, but the question of the evolution remains contentious. Equally contentious is the question of the classification itself. For systems with well-developed disks there usually is no problem. Many spheroidal systems also are unambiguously classified as ellipticals in most catalogs. However, there are a number of early systems which have been reclassified following review using improved optical material. For example, Eder et al. (AJ, 102, 572, 1991) found that many of the S0 galaxies which are rich in neutral hydrogen have faint spiral features. The confusion about classification propagates into the discussion of the properties of early-type systems. Attempts to put the classification system on a quantitative basis have in general been unsuccessful. Recently Sandage (private communication) has reviewed the classification of early systems and has defined a set of sub-classes for these objects. The S0 galaxies are divided into three groups, depending on the prominence of the disk. There are six subdivisions of Sa galaxies, depending upon the relative prominence of knots and other arm-like characteristics. We have explored the total gas content in these objects to see if there is a dependence on the galaxy morphology, as denoted by these new subclasses.

Hogg, D. E.

Elliptic Grid Generation of Spiral-Bevel Pinion Gear Typical of OH-58 Helicopter Transmission

This paper discusses the source term treatment in the numerical solution of elliptic partial differential equations for an interior grid generation problem in generalized curvilinear coordinates. The geometry considered is that of a planar cross-section of a generic spiral-bevel gear tooth typical of a pinion in the OH-58 helicopter transmission. The source terms used are appropriate for an interior grid domain where all the boundaries are prescribed via a combination of Dirichlet and Neumann boundary conditions. New constraints based on the Green's Theorem are derived which uniquely determine the coefficients in the source terms. These constraints are designed for boundary clustered grids where gradients in physical quantities need to be resolved adequately. However, it is seen that the present formulation works satisfactorily for mild clustering also. Thus, a fully automated elliptic grid generation technique is made possible where there is no need for a parametric study of these parameters since the new relations fix these free parameters uniquely.

Kaul, Upender K.

A semi-direct procedure using a local relaxation factor and its application to an internal flow problem

Generally, fast direct solvers are not directly applicable to a nonseparable elliptic partial differential equation. This limitation, however, is circumvented by a semi-direct procedure, i.e., an iterative procedure using fast direct solvers. An efficient semi-direct procedure which is easy to implement and applicable to a variety of boundary conditions is presented. The current procedure also possesses other highly desirable properties, i.e.: (1) the convergence rate does not decrease with an increase of grid cell aspect ratio, and (2) the convergence rate is estimated using the coefficients of the partial differential equation being solved.

Chang, S. C.