Preconditioning and convergence in the right norm
The convergence of numerical approximations to the solutions of differential equations is a key aspect of Numerical Analysis and Scientific Computing. Iterative solution methods for the systems of linear(ised) equations which often result are also underpinned by analyses of convergence. In the funct...
| Main Author: | |
|---|---|
| Format: | Report |
| Published: |
Unspecified
2007
|
| _version_ | 1826266789913296896 |
|---|---|
| author | Wathen, A |
| author_facet | Wathen, A |
| author_sort | Wathen, A |
| collection | OXFORD |
| description | The convergence of numerical approximations to the solutions of differential equations is a key aspect of Numerical Analysis and Scientific Computing. Iterative solution methods for the systems of linear(ised) equations which often result are also underpinned by analyses of convergence. In the function space setting, it is widely appreciated that there are appropriate ways in which to assess convergence and it is well-known that different norms are not equivalent. In the finite dimensional linear algebra setting, however, all norms are equivalent and little attention is often payed to the norms used. In this paper, we highlight this consideration in the context of preconditioning for minimum residual methods (MINRES and GMRES/GCR/ORTHOMIN) and argue that even in the linear algebra setting there is a ‘right’ norm in which to consider convergence: stopping an iteration which is rapidly converging in an irrelevant or highly scaled norm at some tolerance level may still give a poor answer. |
| first_indexed | 2024-03-06T20:44:19Z |
| format | Report |
| id | oxford-uuid:355787b7-ef50-4765-8f9a-970989034ffa |
| institution | University of Oxford |
| last_indexed | 2024-03-06T20:44:19Z |
| publishDate | 2007 |
| publisher | Unspecified |
| record_format | dspace |
| spelling | oxford-uuid:355787b7-ef50-4765-8f9a-970989034ffa2022-03-26T13:31:28ZPreconditioning and convergence in the right normReporthttp://purl.org/coar/resource_type/c_93fcuuid:355787b7-ef50-4765-8f9a-970989034ffaMathematical Institute - ePrintsUnspecified2007Wathen, AThe convergence of numerical approximations to the solutions of differential equations is a key aspect of Numerical Analysis and Scientific Computing. Iterative solution methods for the systems of linear(ised) equations which often result are also underpinned by analyses of convergence. In the function space setting, it is widely appreciated that there are appropriate ways in which to assess convergence and it is well-known that different norms are not equivalent. In the finite dimensional linear algebra setting, however, all norms are equivalent and little attention is often payed to the norms used. In this paper, we highlight this consideration in the context of preconditioning for minimum residual methods (MINRES and GMRES/GCR/ORTHOMIN) and argue that even in the linear algebra setting there is a ‘right’ norm in which to consider convergence: stopping an iteration which is rapidly converging in an irrelevant or highly scaled norm at some tolerance level may still give a poor answer. |
| spellingShingle | Wathen, A Preconditioning and convergence in the right norm |
| title | Preconditioning and convergence in the right norm |
| title_full | Preconditioning and convergence in the right norm |
| title_fullStr | Preconditioning and convergence in the right norm |
| title_full_unstemmed | Preconditioning and convergence in the right norm |
| title_short | Preconditioning and convergence in the right norm |
| title_sort | preconditioning and convergence in the right norm |
| work_keys_str_mv | AT wathena preconditioningandconvergenceintherightnorm |