APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
From MaRDI portal
Publication:5112008
DOI10.1017/fms.2020.23zbMath1440.41006arXiv1802.00602OpenAlexW3103410914MaRDI QIDQ5112008
Publication date: 27 May 2020
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.00602
Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Multidimensional problems (41A63) Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25)
Related Items (8)
Near-Optimal Sampling Strategies for Multivariate Function Approximation on General Domains ⋮ An Adaptive Sampling and Domain Learning Strategy for Multivariate Function Approximation on Unknown Domains ⋮ Optimal sampling and Christoffel functions on general domains ⋮ Fast and stable approximation of analytic functions from equispaced samples via polynomial frames ⋮ Level set methods for stochastic discontinuity detection in nonlinear problems ⋮ Towards optimal sampling for learning sparse approximation in high dimensions ⋮ Frame approximation with bounded coefficients ⋮ Estimates of the asymptotic Nikolskii constants for spherical polynomials
Uses Software
Cites Work
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
- \(L^{\infty}\) estimation of tensor truncations
- On the stability and accuracy of least squares approximations
- On the numerical stability of Fourier extensions
- Analysis of discrete \(L^2\) projection on polynomial spaces with random evaluations
- Multivariate Markov-type and Nikolskii-type inequalities for polynomials associated with downward closed multi-index sets
- Breaking the curse of dimensionality in sparse polynomial approximation of parametric PDEs
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A spectral FC solver for the compressible Navier-Stokes equations in general domains. I: Explicit time-stepping
- Convergence rates of best \(N\)-term Galerkin approximations for a class of elliptic SPDEs
- User-friendly tail bounds for sums of random matrices
- Parameter selection and numerical approximation properties of Fourier extensions from fixed data
- High-order unconditionally stable FC-AD solvers for general smooth domains. II: Elliptic, parabolic and hyperbolic PDEs; theoretical considerations
- Multivariate modified Fourier series and application to boundary value problems
- A comparison of numerical algorithms for Fourier extension of the first, second, and third kinds
- Infinite-dimensional compressed sensing and function interpolation
- Remez-type and Nikol'skii-type inequalities: general relations and the hyperbolic cross polynomials
- Fourier embedded domain methods: Extending a function defined on an irregular region to a rectangle so that the extension is spatially periodic and \(C^{\infty}\)
- A spectral embedding method applied to the advection-diffusion equation
- Multivariate polynomial interpolation on lower sets
- High-order unconditionally stable FC-AD solvers for general smooth domains. I: Basic elements
- Weighted discrete least-squares polynomial approximation using randomized quadratures
- Accurate, high-order representation of complex three-dimensional surfaces via Fourier continuation analysis
- Uncertainty Quantification given Discontinuous Model Response and a Limited Number of Model Runs
- Simplex Stochastic Collocation with Random Sampling and Extrapolation for Nonhypercube Probability Spaces
- Active Subspaces
- A Christoffel function weighted least squares algorithm for collocation approximations
- Impossibility of Fast Stable Approximation of Analytic Functions from Equispaced Samples
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization
- Polynomial approximation via compressed sensing of high-dimensional functions on lower sets
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Optimal weighted least-squares methods
- Near-Optimal Sampling Strategies for Multivariate Function Approximation on General Domains
- DIMENSIONALITY REDUCTION FOR COMPLEX MODELS VIA BAYESIAN COMPRESSIVE SENSING
- Frames and Numerical Approximation
- Adaptive Approximation by Optimal Weighted Least-Squares Methods
- Approximation of high-dimensional parametric PDEs
- Discrete least squares polynomial approximation with random evaluations − application to parametric and stochastic elliptic PDEs
- Sparse grids
- Stochastic Collocation on Unstructured Multivariate Meshes
- STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
- Spectral Methods
- Optimal sampling rates for approximating analytic functions from pointwise samples
- An introduction to frames and Riesz bases
- Polynomial inequalities on measurable sets and their applications
This page was built for publication: APPROXIMATING SMOOTH, MULTIVARIATE FUNCTIONS ON IRREGULAR DOMAINS
