Explicit cost bounds of algorithms for multivariate tensor product problems

Wasilkowski, Grzegorz W.; Wozniakowski, Henryk

We study multivariate tensor product problems in the worst case and average case
settings. They are denied on functions of d variables For arbitrary d we provide
explicit upper bounds on the costs of algorithms which compute an approximation
to the solution.



  • thumnail for demo title for ac:110245 demo title for ac:110245 application/octet-stream 142 KB Download File

More About This Work

Academic Units
Computer Science
Department of Computer Science, Columbia University
Columbia University Computer Science Technical Reports, CUCS-020-96
Published Here
April 25, 2011