Phillips D L. A technique for the numerical solution of certain integral equations of the firstkind[J]. J. Assoc. Comput. Mach., 1962, 9: 84-97.
[2]
Tikhonov A N. Solution of incorrectly formulated problems and the regularization method[J].Soviet. Math. Dokl., 1963, 4: 1035-1038.
[3]
Morozov V A. Methods for Solving Incorrectly Posed Problems[M]. New York: Springer Verlag,1984.
[4]
Groetsch C W. The Theory of Tikhonov Regularization for Fredholm Equations of the FirstKind[M]. Boston: Pitman, 1984.
[5]
Engl H W, Hanke M, Neubauer A. Regularization of Inverse Problems[M]. Dordrecht: Kluwer,1996.
[6]
Hansen P C. Rank-Deficient and Discrete Ill-Posed Problems[M]. Philadelphia: SIAM, 1997.
[7]
Golub G H, Heath M T, Wahba G. Generalized cross-validation as a method for choosing a goodridge parameter[J]. Technometrics, 1979, 21: 215-223.
[8]
Hansen P C. Analysis of discrete ill-posed problems by means of the L-curve[J]. SIAM Rev.,1992, 34: 561-580.
[9]
Hansen P C, O’Leary D P. The use of the L-curve in the regularization of discrete ill-posedproblems[J]. SIAM J. Sci. Comput., 1993, 14: 1487-1503.
[10]
Hansen P C. Regularization tools: A Matlab package for analysis and solution of discrete ill-posedproblems[J]. Numer. Algor., 1994, 6: 1-35.
[11]
Varah J M. On the numerical solution of ill-conditioned linear systems with applications toill-posed problems[J]. SIAM J. Numer. Anal., 1973, 10: 257-267.
[12]
Hansen P C. The truncated SVD as a method for regularization[J]. BIT, 1987, 27: 534-553.
[13]
Hansen P C. Truncated singular value decomposition solutions to discrete ill-posed problemswith ill-determined numerical rank[J]. SIAM J. Sci. Stat. Comput., 1990, 11: 503-518.
[14]
Morigi S, Reichel L, Sgallari F. A truncated projected SVD method for linear discrete ill-posedproblems[J]. Numer. Algor., 2006, 43: 197-213.
[15]
Golub G H, Kahan W. Calculating the singular values and pseudo-inverse of a matrix[J]. SIAMJ. Numer. Anal., 1965, 2: 205-224.
[16]
Paige C C, Saunders M A. LSQR: An algorithm for sparse linear equations and sparse leastsquares[J]. ACM Trans. Math. Software, 1982, 8: 43-71.
[17]
O’Leary D P, Simmons J A. A bidiagonalization-regularization procedure for large-scale discretizationsof ill-posed problems[J]. SIAM J. Sci. Statist. Comput., 1981, 2: 474-489.
[18]
Bj¨orck A. A bidiagonalization algorithm for solving large and sparse ill-posed systems of linearequations[J]. BIT, 1988, 18: 659-670.
[19]
Calvetti D, Golub G H, Reichel L. Estimation of the L-curve via Lanczos bidiagonalization[J].BIT, 1999, 39: 603-619.
[20]
Calvetti D, Morigi S, Reichel L, Sgallari F. Tikhonov regularization and the L-curve for largediscrete ill-posed problems[J]. J. Comput. Appl. Math., 2000, 123: 423-446.
[21]
Calvetti D, Reichel L, Sgallari F, Spaletta G. A regularizing Lanczos iteration method for underdeterminedlinear systems[J]. J. Comput. Appl. Math., 2000, 115: 101-120.
[22]
Morigi S, Sgallari F. A regularizing L-curve Lanczos method for underdetermined linear systems[J]. Appl. Math. Comput., 2001, 121: 55-73.
[23]
Calvetti D, Reichel L. Lanczos-based exponential filtering for discrete ill-posed problems[J]. Numer.Algor., 2002, 29: 45-65.
[24]
Hanke M. On Lanczos based methods for the regularization of discrete ill-posed problems[J].BIT, 2001, 41: 1008-1018.
[25]
Chung J, Nagy J G, O’Leary D P. A weighted-GCV method for Lanczos-hybrid regularization[J].Electronic Transactions on Numerical Analysis, 2008, 28: 149-167.
[26]
Saad Y, Schultz M H. GMRES: a generalized minimal residual algorithm for solving nonsymmetriclinear system[J]. SIAM J. Sci. Stat. Comput., 1986, 7: 856-869.
[27]
Calvetti D, Lewis B, Reichel L. GMRES, L-curve, and discrete ill-posed problems[J]. BIT, 2002,42: 44-65.
[28]
Calvetti D, Lewis B, Reichel L. GMRES-type methods for inconsistent systems[J]. Linear AlgebraAppl., 2000, 316: 157-169.
[29]
Reichel L, Ye Q. Breakdown-free GMRES for singular systems[J]. SIAM J. Matrix Anal. Appl.,2005, 26: 1001-1021.
[30]
Lewis B, Reichel L. Arnoldi-Tikhonov regularization methods[J]. J. Comput. Appl. Math., 2009,226: 92-102.
[31]
Neuman A, Reichel L, Sadok H. Implementations of range restricted iterative methods for lineardiscrete ill-posed problems[J]. Linear Algebra Appl., 2012, 436: 3974-3990.
[32]
Fridman V M. The method of minimum iterations with minimum errors for a system of linearalgebraic equations with a symmetrical matrix[J]. U.S.S.R. Comput. Math. and Math. Phys.,1963, 2: 362-363.
[33]
Rozloˇznik M, Weiss R. On the stable implementation of the generalized minimal error method[J].J. Comput. Appl. Math., 1998, 98: 49-62.
[34]
何旭初, 孙文瑜. 广义逆矩阵引论[M]. 南京: 江苏科学技术出版社,1990.
[35]
Golub G H, Van Loan C F. Matrix Computations[M]. Baltimore: Johns Hopkins UniversityPress, 1996.
[36]
Bazán F S V. CGLS-GCV: a hybrid algorithm for low-rank-deficient problems[J]. Appl. Numer.Math., 2003, 47: 91-108.
[37]
Carasso A S. Determining surface temperatures from interior observations[J]. SIAM J. Appl.Math., 1982, 42: 558-574.
