How to minimize the cost of iterative methods in the presence of perturbations

✍ Scribed by Bolesław Kacewicz

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 173 KB
• Volume: 19
• Category: Article
• ISSN: 0885-064X
• DOI: 10.1016/s0885-064x(02)00016-x

✦ Synopsis

We consider iterative methods for approximating solutions of nonlinear equations, where the iteration cannot be computed exactly, but is corrupted by additive perturbations. The cost of computing each iteration depends on the size of the perturbation. For a class of cost functions, we show that the total cost of producing an e-approximation can be made proportional to the cost c(e) of one single iterative step performed with the accuracy proportional to e. We also demonstrate that for some cost functions the total cost is proportional to c(e) 2 . In both cases matching lower bounds are shown. The results find natural application to establishing the complexity of nonlinear boundary-value problems, where they yield an improvement over the known upper bounds, and remove the existing gap between the upper and lower bounds.