Optimal approximation of infinite-dimensional holomorphic functions

DOI10.1007/s10092-023-00565-xarXiv2305.18642OpenAlexW4391305011WikidataQ129245475 ScholiaQ129245475MaRDI QIDQ6151536

Nick C. Dexter, Ben Adcock, Sebastián Moraga

Publication date: 11 March 2024

Published in: Calcolo (Search for Journal in Brave)

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

zbMATH Keywords

Banach spacesholomorphic functionsinformation complexityhigh-dimensional approximationadaptive samplingGelfand and Kolmogorov widths

Mathematics Subject Classification ID

Multidimensional problems (41A63) Complexity and performance of numerical algorithms (65Y20) Numerical approximation of high-dimensional functions; sparse grids (65D40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A mathematical introduction to compressive sensing
• 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
• The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
• Recovery of high order accuracy in radial basis function approximations of discontinuous problems
• Approximation of mixed order Sobolev functions on the \(d\)-torus: asymptotics, preasymptotics, and \(d\)-dependence
• Tractability of multivariate problems. Volume I: Linear information
• Tractability of multivariate problems. Volume II: Standard information for functionals.
• Deterministic and stochastic error bounds in numerical analysis
• Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
• Optimal nonlinear approximation
• Analytic regularity and collocation approximation for elliptic PDEs with random domain deformations
• On optimal recovery in \(L_2\)
• Constructive deep ReLU neural network approximation
• Exponential ReLU DNN expression of holomorphic maps in high dimension
• Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing
• Analytic regularity and nonlinear approximation of a class of parametric semilinear elliptic PDEs
• REGULARITY AND GENERALIZED POLYNOMIAL CHAOS APPROXIMATION OF PARAMETRIC AND RANDOM SECOND-ORDER HYPERBOLIC PARTIAL DIFFERENTIAL EQUATIONS
• Introduction to Uncertainty Quantification
• Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations
• Kolmogorov widths and low-rank approximations of parametric elliptic PDEs
• Sparse Tensor Discretization of Elliptic sPDEs
• Sparse tensor discretizations of high-dimensional parametric and stochastic PDEs
• ON THE OPTIMAL POLYNOMIAL APPROXIMATION OF STOCHASTIC PDES BY GALERKIN AND COLLOCATION METHODS
• Spectral Methods for Uncertainty Quantification
• Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
• Shape Holomorphy of the Stationary Navier--Stokes Equations
• Deep learning in high dimension: Neural network expression rates for generalized polynomial chaos expansions in UQ
• Stochastic finite element methods for partial differential equations with random input data
• Domain Uncertainty Quantification in Computational Electromagnetics
• Sparse Polynomial Approximation of High-Dimensional Functions
• 15 Deep learning in high dimension: ReLU neural network expression for Bayesian PDE inversion
• Better Approximations of High Dimensional Smooth Functions by Deep Neural Networks with Rectified Power Units
• A mixed ℓ₁ regularization approach for sparse simultaneous approximation of parameterized PDEs
• Approximation of high-dimensional parametric PDEs
• Deep ReLU neural networks in high-dimensional approximation

This page was built for publication: Optimal approximation of infinite-dimensional holomorphic functions