Algorithms for range restricted iterative methods for linear discrete ill-posed problems

Authors:
Arthur Neuman;Lothar Reichel;Hassane Sadok
Affiliations:
Department of Mathematical Sciences, Kent State University, Kent, USA 44242;Department of Mathematical Sciences, Kent State University, Kent, USA 44242;Laboratoire de Mathématiques Pures et Appliquées, Université du Littoral, Calais cedex, France 62228
Venue:
Numerical Algorithms
Year:
2012

Citing 5
Cited 3

Computational methods for integral equations

Computational methods for integral equations
Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion

Rank-deficient and discrete ill-posed problems: numerical aspects of linear inversion
A Technique for the Numerical Solution of Certain Integral Equations of the First Kind

Journal of the ACM (JACM)
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
Breakdown-free GMRES for Singular Systems

SIAM Journal on Matrix Analysis and Applications

Old and new parameter choice rules for discrete ill-posed problems

Numerical Algorithms
Perceptual radiometric compensation for inter-reflection in immersive projection environment

Proceedings of the 19th ACM Symposium on Virtual Reality Software and Technology
FGMRES for linear discrete ill-posed problems

Applied Numerical Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.