Applicability of Smolyak's algorithms to certain Banach spaces of multivariate functions.
The Smolyak algorithm [\textit{S. A. Smolyak}, Dokl. Akad. Nauk SSSR 148, 1042--1045 (1963; Zbl 0202.39901)] finds approximants for a linear tensor product operator \(S=\bigotimes_{k=1}^d S_k: \bigotimes_{k=1}^d F_k \to \bigotimes_{k=1}^d G_k\) based on algorithms approximating the linear operators \(S_k: F_k\to G_k\) where \(F_k\) and \(G_k\) are functional Banach spaces. It was originally designed to approximate linear functionals of smooth multivariate functions like integrals. Here it is shown that the algorithm can also be applied to approximation problems on function classes like Sobolev spaces or even Hilbert spaces. For the applicability of the algorithms, it is essential that \(\| T_1\otimes~\cdots~\otimes T_d\| \leq\prod_{k=1}^d \| T_k\| \). It is proved in this paper that this norm inequality does hold for certain Banach spaces when appropriate norms and the ``natural tensor products are used. Applications in multivariate integration are given for which estimates for the approximation error are computed.
- Smolyak's algorithm for integration and L₁-approximation of multivariate functions with bounded mixed derivatives of second order
- Smolyak's algorithm for weighted \(L_1\)-approximation of multivariate functions with bounded \(r\)th mixed derivatives over \(\mathbb R^d\)
- On weak tractability of the Smolyak algorithm for approximation problems
- Tensor products of functionals and their application
- Fast calculation of coefficients in the Smolyak algorithm
- Average case complexity of linear multivariate problems. I: Theory
- Completely random measures
- Explicit cost bounds of algorithms for multivariate tensor product problems
- High dimensional integration of smooth functions over cubes
- scientific article; zbMATH DE number 3124239 (Why is no real title available?)
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 3321507 (Why is no real title available?)
- scientific article; zbMATH DE number 3336209 (Why is no real title available?)
- On approximate recovery of functions with bounded mixed derivative
- On rings of operators
- Weighted tensor product algorithms for linear multivariate problems
- On the power of standard information for multivariate approximation in the worst case setting
- Worst case complexity of multivariate Feynman--Kac path integration
- On weak tractability of the Smolyak algorithm for approximation problems
- On applicability of the sparse grid method in the worst case setting
- Tractability of approximation of \(\infty\)-variate functions with bounded mixed partial derivatives
- On the complexity of parabolic initial-value problems with variable drift
- Smolyak's algorithm for weighted \(L_1\)-approximation of multivariate functions with bounded \(r\)th mixed derivatives over \(\mathbb R^d\)
- A survey of average case complexity for linear multivariate problems
- Adaptive Smolyak Pseudospectral Approximations
- Fast calculation of coefficients in the Smolyak algorithm
- Tensor products of functionals and their application
- Smolyak's algorithm for integration and L₁-approximation of multivariate functions with bounded mixed derivatives of second order
This page was built for publication: Applicability of Smolyak's algorithms to certain Banach spaces of multivariate functions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1872634)
