Algorithms for range restricted iterative methods for linear discrete ill-posed problems
- 194 Downloads
Range restricted iterative methods based on the Arnoldi process are attractive for the solution of large nonsymmetric linear discrete ill-posed problems with error-contaminated data (right-hand side). Several derivations of this type of iterative methods are compared in Neuman et al. (Linear Algebra Appl. in press). We describe MATLAB codes for the best of these implementations. MATLAB codes for range restricted iterative methods for symmetric linear discrete ill-posed problems are also presented.
KeywordsLinear discrete ill-posed problem Iterative method Truncated iteration
Unable to display preview. Download preview PDF.
- 4.Delves, L.M., Mohamed, J.L.: Computational Methods for Integral Equations, p. 310. Cambridge University Press (1985)Google Scholar
- 10.Neuman, A., Reichel, L., Sadok, H.: Implementations of range restricted iterative methods for linear discrete ill-posed problems. Linear Algebra Appl. (in press)Google Scholar
- 13.Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd ed. SIAM, Philadelphia (2003)Google Scholar