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 145 records · Page 8

Multigrid one shot methods for optimal control problems: Infinite dimensional control

The multigrid one shot method for optimal control problems, governed by elliptic systems, is introduced for the infinite dimensional control space. ln this case, the control variable is a function whose discrete representation involves_an increasing number of variables with grid refinement. The minimization algorithm uses Lagrange multipliers to calculate sensitivity gradients. A preconditioned gradient descent algorithm is accelerated by a set of coarse grids. It optimizes for different scales in the representation of the control variable on different discretization levels. An analysis which reduces the problem to the boundary is introduced. It is used to approximate the two level asymptotic convergence rate, to determine the amplitude of the minimization steps, and the choice of a high pass filter to be used when necessary. The effectiveness of the method is demonstrated on a series of test problems. The new method enables the solutions of optimal control problems at the same cost of solving the corresponding analysis problems just a few times.

Arian, Eyal

Boundary conditions for the numerical solution of elliptic equations in exterior regions

Elliptic equations in exterior regions frequently require a boundary condition at infinity to ensure the well-posedness of the problem. Examples of practical applications include the Helmholtz equation and Laplace's equation. Computational procedures based on a direct discretization of the elliptic problem require the replacement of the condition on a finite artificial surface. Direct imposition of the condition at infinity along the finite boundary results in large errors. A sequence of boundary conditions is developed which provides increasingly accurate approximations to the problem in the infinite domain. Estimates of the error due to the finite boundary are obtained for several cases. Computations are presented which demonstrate the increased accuracy that can be obtained by the use of the higher order boundary conditions. The examples are based on a finite element formulation but finite difference methods can also be used.

Bayliss, A.

The elliptical crack subjected to nonuniform shear loading.

The equations of elasticity are solved for the problem of a flat elliptical crack which has nonuniform shear stresses applied to its surfaces. The shear stresses are prescribed independently in two directions on the crack surface and are expressed in the form of a third-degree polynomial. Mode-two and mode-three stress-intensity factors are presented in analytical and graphical form as functions of position along the crack border.

Smith, F. W.

Resonant oscillations of intermediate frequency in a stratified atmosphere.

A class of solutions to a model of forced oscillations in a rotating stratified atmospheric layer is derived and analyzed. The basic model is found to reduce to a boundary value problem with a second-order linear partial differential equation of the hyperbolic type for this range of forcing frequencies. The forced solutions are shown to exhibit resonances with the normal modes of oscillation of the layer. The characteristics of the resonant modes are analyzed in terms of mean tropospheric values of temperature, temperature lapse, wind speed, horizontal and vertical wind shears, latitude, and the frequency and horizontal wavelength of the forcing mechanism. These solutions are compared with solutions to the model for a different (subinertial) range of forcing frequencies. This comparison leads to an elliptic boundary value problem. The solutions in that case do not exhibit the same type of resonance and generally decay away from the region of forcing.

Thompson, O. E.

An adaptive and stability-promoting layerwise training approach for sparse deep neural network architecture

This work presents a two-stage adaptive framework for progressively developing deep neural network (DNN) architectures that generalize well for a given training data set. In the first stage, a layerwise training approach is adopted where a new layer is added each time and trained independently by freezing parameters in the previous layers. We impose desirable structures on the DNN by employing manifold regularization, sparsity regularization, and physics-informed terms. We introduce a ε – δ – stability-promoting concept as a desirable property for a learning algorithm and show that employing manifold regularization yields a ε – δ stability-promoting algorithm. Further, we also derive the necessary conditions for the trainability of a newly added layer and investigate the training saturation problem. In the second stage of the algorithm (post-processing), a sequence of shallow networks is employed to extract information from the residual produced in the first stage, thereby improving the prediction accuracy. Numerical investigations on prototype regression and classification problems demonstrate that the proposed approach can outperform fully connected DNNs of the same size. Moreover, by equipping the physics-informed neural network (PINN) with the proposed adaptive architecture strategy to solve partial differential equations, we numerically show that adaptive PINNs not only are superior to standard PINNs but also produce interpretable hidden layers with provable stability. As a result, we also apply our architecture design strategy to solve inverse problems governed by elliptic partial differential equations.

42 ENGINEERING

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