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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 127 records · Page 7

All sources NASA NTRS DOE OSTI

NASA NTRS1992

Domain decomposition: A bridge between nature and parallel computers

Domain decomposition is an intuitive organizing principle for a partial differential equation (PDE) computation, both physically and architecturally. However, its significance extends beyond the readily apparent issues of geometry and discretization, on one hand, and of modular software and distributed hardware, on the other. Engineering and computer science aspects are bridged by an old but recently enriched mathematical theory that offers the subject not only unity, but also tools for analysis and generalization. Domain decomposition induces function-space and operator decompositions with valuable properties. Function-space bases and operator splittings that are not derived from domain decompositions generally lack one or more of these properties. The evolution of domain decomposition methods for elliptically dominated problems has linked two major algorithmic developments of the last 15 years: multilevel and Krylov methods. Domain decomposition methods may be considered descendants of both classes with an inheritance from each: they are nearly optimal and at the same time efficiently parallelizable. Many computationally driven application areas are ripe for these developments. A progression is made from a mathematically informal motivation for domain decomposition methods to a specific focus on fluid dynamics applications. To be introductory rather than comprehensive, simple examples are provided while convergence proofs and algorithmic details are left to the original references; however, an attempt is made to convey their most salient features, especially where this leads to algorithmic insight.

Keyes, David E.↗

NASA NTRS1993

On the shear stabilization of capillary break-up of finite liquid bridges

In this paper we consider an isothermal finite liquid bridge under zero-gravity. A sinusoidal interfacial shear stress drives a nonparallel flow in the bridge. The linear stability of this flow to three-dimensional disturbances (which may deform the cylindrical gas-liquid interface) is determined numerically by solving an elliptic eigenvalue problem. Previous results on shear stabilization of capillary break-up of axially unbounded cylindrical interfaces containing a parallel flow are hereby extended to a nonparallel flow. The turning flow regions influence the stability significantly. However, for the particular cases considered, a small area in parameter space remains where the capillary instability is suppressed through interfacial shear. Second, non-axisymmetric oscillatory instabilities are found which originate from an interaction of the interface deformation and the basic flow. These instabilities may be the isothermal limit of the oscillatory instabilities observed in float-zone crystal growth.

Dijkstra, Henk A.↗

NASA NTRS1992

Spaceflight mechanics 1992; Proceedings of the 2nd AAS/AIAA Meeting, Colorado Springs, CO, Feb. 24-26, 1992. Pts. 1 & 2

The present conference discusses topics in orbit determination, tethered satellite systems, celestial mechanics, guidance optimization, flexible body dynamics and control, attitude dynamics and control, Mars mission analyses, earth-orbiting mission analysis/debris, space probe mission analyses, and orbital computation numerical analyses. Attention is given to electrodynamic forces for control of tethered satellite systems, orbiting debris threats to asteroid flyby missions, launch velocity requirements for interceptors of short range ballistic missiles, transfers between libration-point orbits in the elliptic restricted problem, minimum fuel spacecraft reorientation, orbital guidance for hitting a fixed point at maximum speed, efficient computation of satellite visibility periods, orbit decay and reentry prediction for space debris, and the determination of satellite close approaches.

Diehl, Roger E.↗

NASA NTRS1994

A preliminary analysis of the orbit of the Mars Trojan asteroid (5261) Eureka

Observations and results of orbit determination of the first known Mars Trojan asteroid (5261) Eureka are presented. We have numerically calculated the evolution of the orbital elements, and have analyzed the behavior of the motion during the next 2 Myr. Strong perturbations by planets other than Mars seem to stabilize the eccentricity of the asteroid by stirring the high order resonances present in the elliptic restricted problem. As a result, the orbit appears stable at least on megayear timescales. The difference of the mean longitudes of Mars and Eureka and the semimajor axis of the asteroid form a pair of variables that essentially behave in an adiabatic manner, while the evolution of the other orbital elements is largely determined by the pertubations due to other planets.

Mikkola, Seppo↗

NASA NTRS1996

A Parallel Multilevel Spectral Element Scheme

A parallel multilevel strategy is developed using spectral (p) finite elements. Hierarchic bases are particularly well suited since the element matrices and vectors are nested and the multilevel projections easiliy performed. Since the basis degree is used to specify the multigrid level, an EBE strategy is natural br the multilevel technique. Results are presented for two candidate nonlinear elliptic transport problems: the augmented drift-diffusion equations of semiconductor device modeling and the stream function-vorticity equations of incompressible fluid dynamics.

Davis, M. B.↗

NASA NTRS1996

Wavelet Sparse Approximate Inverse Preconditioners

There is an increasing interest in using sparse approximate inverses as preconditioners for Krylov subspace iterative methods. Recent studies of Grote and Huckle and Chow and Saad also show that sparse approximate inverse preconditioner can be effective for a variety of matrices, e.g. Harwell-Boeing collections. Nonetheless a drawback is that it requires rapid decay of the inverse entries so that sparse approximate inverse is possible. However, for the class of matrices that, come from elliptic PDE problems, this assumption may not necessarily hold. Our main idea is to look for a basis, other than the standard one, such that a sparse representation of the inverse is feasible. A crucial observation is that the kind of matrices we are interested in typically have a piecewise smooth inverse. We exploit this fact, by applying wavelet techniques to construct a better sparse approximate inverse in the wavelet basis. We shall justify theoretically and numerically that our approach is effective for matrices with smooth inverse. We emphasize that in this paper we have only presented the idea of wavelet approximate inverses and demonstrated its potential but have not yet developed a highly refined and efficient algorithm.

Chan, Tony F.↗

NASA NTRS2018

Rapid Trajectory Prediction for a Fixed-Wing UAS in a Uniform Wind Field with Specified Arrival Times

This paper presents an algorithm to rapidly generate trajectories for a kinematic fixed-wing Unmanned Aircraft System (UAS) model flying at constant altitude in a uniform wind field. Arrival times are specified by operators and rapid generation is accomplished via an elliptic integral problem formulation. Simulations are provided that illustrate this approach in the context of NASA's UAS Traffic Management Project.

trajectory↗

NASA NTRS1971

A note on independent variables for restricted three-body problems.

In studies of the elliptic restricted three-body problem, the true anomaly of the motion of the primaries is often used as the independent variable. The equations of motion then show invariancy in form from the circular case. It is of interest whether other independent variables exist, such that the invariant form of the equations is maintained. It is found that true anomaly is the only such variable.

Heppenheimer, T. A.↗

NASA NTRS1979

Numerical method for predicting flow characteristics and performance of nonaxisymmetric nozzles, theory

The theoretical foundation and formulation of a numerical method for predicting the viscous flowfield in and about isolated three dimensional nozzles of geometrically complex configuration are presented. High Reynolds number turbulent flows are of primary interest for any combination of subsonic, transonic, and supersonic flow conditions inside or outside the nozzle. An alternating-direction implicit (ADI) numerical technique is employed to integrate the unsteady Navier-Stokes equations until an asymptotic steady-state solution is reached. Boundary conditions are computed with an implicit technique compatible with the ADI technique employed at interior points of the flow region. The equations are formulated and solved in a boundary-conforming curvilinear coordinate system. The curvilinear coordinate system and computational grid is generated numerically as the solution to an elliptic boundary value problem. A method is developed that automatically adjusts the elliptic system so that the interior grid spacing is controlled directly by the a priori selection of the grid spacing on the boundaries of the flow region.

Thomas, P. D.↗

NASA NTRS1991

The improved robustness of multigrid elliptic solvers based on multiple semicoarsened grids

Multigrid convergence rates degenerate on problems with stretched grids or anisotropic operators, unless one uses line or plane relaxation. For 3-D problems, only plane relaxation suffices, in general. While line and plane relaxation algorithms are efficient on sequential machines, they are quite awkward and inefficient on parallel machines. A new multigrid algorithm is presented based on the use of multiple coarse grids, that eliminates the need for line or plane relaxation in anisotropic problems. This algorithm was developed and the standard multigrid theory was extended to establish rapid convergence for this class of algorithms. The new algorithm uses only point relaxation, allowing easy and efficient parallel implementation, yet achieves robustness and convergence rates comparable to line and plane relaxation multigrid algorithms. The algorithm described is a variant of Mulder's multigrid algorithm for hyperbolic problems. The latter uses multiple coarse grids to achieve robustness, but is unsuitable for elliptic problems, since its V-cycle convergence rate goes to one as the number of levels increases. The new algorithm combines the contributions from the multiple coarse grid via a local switch, based on the strength of the discrete operator in each coordinate direction.

Naik, Naomi H.↗

NASA NTRS1998

A Parallel Non-Overlapping Domain-Decomposition Algorithm for Compressible Fluid Flow Problems on Triangulated Domains

This paper considers an algebraic preconditioning algorithm for hyperbolic-elliptic fluid flow problems. The algorithm is based on a parallel non-overlapping Schur complement domain-decomposition technique for triangulated domains. In the Schur complement technique, the triangulation is first partitioned into a number of non-overlapping subdomains and interfaces. This suggests a reordering of triangulation vertices which separates subdomain and interface solution unknowns. The reordering induces a natural 2 x 2 block partitioning of the discretization matrix. Exact LU factorization of this block system yields a Schur complement matrix which couples subdomains and the interface together. The remaining sections of this paper present a family of approximate techniques for both constructing and applying the Schur complement as a domain-decomposition preconditioner. The approximate Schur complement serves as an algebraic coarse space operator, thus avoiding the known difficulties associated with the direct formation of a coarse space discretization. In developing Schur complement approximations, particular attention has been given to improving sequential and parallel efficiency of implementations without significantly degrading the quality of the preconditioner. A computer code based on these developments has been tested on the IBM SP2 using MPI message passing protocol. A number of 2-D calculations are presented for both scalar advection-diffusion equations as well as the Euler equations governing compressible fluid flow to demonstrate performance of the preconditioning algorithm.

Barth, Timothy J.↗

DOE OSTI2025

Optimization problems governed by systems of PDEs with uncertainties

This paper reviews current theoretical and numerical approaches to optimization problems governed by partial differential equations (PDEs) that depend on random variables or random fields. Such problems arise in many engineering, science, economics and societal decision-making tasks. This paper focuses on problems in which the governing PDEs are parametrized by the random variables/fields, and the decisions are made at the beginning and are not revised once uncertainty is revealed. Examples of such problems are presented to motivate the topic of this paper, and to illustrate the impact of different ways to model uncertainty in the formulations of the optimization problem and their impact on the solution. A linear–quadratic elliptic optimal control problem is used to provide a detailed discussion of the set-up for the risk-neutral optimization problem formulation, study the existence and characterization of its solution, and survey numerical methods for computing it. Different ways to model uncertainty in the PDE-constrained optimization problem are surveyed in an abstract setting, including risk measures, distributionally robust optimization formulations, probabilistic functions and chance constraints, and stochastic orders. Furthermore, approximation-based optimization approaches and stochastic methods for the solution of the large-scale PDE-constrained optimization problems under uncertainty are described. Some possible future research directions are outlined.

Heinkenschloss, Matthias [Rice Univ., Houston, TX ↗

NASA NTRS1980

Central configurations and hyperbolic-elliptic motion in the three-body problem

A refined classification of motion for the planar three-body problem with zero-sum total energy is presented. The structure and dimensions of the sets of initial conditions leading to parabolic expansion or hyperbolic-elliptic motion are found. Attention is given to the use of the Hamiltonian of the system and to the two- and three-dimensional problem. It is verified that the new coordinates of position and linear momentum approaches limits as t (time) approaches infinity, and that these limits constitute equilibrium solutions to the three-body problem representing control configurations.

Hulkower, N. D.↗

NASA NTRS1993

The velocity fields of elliptical galaxies: Steps toward a solution of the intrinsic shape problem

One of the few surviving signatures, at low redshift, of the process of galaxy formation should be the distribution of shapes of elliptical galaxies. Yet the problem of inferring this distribution from the observed ellipticals is still unsolved, because insufficient use has been made of kinematic information. The levels of 'sophistication' of the theoretical models and of the observations have up to now been poorly matched. The kinematic data available for most ellipticals consists of only major and minor axis spectra; and Franx et al. (1991) find, using simple geometric models, that the addition of only one kinematic parameter (the ratio of minor axis to major axis rotation velocity) to the photometry is just not enough to finely constrain the intrinsic shape distribution. On the other hand, the more elaborate self-consistent models (e.g., Levison and Richstone 1987, Statler 1987) have made only infrequent and model-dependent predictions of complicated velocity patterns, mostly at small radii, and have not discussed how they change with shape.

Statler, Thomas S.↗

NASA NTRS1988

Quadrature methods for periodic singular and weakly singular Fredholm integral equations

High-accuracy numerical quadrature methods for integrals of singular periodic functions are proposed. These methods are based on the appropriate Euler-Maclaurin expansions of trapezoidal rule approximations and their extrapolations. They are subsequently used to obtain accurate quadrature methods for the solution of singular and weakly singular Fredholm integral equations. Throughout the development the periodic nature of the problem plays a crucial role. Such periodic equations are used in the solution of planar elliptic boundary value problems such as those that arise in elasticity, potential theory, conformal mapping, and free surface flows. The use of the quadrature methods is demonstrated with numerical examples.

Sidi, Avram↗

NASA NTRS1996

Migrational Instabilities in Particle Suspensions

This work deals with an instability arising from the shear-induced migration of particles in dense suspensions coupled with a dependence of viscosity on particle concentration. The analysis summarized here treats the inertialess (Re = O) linear stability of homogeneous simple shear flows for a Stokesian suspension model of the type proposed by Leighton and Acrivos (1987). Depending on the importance of shear-induced migration relative to concentration-driven diffusion, this model admits short-wave instability arising from wave-vector stretching by the base flow and evolving into particle-depleted shear bands. Moreover, this instability in the time-dependent problem corresponds to loss of ellipticity in the associated static problem (Re = O, Pe = O). While the isotropic version of the Leighton-Acrivos model is found to be stable with their experimentally determined parameters for simple shear, it is known that the stable model does not give a good quantitative description of particle clustering in the core of pipe flow (Nott and Brady 1994). This leads to the conjecture that an appropriate variant on the above model could explain such clustering as a two-phase bifurcation in the base flow.

Goddard, Joe D.↗

NASA NTRS1991

One shot methods for optimal control of distributed parameter systems 1: Finite dimensional control

The efficient numerical treatment of optimal control problems governed by elliptic partial differential equations (PDEs) and systems of elliptic PDEs, where the control is finite dimensional is discussed. Distributed control as well as boundary control cases are discussed. The main characteristic of the new methods is that they are designed to solve the full optimization problem directly, rather than accelerating a descent method by an efficient multigrid solver for the equations involved. The methods use the adjoint state in order to achieve efficient smoother and a robust coarsening strategy. The main idea is the treatment of the control variables on appropriate scales, i.e., control variables that correspond to smooth functions are solved for on coarse grids depending on the smoothness of these functions. Solution of the control problems is achieved with the cost of solving the constraint equations about two to three times (by a multigrid solver). Numerical examples demonstrate the effectiveness of the method proposed in distributed control case, pointwise control and boundary control problems.

Taasan, Shlomo↗

NASA NTRS1994

Centaurus A, the core of the problem

The bright, peculiar elliptical galaxy Centaurus A (NGC 5128, PKS 1322-427) was one of the first extragalactic radio sources to be optically identified (Bolton et al. 1949). At a distance of 4 Mpc, Centaurus A is the closest active radio galaxy and affords the highest linear imaging resolution (1 mas approximately equal to 0.02 pc) and hence the best prospects for studying an active nucleus close to the central radio source. We present the results of multi-epoch, 8.4-GHz, very long baseline interferometry (VLBI), imaging observations of the nucleus made over the past three years. The nucleus possesses a core-jet structure where the inner portion of the jet shows apparent linear motion with a velocity substantially less than the speed of light.

Tingay, S. J.↗