License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-1526
URL: http://drops.dagstuhl.de/opus/volltexte/2005/152/

Wasilkowski, Gregorz W. ; Wozniakowski, Henryk

Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights; Worst Case Setting

pdf-format:
Dokument 1.pdf (582 KB)


Abstract

We present polynomial-time algorithms for multivariate problems defined over tensor product spaces of finite order. That is, algorithms that solve the problem with error not exceeding \epsilon at cost bounded by C d^q \epsilon^{-1}, where d denotes the number of variables.

BibTeX - Entry

@InProceedings{wasilkowski_et_al:DSP:2005:152,
  author =	{Gregorz W. Wasilkowski and Henryk Wozniakowski},
  title =	{Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights; Worst Case Setting},
  booktitle =	{Algorithms and Complexity for Continuous Problems},
  year =	{2005},
  editor =	{Thomas M{\"u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub},
  number =	{04401},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2005/152},
  annote =	{Keywords: Multivariate integration , multivariate approximation , complexity , polynomial-time algorithms , finite-order weights}
}

Keywords: Multivariate integration , multivariate approximation , complexity , polynomial-time algorithms , finite-order weights
Seminar: 04401 - Algorithms and Complexity for Continuous Problems
Issue date: 2005
Date of publication: 19.04.2005


DROPS-Home | Fulltext Search | Imprint Published by LZI