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

Gaussian processes with built-in dimensionality reduction: Applications to high-dimensional uncertainty propagation

Uncertainty quantification (UQ) tasks, such as model calibration, uncertainty propagation, and optimization under uncertainty, typically require several thousand evaluations of the underlying computer codes. To cope with the cost of simulations, one replaces the real response surface with a cheap surrogate based, e.g., on polynomial chaos expansions, neural networks, support vector machines, or Gaussian processes (GP). However, the number of simulations required to learn a generic multivariate response grows exponentially as the input dimension increases. This curse of dimensionality can only be addressed, if the response exhibits some special structure that can be discovered and exploited. A wide range of physical responses exhibit a special structure known as an active subspace (AS). An AS is a linear manifold of the stochastic space characterized by maximal response variation. The idea is that one should first identify this low dimensional manifold, project the high-dimensional input onto it, and then link the projection to the output. If the dimensionality of the AS is low enough, then learning the link function is a much easier problem than the original problem of learning a high-dimensional function. The classic approach to discovering the AS requires gradient information, a fact that severely limits its applicability. Furthermore, and partly because of its reliance to gradients, it is not able to handle noisy observations. The latter is an essential trait if one wants to be able to propagate uncertainty through stochastic simulators, e.g., through molecular dynamics codes. In this work, we develop a probabilistic version of AS which is gradient-free and robust to observational noise. Our approach relies on a novel Gaussian process regression with built-in dimensionality reduction. In particular, the AS is represented as an orthogonal projection matrix that serves as yet another covariance function hyper-parameter to be estimated from the data. To train the model, we design a two-step maximum likelihood optimization procedure that ensures the orthogonality of the projection matrix by exploiting recent results on the Stiefel manifold, i.e., the manifold of matrices with orthogonal columns. The additional benefit of our probabilistic formulation, is that it allows us to select the dimensionality of the AS via the Bayesian information criterion. We validate our approach by showing that it can discover the right AS in synthetic examples without gradient information using both noiseless and noisy observations. We demonstrate that our method is able to discover the same AS as the classical approach in a challenging one-hundred-dimensional problem involving an elliptic stochastic partial differential equation with random conductivity. Finally, we use our approach to study the effect of geometric and material uncertainties in the propagation of solitary waves in a one dimensional granular system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Discontinuous Skeletal Gradient Discretisation methods on polytopal meshes

Here, in this work we develop arbitrary-order Discontinuous Skeletal Gradient Discretisations (DSGD) on general polytopal meshes. Discontinuous Skeletal refers to the fact that the globally coupled unknowns are broken polynomials on the mesh skeleton. The key ingredient is a high-order gradient reconstruction composed of two terms: (i) a consistent contribution obtained mimicking an integration by parts formula inside each element and (ii) a stabilising term for which sufficient design conditions are provided. An example of stabilisation that satisfies the design conditions is proposed based on a local lifting of high-order residuals on a Raviart–Thomas–Nédélec subspace. We prove that the novel DSGDs satisfy coercivity, consistency, limit-conformity, and compactness requirements that ensure convergence for a variety of elliptic and parabolic problems. Lastly, links with Hybrid High-Order, non-conforming Mimetic Finite Difference and non-conforming Virtual Element methods are also studied. Numerical examples complete the exposition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Knot undulator to generate linearly polarized photons with low on-axis power density

Heat load on beamline optics is a serious obstacle for devices designed to generate pure linearly polarized photons in third generation synchrotron radiation facilities. For permanent magnet undulators, this problem can be overcome by implementing a figure-eight design configuration. As yet there has been no good method to tackle this problem for electromagnetic elliptical undulators. Here, a novel design and operational mode is suggested, which can generate pure linearly polarized photons with very low on-axis heat load. Additionally, the minimum photon energy capability of linearly polarized photons can be significantly extended by this method.

43 PARTICLE ACCELERATORS↗

Galerkin Spectral Method for the 2D Solitary Waves of Boussinesq Paradigm Equation

We consider the 2D stationary propagating solitary waves of the so-called Boussinesq Paradigm equation. The fourth- order elliptic boundary value problem on infinite interval is solved by a Galerkin spectral method. An iterative procedure based on artificial time ('false transients') and operator splitting is used. Results are obtained for the shapes of the solitary waves for different values of the dispersion parameters for both subcritical and supercritical phase speeds.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

On the solution of elliptic partial differential equations on regions with corners

In this paper we investigate the solution of boundary value problems on polygonal domains for elliptic partial differential equations. We observe that when the problems are formulated as the boundary integral equations of classical potential theory, the solutions are representable by series of elementary functions. In addition to being analytically perspicuous, the resulting expressions lend themselves to the construction of accurate and efficient numerical algorithms. The results are illustrated by a number of numerical examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On Solutions to the Schwarz Problem in a Disk in the Three-Dimensional Case

We consider the Schwarz problem for first order elliptic systems in the plane. We obtain the conditions on three– and two-dimensional matrices J admitting nondiagonal Jordan form under which a solution to the Schwarz problem in an arbitrary disk exists and is unique in Hölder classes. We describe an algorithm for constructing the solution. Bibliography: 5 titles.

97 MATHEMATICS AND COMPUTING↗

Application of stochastic Galerkin FEM to the complete electrode model of electrical impedance tomography

The aim of electrical impedance tomography is to determine the internal conductivity distribution of some physical body from boundary measurements of current and voltage. The most accurate forward model for impedance tomography is the complete electrode model, which consists of the conductivity equation coupled with boundary conditions that take into account the electrode shapes and the contact resistances at the corresponding interfaces. If the reconstruction task of impedance tomography is recast as a Bayesian inference problem, it is essential to be able to solve the complete electrode model forward problem with the conductivity and the contact resistances treated as a random field and random variables, respectively. In this work, we apply a stochastic Galerkin finite element method to the ensuing elliptic stochastic boundary value problem and compare the results with Monte Carlo simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Finite elements modelling of scattering problems for flexural waves in thin plates: Application to elliptic invisibility cloaks, rotators and the mirage effect

We propose a finite elements algorithm to solve a fourth order partial differential equation governing the propagation of time-harmonic bending waves in thin elastic plates. Specially designed perfectly matched layers are implemented to deal with the infinite extent of the plates. These are deduced from a geometric transform in the biharmonic equation. To numerically illustrate the power of elastodynamic transformations, we analyze the elastic response of an elliptic invisibility cloak surrounding a clamped obstacle in the presence of a cylindrical excitation i.e. a concentrated point force. Elliptic cloaking for flexural waves involves a density and an orthotropic Young's modulus which depend on the radial and azimuthal positions, as deduced from a coordinates transformation for circular cloaks in the spirit of Pendry et al. [Science 312, 1780 (2006)], but with a further stretch of a coordinate axis. We find that a wave radiated by a concentrated point force located a couple of wavelengths away from the cloak is almost unperturbed in magnitude and in phase. However, when the point force lies within the coating, it seems to radiate from a shifted location. Finally, we emphasize the versatility of transformation elastodynamics with the design of an elliptic cloak which rotates the wavevector of a flexural wave within its core.

97 MATHEMATICS AND COMPUTING↗

Algebraic multigrid preconditioning of the Hessian in optimization constrained by a partial differential equation

Summary We construct an algebraic multigrid (AMG) based preconditioner for the reduced Hessian of a linear‐quadratic optimization problem constrained by an elliptic partial differential equation. While the preconditioner generalizes a geometric multigrid preconditioner introduced in earlier works, its construction relies entirely on a standard AMG infrastructure built for solving the forward elliptic equation, thus allowing for it to be implemented using a variety of AMG methods and standard packages. Our analysis establishes a clear connection between the quality of the preconditioner and the AMG method used. The proposed strategy has a broad and robust applicability to problems with unstructured grids, complex geometry, and varying coefficients. The method is implemented using the Hypre package and several numerical examples are presented.

Barker, Andrew T.↗

A weighted ℓ{sub 1}-minimization approach for sparse polynomial chaos expansions

This work proposes a method for sparse polynomial chaos (PC) approximation of high-dimensional stochastic functions based on non-adapted random sampling. We modify the standard ℓ{sub 1}-minimization algorithm, originally proposed in the context of compressive sampling, using a priori information about the decay of the PC coefficients, when available, and refer to the resulting algorithm as weightedℓ{sub 1}-minimization. We provide conditions under which we may guarantee recovery using this weighted scheme. Numerical tests are used to compare the weighted and non-weighted methods for the recovery of solutions to two differential equations with high-dimensional random inputs: a boundary value problem with a random elliptic operator and a 2-D thermally driven cavity flow with random boundary condition.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal-Order Preconditioners for Linear Systems Arising in the Semismooth Newton Solution of a Class of Control-Constrained Problems

We present a new multigrid preconditioner for the linear systems arising in the semismooth Newton method solution of certain control-constrained, quadratic distributed optimal control problems. Using a piecewise constant discretization of the control space, each semismooth Newton iteration essentially requires inverting a principal submatrix of the matrix entering the normal equations of the associated unconstrained optimal control problem, the rows (and columns) of the submatrix representing the constraints deemed inactive at the current iteration. Previously developed multigrid preconditioners for the aforementioned submatrices were based on constructing a sequence of conforming coarser spaces and proved to be of suboptimal quality for the class of problems considered. Instead, the multigrid preconditioner introduced in this work uses nonconforming coarse spaces, and it is shown that, under reasonable geometric assumptions on the constraints that are deemed inactive, the preconditioner approximates the inverse of the desired submatrix to optimal order. The preconditioner is tested numerically on a classical elliptic-constrained optimal control problem and further on a constrained image-deblurring problem.

97 MATHEMATICS AND COMPUTING↗

Accurate gradient approximation for complex interface problems in 3D by an improved coupling interface method

Most elliptic interface solvers become complicated for complex interface problems at those “exceptional points” where there are not enough neighboring interior points for high order interpolation. Such complication increases especially in three dimensions. Usually, the solvers are thus reduced to low order accuracy. In this paper, we classify these exceptional points and propose two recipes to maintain order of accuracy there, aiming at improving the previous coupling interface method [26]. Yet the idea is also applicable to other interface solvers. The main idea is to have at least first order approximations for second order derivatives at those exceptional points. Recipe 1 is to use the finite difference approximation for the second order derivatives at a nearby interior grid point, whenever this is possible. Recipe 2 is to flip domain signatures and introduce a ghost state so that a second-order method can be applied. This ghost state is a smooth extension of the solution at the exceptional point from the other side of the interface. The original state is recovered by a post-processing using nearby states and jump conditions. The choice of recipes is determined by a classification scheme of the exceptional points. The method renders the solution and its gradient uniformly second-order accurate in the entire computed domain. Numerical examples are provided to illustrate the second order accuracy of the presently proposed method in approximating the gradients of the original states for some complex interfaces which we had tested previous in two and three dimensions, and a real molecule ( (1D63)) which is double-helix shape and composed of hundreds of atoms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multigrid solution of a distributed optimal control problem constrained by the Stokes equations

We construct multigrid preconditioners to accelerate the solution process of a linear-quadratic optimal control problem constrained by the Stokes system. The first order optimality conditions of the control problem form a linear system (the KKT system) connecting the state, adjoint, and control variables. Our approach is to eliminate the state and adjoint variables by essentially solving two Stokes systems, and to construct efficient multigrid preconditioners for the Schur-complement of the block associated with the state and adjoint variables. These multigrid preconditioners are shown to be of optimal order with respect to the convergence properties of the discrete methods used to solve the Stokes system. In particular, the number of conjugate gradient iterations is shown to decrease as the resolution increases, a feature shared by similar multigrid preconditioners for elliptic constrained optimal control problems.

97 MATHEMATICS AND COMPUTING↗

High-performance modeling acoustic and elastic waves using the parallel Dichotomy Algorithm

A high-performance parallel algorithm is proposed for modeling the propagation of acoustic and elastic waves in inhomogeneous media. An initial boundary-value problem is replaced by a series of boundary-value problems for a constant elliptic operator and different right-hand sides via the integral Laguerre transform. It is proposed to solve difference equations by the conjugate gradient method for acoustic equations and by the GMRES(k) method for modeling elastic waves. A preconditioning operator was the Laplace operator that is inverted using the variable separation method. The novelty of the proposed algorithm is using the Dichotomy Algorithm , which was designed for solving a series of tridiagonal systems of linear equations, in the context of the preconditioning operator inversion. Via considering analytical solutions, it is shown that modeling wave processes for long instants of time requires high-resolution meshes. The proposed parallel fine-mesh algorithm enabled to solve real application seismic problems in acceptable time and with high accuracy. By solving model problems, it is demonstrated that the considered parallel algorithm possesses high performance and efficiency over a wide range of the number of processors (from 2 to 8192).

97 MATHEMATICS AND COMPUTING↗