Complexity of weighted approximation over R
This paper investigates approximation of univariate functions defined over the line. Assume that the \(r\)-th derivative of a function is bounded in a weighted \(L_w^p\) norm with a weight \(w\). Approximation algorithms use the values of a function and its derivatives up to the order \(r-1\). The worst case error of an algorithm is defined in a weighted \(L_u^q \) norm with a weight \(u\). This paper investigates the worst case (information) complexity of the weighted approximation problem, which is equal to the minimal number of functions and derivative evaluations needed to obtain the error \(\varepsilon\). This paper provides necessary and sufficient conditions in term of the weights \(w\) and \(u\), as well as the parameters \(r,p\), and \(q\) for the weighted approximation problem to have finite complexity. This paper also provides conditions which guarantee that complexity of weighted approximation is of the same order as the complexity of the classical approximation problem over a finite interval. Such necessary and sufficient conditions are also provided for a weighted integration problem since its complexity is equivalent to the complexity of the weighted approximation problem for \(q=1\).
- Complexity of weighted approximation over \(\mathbb{R}^d\)
- Worst case complexity of weighted approximation and integration over \(\mathbb{R}^d\)
- Average case complexity of weighted approximation and integration over \(\mathbb R_{+}\)
- Weighted approximation in \(\mathbb{C} \)
- scientific article; zbMATH DE number 1303668
- scientific article; zbMATH DE number 1790452
- Approximation by weighted polynomials in Rk
- APPROXIMATION IN WEIGHTEDLPSPACES
- scientific article; zbMATH DE number 278911
- scientific article; zbMATH DE number 989670
- Asymptotically optimal weighted numerical integration
- Deterministic and stochastic error bounds in numerical analysis
- Explicit cost bounds of algorithms for multivariate tensor product problems
- scientific article; zbMATH DE number 3877692 (Why is no real title available?)
- scientific article; zbMATH DE number 3827201 (Why is no real title available?)
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 3247704 (Why is no real title available?)
- Optimal integration of Lipschitz functions with a Gaussian weight
- Weighted tensor product algorithms for linear multivariate problems
- New averaging technique for approximating weighted integrals
- Complexity of weighted approximation over \(\mathbb{R}^d\)
- A new optimal algorithm for weighted approximation and integration over R
- Worst case complexity of weighted approximation and integration over \(\mathbb{R}^d\)
- On alternative quantization for doubly weighted approximation and integration over unbounded domains
- On efficient weighted integration via a change of variables
- Fast CBC construction of randomly shifted lattice rules achieving \(\mathcal{O}(n^{- 1 + \delta})\) convergence for unbounded integrands over \(\mathbb{R}^s\) in weighted spaces with POD weights
- Embeddings for infinite-dimensional integration and \(L_2\)-approximation with increasing smoothness
- On embeddings of weighted tensor product Hilbert spaces
- Tractability of approximation of \(\infty\)-variate functions with bounded mixed partial derivatives
- Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions
- An adaptive algorithm for weighted approximation of singular functions over \(\mathbb{R}\)
- On the choice of weights in a function space for quasi-Monte Carlo methods for a class of generalised response models in statistics
- The bit-complexity of finding nearly optimal quadrature rules for weighted integration
- Derandomization of the Euler scheme for scalar stochastic differential equations
- scientific article; zbMATH DE number 1790452 (Why is no real title available?)
- Quasi-Monte Carlo finite element methods for elliptic PDEs with lognormal random coefficients
- Multilevel Quasi-Monte Carlo methods for lognormal diffusion problems
- Liberating the dimension for function approximation: standard information
- Doubly weighted sharp Wirtinger inequalities on \(\mathbb{R}_+\)
- Average case complexity of weighted approximation and integration over \(\mathbb R_{+}\)
- Liberating the dimension
- The query complexity of estimating weighted averages
- Randomly shifted lattice rules for unbounded integrands
- Optimal algorithms for doubly weighted approximation of univariate functions
- Randomly shifted lattice rules with the optimal rate of convergence for unbounded integrands
This page was built for publication: Complexity of weighted approximation over \(\mathbb{R}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1976271)
