Weighted tensor product algorithms for linear multivariate problems
From MaRDI portal
Publication:1961054
DOI10.1006/jcom.1999.0512zbMath0939.65079OpenAlexW2041530119MaRDI QIDQ1961054
Grzegorz W. Wasilkowski, Henryk Woźniakowski
Publication date: 10 July 2000
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cfc4b904c951f72de0abf5567d17f72f66eee3f3
efficiencyapproximationHilbert spacesintegrationtractabilitypolynomial-time algorithmslinear multivariate problemsweighted tensor product algorithms
General theory of numerical analysis in abstract spaces (65J05) Algorithms for approximation of functions (65D15) Numerical quadrature and cubature formulas (65D32) Complexity and performance of numerical algorithms (65Y20)
Related Items (45)
A constructive approach to strong tractability using quasi-Monte Carlo algorithms ⋮ Applicability of Smolyak's algorithms to certain Banach spaces of multivariate functions. ⋮ Tractability of multivariate problems for standard and linear information in the worst case setting. I. ⋮ On tensor product approximation of analytic functions ⋮ Finite-order weights imply tractability of linear multivariate problems ⋮ Finite-order weights imply tractability of multivariate integration ⋮ Strong tractability of multivariate integration using quasi–Monte Carlo algorithms ⋮ Liberating the weights ⋮ Novel results for the anisotropic sparse grid quadrature ⋮ Tractability of multivariate approximation over a weighted unanchored Sobolev space ⋮ Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting ⋮ Complexity of weighted approximation over \(\mathbb{R}^d\) ⋮ The exact exponent of sparse grid quadratures in the weighted case ⋮ Multi-element probabilistic collocation method in high dimensions ⋮ Randomly shifted lattice rules for unbounded integrands ⋮ Tractability of \(\mathbb{L}_2\)-approximation in hybrid function spaces ⋮ Exponential convergence of an approximation problem for infinitely differentiable multivariate functions ⋮ EC-\((t_1,t_2)\)-tractability of approximation in weighted Korobov spaces in the worst case setting ⋮ Sparse grid quadrature on products of spheres ⋮ Some Results on the Complexity of Numerical Integration ⋮ Open problems for tractability of multivariate integration. ⋮ Tractability of approximating multivariate linear functionals ⋮ Liberating the dimension for \(L_2\)-approximation ⋮ On applicability of the sparse grid method in the worst case setting ⋮ Lattice rules for nonperiodic smooth integrands ⋮ Tractability of Multivariate Problems for Standard and Linear Information in the Worst Case Setting: Part II ⋮ A survey of average case complexity for linear multivariate problems ⋮ On weak tractability of the Clenshaw-Curtis Smolyak algorithm ⋮ Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces ⋮ Complexity of weighted approximation over \(\mathbb{R}\) ⋮ Approximation of additive random fields based on standard information: average case and probabilistic settings ⋮ Tractability of approximation in the weighted Korobov space in the worst-case setting -- a complete picture ⋮ On weak tractability of the Smolyak algorithm for approximation problems ⋮ Tractability of integration in non-periodic and periodic weighted tensor product Hilbert spaces ⋮ Dimension-wise integration of high-dimensional functions with applications to finance ⋮ Intractability results for integration and discrepancy ⋮ Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration ⋮ Optimal truncations for multivariate Fourier and Chebyshev series: mysteries of the hyperbolic cross. I: bivariate case ⋮ On the power of standard information for multivariate approximation in the worst case setting ⋮ Polynomial-time algorithms for multivariate linear problems with finite-order weights: Average case setting ⋮ Function integration, reconstruction and approximation using rank-$1$ lattices ⋮ On the approximation of smooth functions using generalized digital nets ⋮ Tractability of the Helmholtz equation with non-homogeneous Neumann boundary conditions: the relation to the \(L_{2}\)-approximation ⋮ The power of standard information for multivariate approximation in the randomized setting ⋮ Proof techniques in quasi-Monte Carlo theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- Tractability and strong tractability of linear multivariate problems
- Explicit cost bounds of algorithms for multivariate tensor product problems
- Tractability of tensor product linear operators
- On an interpolatory method for high dimensional integration
- High dimensional integration of smooth functions over cubes
- Theory of Reproducing Kernels
This page was built for publication: Weighted tensor product algorithms for linear multivariate problems
