Why does information-based complexity use the real number model?

Authors
Citation
H. Wozniakowski, Why does information-based complexity use the real number model?, THEOR COMP, 219(1-2), 1999, pp. 451-465
Citations number
41
Categorie Soggetti
Computer Science & Engineering
Journal title
THEORETICAL COMPUTER SCIENCE
ISSN journal
03043975 → ACNP
Volume
219
Issue
1-2
Year of publication
1999
Pages
451 - 465
Database
ISI
SICI code
0304-3975(19990528)219:1-2<451:WDICUT>2.0.ZU;2-Z
Abstract
We explain why information-based complexity uses the real number model. Res ults in the real number model are essentially the same as in floating point arithmetic with fixed precision modulo two important assumptions, namely . we use only stable algorithms, . the approximation error is not too small, compared to the product of the condition number, the roundoff unit of floating point arithmetic, and the a ccumulation constant of a stable algorithm. We illustrate this by an example of solving nonlinear equations by bisectio n. We also indicate the possible tradeoffs between complexity and stability , and the need of using multiple or varying precision for ill-conditioned p roblems. (C) 1999 Elsevier Science B.V. All rights reserved.