Publication Details
Title: Towards a Complexity Theory for Approximation
Author: K. Aberer and B. Codenotti
Group: ICSI Technical Reports
Date: February 1992
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1992/tr-92-012.pdf
Overview:
This paper presents a novel approach to the analysis of numerical problems, which is closely related to the actual nature of numerical algorithms. In fact, models of computation are introduced which take into account such issues as adaptivity and error. Moreover, complexity vs error bounds and examples regarding the role of adaptivity are provided. Finally, it is shown that the overall approach fits naturally into an algebraic framework.
Bibliographic Information:
ICSI Technical Report TR-92-012
Bibliographic Reference:
K. Aberer and B. Codenotti. Towards a Complexity Theory for Approximation. ICSI Technical Report TR-92-012, February 1992
Author: K. Aberer and B. Codenotti
Group: ICSI Technical Reports
Date: February 1992
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1992/tr-92-012.pdf
Overview:
This paper presents a novel approach to the analysis of numerical problems, which is closely related to the actual nature of numerical algorithms. In fact, models of computation are introduced which take into account such issues as adaptivity and error. Moreover, complexity vs error bounds and examples regarding the role of adaptivity are provided. Finally, it is shown that the overall approach fits naturally into an algebraic framework.
Bibliographic Information:
ICSI Technical Report TR-92-012
Bibliographic Reference:
K. Aberer and B. Codenotti. Towards a Complexity Theory for Approximation. ICSI Technical Report TR-92-012, February 1992