Towards a Complexity Theory for Approximation
Title | Towards a Complexity Theory for Approximation |
Publication Type | Technical Report |
Year of Publication | 1992 |
Authors | Aberer, K., & Codenotti B. |
Other Numbers | 717 |
Abstract | 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. |
URL | http://www.icsi.berkeley.edu/ftp/global/pub/techreports/1992/tr-92-012.pdf |
Bibliographic Notes | ICSI Technical Report TR-92-012 |
Abbreviated Authors | K. Aberer and B. Codenotti |
ICSI Publication Type | Technical Report |