The structure of iterative methods for symmetric linear discrete ill-posed problems |
| |
Authors: | L Dykes F Marcellán L Reichel |
| |
Institution: | 1. Department of Mathematical Sciences, Kent State University, Kent, OH?, 44242, USA 2. University School, Hunting Valley, OH?, 44022, USA 3. Departamento de Matemáticas, Universidad Carlos III de Madrid, Avenida de la Universidad 30, 28911?, Leganés, Spain
|
| |
Abstract: | The iterative solution of large linear discrete ill-posed problems with an error contaminated data vector requires the use of specially designed methods in order to avoid severe error propagation. Range restricted minimal residual methods have been found to be well suited for the solution of many such problems. This paper discusses the structure of matrices that arise in a range restricted minimal residual method for the solution of large linear discrete ill-posed problems with a symmetric matrix. The exploitation of the structure results in a method that is competitive with respect to computer storage, number of iterations, and accuracy. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|