Weighted tensor product algorithms for linear multivariate problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1083138
- Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals
- Explicit cost bounds of algorithms for multivariate tensor product problems
- Approximate decoupling of multivariate polynomials using weighted tensor decomposition.
- On the tractability of linear tensor product problems in the worst case
- scientific article; zbMATH DE number 1790456
- Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
- Linearized methods for tensor complementarity problems
- Krylov subspace methods for linear systems with tensor product structure
- Numerical tensor techniques for multidimensional convolution products
Cites work
- Explicit cost bounds of algorithms for multivariate tensor product problems
- High dimensional integration of smooth functions over cubes
- scientific article; zbMATH DE number 3671573 (Why is no real title available?)
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 1222809 (Why is no real title available?)
- scientific article; zbMATH DE number 1246224 (Why is no real title available?)
- scientific article; zbMATH DE number 1083138 (Why is no real title available?)
- scientific article; zbMATH DE number 3321507 (Why is no real title available?)
- On an interpolatory method for high dimensional integration
- Theory of Reproducing Kernels
- Tractability and strong tractability of linear multivariate problems
- Tractability of tensor product linear operators
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
Cited in
(49)- 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
- 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
- Complexity of weighted approximation over \(\mathbb{R}^d\)
- The exact exponent of sparse grid quadratures in the weighted case
- Open problems for tractability of multivariate integration.
- Novel results for the anisotropic sparse grid quadrature
- Tractability of \(\mathbb{L}_2\)-approximation in hybrid function spaces
- Exponential convergence of an approximation problem for infinitely differentiable multivariate functions
- A constructive approach to strong tractability using quasi-Monte Carlo algorithms
- Applicability of Smolyak's algorithms to certain Banach spaces of multivariate functions.
- Finite-order weights imply tractability of linear multivariate problems
- Finite-order weights imply tractability of multivariate integration
- Liberating the weights
- Complexity of weighted approximation over \(\mathbb{R}\)
- EC-(t₁,t₂)-tractability of approximation in weighted Korobov spaces in the worst case setting
- 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
- 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
- Proof techniques in quasi-Monte Carlo theory
- On applicability of the sparse grid method in the worst case setting
- Lattice rules for nonperiodic smooth integrands
- On weak tractability of the Clenshaw-Curtis Smolyak algorithm
- Polynomial-time algorithms for multivariate linear problems with finite-order weights: worst case setting
- Tractability of multivariate problems for standard and linear information in the worst case setting. I.
- On tensor product approximation of analytic functions
- Some results on the complexity of numerical integration
- The power of standard information for multivariate approximation in the randomized setting
- An application of tensor products of functionals in problems of numerical integration
- Multi-way set enumeration in weight tensors
- Liberating the dimension for \(L_2\)-approximation
- Tractability of multivariate problems for standard and linear information in the worst case setting. II
- A survey of average case complexity for linear multivariate problems
- Strong tractability of multivariate integration using quasi–Monte Carlo algorithms
- Approximation of additive random fields based on standard information: average case and probabilistic settings
- Function integration, reconstruction and approximation using rank-\(1\) lattices
- Intractability results for integration and discrepancy
- Tractability of approximating multivariate linear functionals
- Selected aspects of tractability analysis
- Tractability of integration in non-periodic and periodic weighted tensor product Hilbert spaces
- Dimension-wise integration of high-dimensional functions with applications to finance
- Tractability of multivariate approximation over a weighted unanchored Sobolev space
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
- Multi-element probabilistic collocation method in high dimensions
- Randomly shifted lattice rules for unbounded integrands
- Sparse grid quadrature on products of spheres
- Multivariate \(L_{\infty}\) approximation in the worst case setting over reproducing kernel Hilbert spaces
This page was built for publication: Weighted tensor product algorithms for linear multivariate problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1961054)
