Search NASA⌕ Search

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Film thickness for different regimes of fluid-film lubrication

Mathematical formulas are presented which express the dimensionless minimum film thickness for the four lubrication regimes found in elliptical contacts: isoviscous-rigid regime; piezoviscous-rigid regime; isoviscous-elastic regime; and piezoviscous-elastic regime. The relative importance of pressure on elastic distortion and lubricant viscosity is the factor that distinguishes these regimes for a given conjunction geometry. In addition, these equations were used to develop maps of the lubrication regimes by plotting film thickness contours on a log-log grid of the dimensionless viscosity and elasticity parameters for three values of the ellipticity parameter. These results present a complete theoretical film thickness parameter solution for elliptical constants in the four lubrication regimes. The results are particularly useful in initial investigations of many practical lubrication problems involving elliptical conjunctions.

Hamrock, B. J.↗
NASA NTRS1975

Periodic orbits in the Planar General Three-Body Problem

The article contains a numerical study of periodic solutions of the Planar General Three-Body Problem. Several new periodic solutions have been discovered and are described. In particular, there is a continuous family with variable masses, extending all the way from the elliptic restricted problem to the general problem with three equal masses. All our examples have special symmetry properties which are described in detail. Finally we also suggest some important applications to the natural satellites of the solar system.

Broucke, R.↗
NASA NTRS1986

Canonical solution of the two critical argument problem

The solution by Sessin and Ferraz-Mello (1984) of the Hori auxiliary system for the motion of two planets with periods nearly commensurate in the ratio 2:1 is considerably simplified by the introduction of canonical variables. An analogous canonical transformation simplifies the elliptic restricted problem.

Wisdom, J.↗
DOE OSTI2025

Explicit block encodings of boundary value problems for many-body elliptic operators

Simulation of physical systems is one of the most promising use cases of future digital quantum computers. In this work we systematically analyze the quantum circuit complexities of block encoding the discretized elliptic operators that arise extensively in numerical simulations for partial differential equations, including high-dimensional instances for many-body simulations. When restricted to rectangular domains with separable boundary conditions, we provide explicit circuits to block encode the many-body Laplacian with separable periodic, Dirichlet, Neumann, and Robin boundary conditions, using standard discretization techniques from low-order finite difference methods. To obtain high-precision, we introduce a scheme based on periodic extensions to solve Dirichlet and Neumann boundary value problems using a high-order finite difference method, with only a constant increase in total circuit depth and subnormalization factor. We then present a scheme to implement block encodings of differential operators acting on more arbitrary domains, inspired by Cartesian immersed boundary methods. We then block encode the many-body convective operator, which describes interacting particles experiencing a force generated by a pair-wise potential given as an inverse power law of the interparticle distance. This work provides concrete recipes that are readily translated into quantum circuits, with depth logarithmic in the total Hilbert space dimension, that block encode operators arising broadly in applications involving the quantum simulation of quantum and classical many-body mechanics.

Kharazi, Tyler [University of California, Berkeley↗
DOE OSTI2025

Adaptive Interface-PINNs (AdaI-PINNs): An Efficient Physics-Informed Neural Networks Framework for Interface Problems

Here, we present an efficient physics-informed neural networks (PINNs) framework, termed Adaptive Interface-PINNs (AdaI-PINNs), to improve the modeling of interface problems with discontinuous coefficients and/or interfacial jumps. This framework is an enhanced version of its predecessor, Interface PINNs or I-PINNs (Sarma et al.; https://doi.org/10.1016/j.cma.2024.117135), which involves domain decomposition and assignment of different predefined activation functions to the neural networks in each subdomain across a sharp interface, while keeping all other parameters of the neural networks identical. In AdaI-PINNs, the activation functions vary solely in their slopes, which are trained along with the other parameters of the neural networks. This makes the AdaI-PINNs framework fully automated without requiring preset activation functions. Comparative studies on one-dimensional, two-dimensional, and three-dimensional benchmark elliptic interface problems reveal that AdaI-PINNs outperform I-PINNs, reducing computational costs by 2-6 times while producing similar or better accuracy.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1970

Computer discrimination procedures applicable to aerial and ERTS multispectral data

Two statistical models are compared in the classification of crops recorded on color aerial photographs. A theory of error ellipses is applied to the pattern recognition problem. An elliptical boundary condition classification model (EBC), useful for recognition of candidate patterns, evolves out of error ellipse theory. The EBC model is compared with the minimum distance to the mean (MDM) classification model in terms of pattern recognition ability. The pattern recognition results of both models are interpreted graphically using scatter diagrams to represent measurement space. Measurement space, for this report, is determined by optical density measurements collected from Kodak Ektachrome Infrared Aero Film 8443 (EIR). The EBC model is shown to be a significant improvement over the MDM model.

Richardson, A. J.↗
NASA NTRS1971

Computer identification of ground pattern from aerial photographs.

Two statistical models are comapared in the classification of crops recorded on color aerial photographs. A theory of error ellipses is applied to the pattern recognition problem. An elliptical boundary condition classification model (EBC), useful for recognition of candidate patterns, evolves out of error ellipse theory. The EBC model is compared with the minimum distance to the mean (MDM) classification model in terms of pattern recognition ability. The pattern recognition results of both models are interpreted graphically using scatter diagrams to represent measurement space. Measurement space, for this report, is determined by optical density measurements collected from Kodak Ektachrome Infrared Aero Film 8443 (EIR). The EBC model is shown to be a significant improvement over the MDM model.

Richardson, A. J.↗
NASA NTRS1975

A technique for accelerating iterative convergence in numerical integration, with application in transonic aerodynamics

A technique is described for the efficient numerical solution of nonlinear partial differential equations by rapid iteration. In particular, a special approach is described for applying the Aitken acceleration formula (a simple Pade approximant) for accelerating the iterative convergence. The method finds the most appropriate successive approximations, which are in a most nearly geometric sequence, for use in the Aitken formula. Simple examples are given to illustrate the use of the method. The method is then applied to the mixed elliptic-hyperbolic problem of steady, inviscid, transonic flow over an airfoil in a subsonic free stream.

Martin, E. D.↗
NASA NTRS1976

A technique for accelerating iterative convergence in numerical integration, with application in transonic aerodynamics

A technique is described for the efficient numerical solution of nonlinear partial differential equations by rapid iteration. In particular, a special approach is described for applying the Aitken acceleration formula (a simple Pade approximant) for accelerating the iterative convergence. The method finds the most appropriate successive approximations, which are in a most nearly geometric sequence, for use in the Aitken formula. Simple examples are given to illustrate the use of the method. The method is then applied to the mixed elliptic-hyperbolic problem of steady, inviscid, transonic flow over an airfoil in a subsonic free stream.

Martin, E. D.↗
NASA NTRS1977

Fast methods incorporating direct elliptic solvers for nonlinear applications in fluid dynamics

Semidirect methods are discussed, their present role, as well as some developments for their application in computational fluid dynamics. A semidirect method is a computational scheme that uses a fast, direct, elliptic solver as the driving algorithm for the iterative solution of finite difference equations. Specific subtopics include: (1) direct Cauchy Riemann solvers for first order elliptic equations; (2) application of the semidirect method to the mixed elliptic hyperbolic problem of steady, inviscid transonic flow; and (3) the treatment of interior conditions, such as those on an airfoil or wing, in semidirect methods.

Martin, E. D.↗
NASA NTRS1979

Artificial compressibility methods for numerical solutions of transonic full potential equation

New methods for transonic flow computations based on the full potential equation in conservation form are presented. The idea is to modify slightly the density (due to the artificial viscosity in the supersonic region), and solve the resulting elliptic-like problem iteratively. It is shown that standard discretization techniques (central differencing) as well as some standard iterative procedures (SOR, ADI, and explicit methods) are applicable to the modified transonic mixed-type equation. Calculations of transonic flows around cylinders and airfoils are discussed with special emphasis on the explicit methods that are suitable for vector processing on the STAR 100 computer.

Hafez, M.↗
NASA NTRS1987

A direct algorithm for solution of incompressible three-dimensional unsteady Navier-Stokes equations

A direct, implicit, numerical solution algorithm, with second-order accuracy in space and time, is constructed for the three-dimensional unsteady incompressible Navier-Stokes equations formulated in terms of velocity and vorticity, using generalized orthogonal coordinates to achieve the accurate solution of complex viscous flow configurations. A numerically stable, efficient, direct inversion procedure is developed for the computationally intensive divergence-curl elliptic velocity problem. This overdetermined partial differential operator is first formulated as a uniquely determined, nonsingular matrix-vector problem; this aspect of the procedure is a unique feature of the present analysis. The three-dimensional vorticity-transport equation is solved by a modified factorization technique which completely eliminates the need for any block-matrix inversions and only scalar tridiagonal matrices need to be inverted. The method is applied to the test problem of the three-dimensional flow within a shear-driven cubical box. Coherent streamwise vortex structures are observed within the steady-state flow at Re = 100.

Osswald, G. A.↗
NASA NTRS1990

A user guide for the EMTAC-MZ CFD code

The computer code (EMTAC-MZ) was applied to investigate the flow field over a variety of very complex three-dimensional (3-D) configurations across the Mach number range (subsonic, transonic, supersonic, and hypersonic flow). In the code, a finite volume, multizone implementation of high accuracy, total variation diminishing (TVD) formulation (based on Roe's scheme) is used to solve the unsteady Euler equations. In the supersonic regions of the flow, an infinitely large time step and a space-marching scheme is employed. A finite time step and a relaxation or 3-D approximate factorization method is used in subsonic flow regions. The multizone technique allows very complicated configurations to be modeled without geometry modifications, and can easily handle combined internal and external flow problems. An elliptic grid generation package is built into the EMTAC-MZ code. To generate the computational grid, only the surface geometry data are required. Results obtained for a variety of configurations, such as fighter-like configurations (F-14, AVSTOL), flow through inlet, multi-bodies (shuttle with external tank and SRBs), are reported and shown to be in good agreement with available experimental data.

Szema, Kuo-Yen↗
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.↗