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 271 records · Page 15

A model for transonic plasma flow

A linear, two-dimensional model of a transonic plasma flow in equilibrium is constructed and given an explicit solution in the form of a complex Laplace integral. The solution indicates that the transonic state can be solved as an elliptic boundary value problem, as is done in the numerical code FLOW [Guazzotto et al., Phys. Plasmas 11, 604 (2004)]. Moreover, the presence of a hyperbolic region does not necessarily imply the presence of a discontinuity or any other singularity of the solution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Segmental Refinement: A Multigrid Technique for Data Locality

In this paper, we investigate a domain decomposed multigrid technique, termed segmental refinement, for solving general nonlinear elliptic boundary value problems. We extend the method first proposed in 1994 by analytically and experimentally investigating its complexity. We confirm that communication of traditional parallel multigrid is eliminated on fine grids, with modest amounts of extra work and storage, while maintaining the asymptotic exactness of full multigrid. We observe an accuracy dependence on the segmental refinement subdomain size, which was not considered in the original analysis. Finally, we present a communication complexity analysis that quantifies the communication costs ameliorated by segmental refinement and report performance results with up to 64K cores on a Cray XC30.

97 MATHEMATICS AND COMPUTING↗

Multilevel Sequential Monte Carlo Samplers for Normalizing Constants

This article considers the sequential Monte Carlo (SMC) approximation of ratios of normalizing constants associated to posterior distributions which in principle rely on continuum models. Therefore, the Monte Carlo estimation error and the discrete approximation error must be balanced. A multilevel strategy is utilized to substantially reduce the cost to obtain a given error level in the approximation as compared to standard estimators. Two estimators are considered and relative variance bounds are given. The theoretical results are numerically illustrated for two Bayesian inverse problems arising from elliptic partial differential equations (PDEs). The examples involve the inversion of observations of the solution of (i) a 1-dimensional Poisson equation to infer the diffusion coefficient, and (ii) a 2-dimensional Poisson equation to infer the external forcing.

97 MATHEMATICS AND COMPUTING↗

Knot Undulator to Generate Linearly Polarized Photons with Low on-Axis Power Density

Heat load on beamline optics is a serious problem to generate pure linearly polarized photons in the third generation synchrotron radiation facilities. For permanent magnet undulators, this problem can be overcome by a figure-8 operating mode. But there is still no good method to tackle this problem for electromagnetic elliptical undulators. Here, a novel operating mode is suggested, which can generate pure linearly polarized photons with very low on-axis heat load. Also the available minimum photon energy of linearly polarized photons can be extended much by this method.

43 PARTICLE ACCELERATORS↗

Surface energy and surface tension at holes and cracks

The concept of surface tension and surface energy of solids was used by Griffith to obtain a criterion for the extension of cracks in brittle materials. Griffith, however, neglected the stresses due to the normal traction at the crack implied by the surface tension. A complete solution to the problem of an elliptic hole in an infinite plate with surface tension loading at the hole is given. Complex potentials are given in closed form in terms of elliptic integrals of the first, second, and third kinds. Stress distributions are studied. For a flat crack, the nature of the singularity at the tip is shown to be radically different from that usually encountered in fracture mechanics. The implications of our analysis for theories of fracture in brittle materials are discussed.

Rajapakse, Y. D. S.↗

Hybrid finite element methods

The purpose of this paper is to show how Lagrange multipliers can be used with finite elements to achieve a number of desirable properties in the underlying approximation. For elliptic boundary value problems, variational principles can be developed in which all boundary conditions are natural. In fluid flow problems, one can endow the approximations with physically essential conservation laws.

Fix, G. M.↗

Numerical quadrature methods for integrals of singular periodic functions and their application to singular and weakly singular 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 used to obtain accurate quadrature methods for the solution of singular and weakly singular Fredholm integral equations. Such periodic equations are used in the solution of planar elliptic boundary value problems, elasticity, potential theory, conformal mapping, boundary element methods, free surface flows, etc. The use of the quadrature methods is demonstrated with numerical examples.

Sidi, A.↗

A parallelized elliptic solver for reacting flows

A modified Newton algorithm for the solution of nonlinear elliptic boundary value problems via finite discretization methods is presented. A serial implementation of this algorithm which has recently been applied successfully to the computation of an axisymmetric over-ventilated subsonic laminar methane-air jet diffusion flame is described. Parallel implementation issues and a complexity theory are presented. Included as well are actual performance data for model systems obtained on the Intel Hypercube and a discussion of its implications for modeling realistic systems.

Keyes, David E.↗

Reynolds stress closure in jet flows using wave models

A collection of papers is presented. The outline of this report is as follows. Chapter three contains a description of a weakly nonlinear turbulence model that was developed. An essential part of the application of such a closure scheme to general geometry jets is the solution of the local hydrodynamic stability equation for a given jet cross-section. Chapter four describes the conformal mapping schemes used to map such geometries onto a simple computational domain. Chapter five describes a solution of a stability problem for circular, elliptic, and rectangular geometries. In chapter six linear models for the shock shell structure in non-circular jets is given. The appendices contain reprints of papers also published during this study including the following topics: (1) instability of elliptic jets; (2) a technique for predicting the shock cell structure in non-circular jets using a vortex sheet model; and (3) the resonant interaction between twin supersonic jets.

Morris, Philip J.↗

Totally parallel multilevel algorithms for sparse elliptic systems

The fastest known algorithms for the solution of a large elliptic boundary value problem on a massively parallel hypercube all require O(log(n)) floating point operations and O(log(n)) distance-1 communications, if massively parallel is defined to mean a number of processors proportional to the size n of the problem. The Totally Parallel Multilevel Algorithm (TPMA) that has, as special cases, four of these fast algorithms is described. These four algorithms are Parallel Superconvergent Multigrid (PSMG), Robust Multigrid, the Fast Fourier Transformation (FFT) based Spectral Algorithm, and Parallel Cyclic Reduction. The algorithm TPMA, when described recursively, has four steps: (1) project to a collection of interlaced, coarser problems at the next lower level; (2) apply TPMA, recursively, to each of these lower level problems, solving directly at the lowest level; (3) interpolate these approximate solutions to the finer grid, and to verage them to form an approximate solution on this grid; and (4) refine this approximate solution with a defect-correction step, using a local approximate inverse. Choice of the projection operator (P), the interpolation operator (Q), and the smoother (S) determines the class of problems on which TPMA is most effective. There are special cases in which the first three steps produce an exact solution, and the smoother is not needed (e.g., constant coefficient operators).

Frederickson, Paul O.↗

Domain identification in impedance computed tomography by spline collocation method

A method for estimating an unknown domain in elliptic boundary value problems is considered. The problem is formulated as an inverse problem of integral equations of the second kind. A computational method is developed using a splice collocation scheme. The results can be applied to the inverse problem of impedance computed tomography (ICT) for image reconstruction.

Kojima, Fumio↗

A nonconforming multigrid method using conforming subspaces

For second-order elliptic boundary value problems, we develop a nonconforming multigrid method using the coarser-grid correction on the conforming finite element subspaces. The convergence proof with an arbitrary number of smoothing steps for nu-cycle is presented.

Lee, Chang Ock↗

Numerical Algorithms Based on Biorthogonal Wavelets

Wavelet bases are used to generate spaces of approximation for the resolution of bidimensional elliptic and parabolic problems. Under some specific hypotheses relating the properties of the wavelets to the order of the involved operators, it is shown that an approximate solution can be built. This approximation is then stable and converges towards the exact solution. It is designed such that fast algorithms involving biorthogonal multi resolution analyses can be used to resolve the corresponding numerical problems. Detailed algorithms are provided as well as the results of numerical tests on partial differential equations defined on the bidimensional torus.

Ponenti, Pj.↗

Numerical Algorithms Based on Biorthogonal Wavelets

Wavelet bases are used to generate spaces of approximation for the resolution of bidimensional elliptic and parabolic problems. Under some specific hypotheses relating the properties of the wavelets to the order of the involved operators, it is shown that an approximate solution can be built. This approximation is then stable and converges towards the exact solution. It is designed such that fast algorithms involving biorthogonal multi resolution analyses can be used to resolve the corresponding numerical problems. Detailed algorithms are provided as well as the results of numerical tests on partial differential equations defined on the bidimensional torus.

Ponenti, Pj.↗

Implementation of Hybrid V-Cycle Multilevel Methods for Mixed Finite Element Systems with Penalty

The goal of this paper is the implementation of hybrid V-cycle hierarchical multilevel methods for the indefinite discrete systems which arise when a mixed finite element approximation is used to solve elliptic boundary value problems. By introducing a penalty parameter, the perturbed indefinite system can be reduced to a symmetric positive definite system containing the small penalty parameter for the velocity unknown alone. We stabilize the hierarchical spatial decomposition approach proposed by Cai, Goldstein, and Pasciak for the reduced system. We demonstrate that the relative condition number of the preconditioner is bounded uniformly with respect to the penalty parameter, the number of levels and possible jumps of the coefficients as long as they occur only across the edges of the coarsest elements.

Lai, Chen-Yao G.↗

Convergence of a Substructuring Method with LaGrange Multipliers

We analyze the convergence of a substructuring iterative method with Lagrange multipliers, proposed recently by Farhat and Roux. The method decomposes finite element discretization of an elliptic boundary value problem into Neumann problems on the subdomains and a coarse problem for the subdomain nullspace components. For linear conforming elements and preconditioning by the Dirichlet problems on the subdomains, we prove the asymptotic bound on the condition number C(1 + log(H/h))(sup gamma), gamma = 2 or 3, where h is the characteristic element size and H is the subdomain size.

Mandel, Jan↗

Preconditioning Operators on Unstructured Grids

We consider systems of mesh equations that approximate elliptic boundary value problems on arbitrary (unstructured) quasi-uniform triangulations and propose a method for constructing optimal preconditioning operators. The method is based upon two approaches: (1) the fictitious space method, i.e., the reduction of the original problem to a problem in an auxiliary (fictitious) space, and (2) the multilevel decomposition method, i.e., the construction of preconditioners by decomposing functions on hierarchical meshes. The convergence rate of the corresponding iterative process with the preconditioner obtained is independent of the mesh step. The preconditioner has an optimal computational cost: the number of arithmetic operations required for its implementation is proportional to the number of unknowns in the problem. The construction of the preconditioning operators for three dimensional problems can be done in the same way.

Nepomnyaschikh, S. V.↗