Sparse polynomial approximation of parametric elliptic PDEs. Part I: affine coefficients
From MaRDI portal
Publication:2963771
Abstract: We consider elliptic partial differential equations with diffusion coefficients that depend affinely on countably many parameters. We study the summability properties of polynomial expansions of the function mapping parameter values to solutions of the PDE, considering both Taylor and Legendre series. Our results considerably improve on previously known estimates of this type, in particular taking into account structural features of the affine parametrization of the coefficient. Moreover, the results carry over to more general Jacobi polynomial expansions. We demonstrate that the new bounds are sharp in certain model cases and we illustrate them by numerical experiments.
Recommendations
- Bernstein theorems for elliptic equations
- Fully discrete approximation of parametric and stochastic elliptic PDEs
- Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients
- Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs
- Linear collective collocation approximation for parametric and stochastic elliptic PDEs
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Piecewise polynomial interpolation in Muckenhoupt weighted Sobolev spaces and applications
- A priori convergence theory for reduced-basis approximations of single-parameter elliptic partial differential equations
- Approximation by polynomials of given length
- Order of the best approximation of partial differential operators
Cited in
(42)- Exploiting locality in sparse polynomial approximation of parametric elliptic PDEs and application to parameterized domains
- Collocation approximation by deep neural ReLU networks for parametric and stochastic PDEs with lognormal inputs
- Nonlinear methods for model reduction
- Domain uncertainty quantification in computational electromagnetics
- Sparse Compression of Expected Solution Operators
- On quantitative stability in infinite-dimensional optimization under uncertainty
- Multilevel QMC with product weights for affine-parametric, elliptic PDEs
- Deep ReLU neural network approximation in Bochner spaces and applications to parametric PDEs
- Analyticity of parametric elliptic eigenvalue problems and applications to quasi-Monte Carlo methods
- Adaptive low-rank approximations for operator equations: accuracy control and computational complexity
- Constructing QMC Finite Element Methods for Elliptic PDEs with Random Coefficients by a Reduced CBC Construction
- Sparse polynomial chaos expansions using variational relevance vector machines
- Quasi--Monte Carlo Integration for Affine-Parametric, Elliptic PDEs: Local Supports and Product Weights
- Intrusive generalized polynomial chaos with asynchronous time integration for the solution of the unsteady Navier-Stokes equations
- Sparse polynomial approximations for affine parametric saddle point problems
- Multivariate approximation in downward closed polynomial spaces
- Uncertainty Quantification for Spectral Fractional Diffusion: Sparsity Analysis of Parametric Solutions
- Sparse polynomial approximation in positive order Sobolev spaces with bounded mixed derivatives and applications to elliptic problems with random loading
- Representations of Gaussian random fields and approximation of elliptic PDEs with lognormal coefficients
- Stable splittings of Hilbert spaces of functions of infinitely many variables
- Reduced Basis Greedy Selection Using Random Training Sets
- Polynomial approximation of anisotropic analytic functions of several variables
- An adaptive stochastic Galerkin method based on multilevel expansions of random fields: convergence and optimality
- A theoretical analysis of deep neural networks and parametric PDEs
- Deep learning in high dimension: neural network expression rates for generalized polynomial chaos expansions in UQ
- The uniform sparse FFT with application to PDEs with random coefficients
- Fully discrete approximation of parametric and stochastic elliptic PDEs
- Convergence rates of high dimensional Smolyak quadrature
- Computation and learning in high dimensions. Abstracts from the workshop held August 1--7, 2021 (hybrid meeting)
- Convergence of Sparse Collocation for Functions of Countably Many Gaussian Random Variables (with Application to Elliptic PDEs)
- A sparse FFT approach for ODE with random coefficients
- Sparse-grid polynomial interpolation approximation and integration for parametric and stochastic elliptic PDEs with lognormal inputs
- On the convergence of adaptive stochastic collocation for elliptic partial differential equations with affine diffusion
- Linear collective collocation approximation for parametric and stochastic elliptic PDEs
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Adaptive stochastic Galerkin FEM with hierarchical tensor representations
- On the decay rate of the singular values of bivariate functions
- Uncertainty quantification for low-frequency, time-harmonic Maxwell equations with stochastic conductivity models
- Reduced order modeling for elliptic problems with high contrast diffusion coefficients
- A Monte Carlo approach to computing stiffness matrices arising in polynomial chaos approximations
- MDFEM: multivariate decomposition finite element method for elliptic PDEs with uniform random diffusion coefficients using higher-order QMC and FEM
- Sparse polynomial approximation of parametric elliptic PDEs. II: Lognormal coefficients.
This page was built for publication: Sparse polynomial approximation of parametric elliptic PDEs. Part I: affine coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963771)
