Adaptive Wavelet Methods for Linear and Nonlinear Least-Squares Problems

Authors
Publication date 2014
Journal Foundations of Computational Mathematics
Volume | Issue number 14 | 2
Pages (from-to) 237-283
Organisations
  • Faculty of Science (FNWI) - Korteweg-de Vries Institute for Mathematics (KdVI)
Abstract
The adaptive wavelet Galerkin method for solving linear, elliptic operator equations introduced by Cohen et al. (Math Comp 70:27-75, 2001) is extended to nonlinear equations and is shown to converge with optimal rates without coarsening. Moreover, when an appropriate scheme is available for the approximate evaluation of residuals, the method is shown to have asymptotically optimal computational complexity. The application of this method to solving least-squares formulations of operator equations G(u)=0 , where G:H→K′ , is studied. For formulations of partial differential equations as first-order least-squares systems, a valid approximate residual evaluation is developed that is easy to implement and quantitatively efficient.
Document type Article
Language English
Published at https://doi.org/10.1007/s10208-013-9184-6
Permalink to this page
Back