Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients

DOI10.1007/s00211-017-0878-6zbMath1380.41004arXiv1508.01821OpenAlexW1958282778MaRDI QIDQ2408938

Yanyan Li

Publication date: 10 October 2017

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.01821

zbMATH Keywords

polynomial approximationstochastic coefficientsparametrized PDEsdeterministic coefficients

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Approximation by polynomials (41A10) Asymptotic enumeration (05A16)

Related Items (21)

On tensor product approximation of analytic functions ⋮ A Multilevel Stochastic Collocation Method for Partial Differential Equations with Random Input Data ⋮ Accelerating Stochastic Collocation Methods for Partial Differential Equations with Random Input Data ⋮ An asymptotically compatible probabilistic collocation method for randomly heterogeneous nonlocal problems ⋮ Infinite-dimensional compressed sensing and function interpolation ⋮ Polynomial approximation of anisotropic analytic functions of several variables ⋮ On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals ⋮ Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations ⋮ Sparse polynomial approximations for affine parametric saddle point problems ⋮ Analysis of multivariate Gegenbauer approximation in the hypercube ⋮ Reduced order modeling for elliptic problems with high contrast diffusion coefficients ⋮ A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ A mixed ℓ₁ regularization approach for sparse simultaneous approximation of parameterized PDEs ⋮ The Gap between Theory and Practice in Function Approximation with Deep Neural Networks ⋮ An improved discrete least-squares/reduced-basis method for parameterized elliptic PDEs ⋮ GenMod: a generative modeling approach for spectral representation of PDEs with random inputs ⋮ Reproducing Kernel Hilbert Spaces for Parametric Partial Differential Equations ⋮ Quasi-Monte Carlo and Multilevel Monte Carlo Methods for Computing Posterior Expectations in Elliptic Inverse Problems ⋮ Nonlinear approximation spaces for inverse problems ⋮ Exponential ReLU DNN expression of holomorphic maps in high dimension

Uses Software

• LattE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of quasi-optimal stochastic Galerkin methods for a class of PDES with random coefficients
• Inequalities and bounds for the incomplete gamma function
• Sparse adaptive approximation of high dimensional parametric initial value problems
• Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
• Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
• Multivariate simultaneous approximation
• Reduced basis method for linear elasticity problems with many parameters
• Effective lattice point counting in rational convex polytopes
• Sparse adaptive Taylor approximation algorithms for parametric and stochastic elliptic PDEs
• Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs
• A prioriconvergence of the Greedy algorithm for the parametrized reduced basis method
• Sparse Tensor Galerkin Discretization of Parametric and Random Parabolic PDEs---Analytic Regularity and Generalized Polynomial Chaos Approximation
• Sparse Tensor Discretization of Elliptic sPDEs
• ANALYTIC REGULARITY AND POLYNOMIAL APPROXIMATION OF PARAMETRIC AND STOCHASTIC ELLIPTIC PDE'S
• ON THE OPTIMAL POLYNOMIAL APPROXIMATION OF STOCHASTIC PDES BY GALERKIN AND COLLOCATION METHODS
• Computing the Continuous Discretely
• Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients
• A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
• On some properties of the Gamma function
• Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
• Convex and Discrete Geometry
• A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data

This page was built for publication: Analysis of quasi-optimal polynomial approximations for parameterized PDEs with deterministic and stochastic coefficients