Weighted tensor product algorithms for linear multivariate problems
type: Item
instance of: scholarly article
title: Weighted tensor product algorithms for linear multivariate problems
zbMATH Open document ID: 0939.65079
published in: Journal of Complexity
publication date: 2000-07-10T00:00:00Z
review text: The paper is concerned with the approximation of linear multivariate problems over a weighted tensor product of Hilbert spaces. The authors look for constructive solutions of such problems by polynomial-time algorithms. Results are illustrated for the problems of integration and approximation of a function. The paper continues the studies of \textit{I. H. Sloan} [When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? J. Complexity 14, No. 1, 1-33 (1998)].
Mathematics Subject Classification ID: 65J05
Mathematics Subject Classification ID: 65D32
Mathematics Subject Classification ID: 65Y20
Mathematics Subject Classification ID: 65D15
zbMATH DE Number: 1389256
zbMATH Keywords: weighted tensor product algorithms
zbMATH Keywords: tractability
zbMATH Keywords: efficiency
zbMATH Keywords: linear multivariate problems
zbMATH Keywords: Hilbert spaces
zbMATH Keywords: polynomial-time algorithms
zbMATH Keywords: integration
zbMATH Keywords: approximation
author: Grzegorz W. Wasilkowski
author: H. Woźniakowski
reviewed by: Etienne Emmrich
MaRDI profile type: Publication
OpenAlex ID: W2041530119
cites work: Theory of Reproducing Kernels
cites work: High dimensional integration of smooth functions over cubes
cites work: On an interpolatory method for high dimensional integration
cites work: Tractability of tensor product linear operators
cites work: Q3868672
cites work: Q4218396
cites work: When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
cites work: Q5600030
cites work: Q4226447
cites work: Q3993279
cites work: Explicit cost bounds of algorithms for multivariate tensor product problems
cites work: Tractability and strong tractability of linear multivariate problems
cites work: Q4365455
DOI: 10.1006/JCOM.1999.0512
Recommended article: Q4365455
Recommended article: Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals
Recommended article: Explicit cost bounds of algorithms for multivariate tensor product problems
Recommended article: Approximate decoupling of multivariate polynomials using weighted tensor decomposition
Recommended article: On the tractability of linear tensor product problems in the worst case
Recommended article: Q4549526
Recommended article: Multiplicative algorithms for symmetric nonnegative tensor factorizations and its applications
Recommended article: Linearized methods for tensor complementarity problems
Recommended article: Krylov Subspace Methods for Linear Systems with Tensor Product Structure
Recommended article: Numerical tensor techniques for multidimensional convolution products
description: scientific article; zbMATH DE number 1389256