Sparse polynomial approximation of parametric elliptic PDEs. Part I: affine coefficients
DOI10.1051/M2AN/2016045zbMATH Open1365.41003arXiv1509.07045OpenAlexW2963062618MaRDI QIDQ2963771FDOQ2963771
Authors: Markus Bachmayr, Albert Cohen, Giovanni Migliorati
Publication date: 21 February 2017
Published in: ESAIM: Mathematical Modelling and Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.07045
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
waveletsLegendre polynomialsparametric PDEsTaylor coefficients\(n\)-term approximationaffine coefficients
Numerical methods for wavelets (65T60) Multidimensional problems (41A63) Approximation by polynomials (41A10) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58) Error bounds for boundary value problems involving PDEs (65N15)
Cited In (42)
- Sparse-grid polynomial interpolation approximation and integration for parametric and stochastic elliptic PDEs with lognormal inputs
- A sparse FFT approach for ODE with random coefficients
- Sparse polynomial approximation in positive order Sobolev spaces with bounded mixed derivatives and applications to elliptic problems with random loading
- A Monte Carlo approach to computing stiffness matrices arising in polynomial chaos approximations
- Domain Uncertainty Quantification in Computational Electromagnetics
- Multivariate approximation in downward closed polynomial spaces
- On the decay rate of the singular values of bivariate functions
- Collocation approximation by deep neural ReLU networks for parametric and stochastic PDEs with lognormal inputs
- Sparse polynomial approximations for affine parametric saddle point problems
- Computation and learning in high dimensions. Abstracts from the workshop held August 1--7, 2021 (hybrid meeting)
- Polynomial approximation of anisotropic analytic functions of several variables
- Adaptive stochastic Galerkin FEM with hierarchical tensor representations
- Convergence rates of high dimensional Smolyak quadrature
- Stable splittings of Hilbert spaces of functions of infinitely many variables
- Fully discrete approximation of parametric and stochastic elliptic PDEs
- Linear collective collocation approximation for parametric and stochastic elliptic PDEs
- Analytic regularity and polynomial approximation of parametric and stochastic elliptic PDE's
- Sparse polynomial approximation of parametric elliptic PDEs. II: Lognormal coefficients.
- Deep ReLU neural network approximation in Bochner spaces and applications to parametric PDEs
- Convergence of Sparse Collocation for Functions of Countably Many Gaussian Random Variables (with Application to Elliptic PDEs)
- On quantitative stability in infinite-dimensional optimization under uncertainty
- Analyticity of parametric elliptic eigenvalue problems and applications to quasi-Monte Carlo methods
- Intrusive generalized polynomial chaos with asynchronous time integration for the solution of the unsteady Navier-Stokes equations
- Quasi--Monte Carlo Integration for Affine-Parametric, Elliptic PDEs: Local Supports and Product Weights
- Representations of Gaussian random fields and approximation of elliptic PDEs with lognormal coefficients
- Reduced order modeling for elliptic problems with high contrast diffusion coefficients
- The uniform sparse FFT with application to PDEs with random coefficients
- Uncertainty quantification for low-frequency, time-harmonic Maxwell equations with stochastic conductivity models
- Constructing QMC Finite Element Methods for Elliptic PDEs with Random Coefficients by a Reduced CBC Construction
- Adaptive low-rank approximations for operator equations: Accuracy control and computational complexity
- MDFEM: multivariate decomposition finite element method for elliptic PDEs with uniform random diffusion coefficients using higher-order QMC and FEM
- Nonlinear methods for model reduction
- Uncertainty Quantification for Spectral Fractional Diffusion: Sparsity Analysis of Parametric Solutions
- Sparse polynomial chaos expansions using variational relevance vector machines
- A theoretical analysis of deep neural networks and parametric PDEs
- An adaptive stochastic Galerkin method based on multilevel expansions of random fields: Convergence and optimality
- Exploiting locality in sparse polynomial approximation of parametric elliptic PDEs and application to parameterized domains
- Sparse Compression of Expected Solution Operators
- Reduced Basis Greedy Selection Using Random Training Sets
- Multilevel QMC with product weights for affine-parametric, elliptic PDEs
- Deep learning in high dimension: neural network expression rates for generalized polynomial chaos expansions in UQ
- On the Convergence of Adaptive Stochastic Collocation for Elliptic Partial Differential Equations with Affine Diffusion
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)