Regularization with randomized SVD for large-scale discrete inverse problems

Inverse Problems

Volumn 29, Issue 8, 2013, Pages

  Xiang, Hua ^a   Zou, Jun ^b  

^a WUHAN UNIVERSITY   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM FOR SOLVING; DISCREPANCY PRINCIPLE; NON-LINEAR INVERSE PROBLEM; NUMERICAL EXAMPLE; QUASI-OPTIMALITY; REGULARIZATION METHODS; REGULARIZATION PARAMETERS; REGULARIZATION TECHNIQUE;

ALGORITHMS; DIFFERENTIAL EQUATIONS; INVERSE PROBLEMS; PARAMETERIZATION;

SINGULAR VALUE DECOMPOSITION;

EID: 84881436047     PISSN: 02665611     EISSN: 13616420     Source Type: Journal    
DOI: 10.1088/0266-5611/29/8/085008     Document Type: Article

References (50)

1. Bakushinskii A B 1984 Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion USSR Comput. Math. Math. Phys. 24 181-2
2. Banks H and Kunisch K 1989 Parameter Estimation Techniques for Distributed Systems (Boston, MA: Birkhäuser)
3. Bauer F and Lukas M A 2011 Comparing parameter choice methods for regularization of ill-posed problems Math. Comput. Simul. 81 1795-841
4. Brezinski C, Rodriguez G and Seatzu S 2008 Error estimates for linear systems with applications to regularization Numer. Algorithms 49 85-104
5. Calvetti D, Golub G H and Reichel L 1999 Estimation of the L-curve via Lanczos bidiagonalization BIT Numer. Math. 39 603-19
6. Calvetti D, Morigi S, Reichel L and Sgallari F 2000 Tikhonov regularization and the L-curve for large discrete ill-posed problems J. Comput. Appl. Math. 123 423-46 (Pubitemid 32027696)
7. Chan T F 1982 An improved algorithm for computing the singular value decomposition ACM Trans. Math. Softw. 8 72-83
8. Chan T F and Hansen P C 1992 Some applications of the rank revealing QR factorization SIAM J. Sci. Stat. Comput. 13 727-41
9. Cheng H, Gimbutas Z, Martinsson P G and Rokhlin V 2005 On the compression of low rank matrices SIAM J. Sci. Comput. 26 1389-404 (Pubitemid 41205816)
10. Colton D and Kress R 1998 Inverse Acoustic and Electromagnetic Scattering Theory 2nd edn (Berlin: Springer)
11. Demmel J W 1997 Applied Numerical Linear Algebra (Philadephia, PA: SIAM)
12. Drineas P, Kannan R and Mahoney M W 2006 Fast Monte Carlo algorithms for matrices: III. Computing a compressed approximate matrix decomposition SIAM J. Comput. 36 184-206 (Pubitemid 46374023)
13. Engl H W, Hanke M and Neubauer A 1996 Regularization of Inverse Problems (Dordrecht: Kluwer)
14. Frieze A, Kannan R and Vempala S 2004 Fast Monte-Carlo algorithms for finding low-rank approximations J. ACM 51 1025-41 (Pubitemid 40818314)
15. Golub G H, Heath M and Wahba G 1979 Generalized cross-validation as a method for choosing a good ridge parameter Technometrics 21 215-23
16. Golub G H and Meurant G 2010 Matrices, Moments and Quadrature with Applications (Princeton, NJ: Princeton University Press)
17. Golub G H and Van Loan C F 2013 Matrix Computations 4th edn (Baltimore, MD: John Hopkins University Press)
18. Golub G H and von Matt U 1997 Tikhonov regularization for large scale problems Workshop on Scientific Computing ed G H Golub, S H Lui, F Luk and R J Plemmons (New York: Springer) pp 3-26
19. Gu M and Eisenstat S C 1996 Efficient algorithms for computing a strong rank-revealing QR factorization SIAM J. Sci. Comput. 17 848-69 (Pubitemid 126621180)
20. Halko N, Martinsson P and Tropp J 2011 Finding structures with randomness: probabilistic algorithms for constructing approximate matrix decompositions SIAM Rev. 53 217-88
21. Hamarik U, Palm R and Raus T 2009 On minimization strategies for choice of the regularization parameter in ill-posed problems Numer. Funct. Anal. Opt. 30 924-50
22. Hamarik U, Palm R and Raus T 2011 Comparison of parameter choices in regularization algorithms in case of different information about noise level Calcolo 48 47-59
23. Hanke M 1996 Limitations of the L-curve method in ill-posed problems BIT Numer. Math. 36 287-301 (Pubitemid 126419071)
24. Hanke M and Raus T 1996 A general heuristic for choosing the regularization parameter in ill-posed problems SIAM J. Sci. Comput. 17 956-72 (Pubitemid 126621187)
25. Hansen P C 1987 The truncated SVD as a method for regularization BIT Numer. Math. 27 543-53
26. Hansen P C 1992 Analysis of discrete ill-posed problems by means of the L-curve SIAM Rev. 34 561-80
27. Hansen P C 1994 Regularization tools: a Matlab package for analysis and solution of discrete ill-posed problems Numer. Algorithms 6 1-35
28. Hansen P C 1998 Rank-Deficient and Discrete Ill-Posed Problems: Numerical Aspects of Linear Inversion (Philadelphia, PA: SIAM)
29. Hansen P C 2010 Discrete Inverse Problems, Insight and Applications (Philadelphia, PA: SIAM)
30. Hansen P C 2008 Regularization Tools, Version 4.1 for Matlab 7.3 www2.imm.dtu.dk/∼pch/Regutools
31. Hansen P C and O'Leary D P 1993 The use of the L-curve in the regularization of discrete ill-posed problems SIAM J. Sci. Comput. 14 1487-503
32. Kirk D B and Hwu W W 2010 Programming Massively Parallel Processors: A Hands-On Approach (San Mateo, CA: Morgan Kaufmann)
33. Lagomasino G L, Reichel L and Wunderlich L 2008 Matrices, moments, and rational quadrature Linear Algebra Appl. 429 2540-54
34. Leonov A S and Yagola A G 1997 The L-curve method always produces an unremovable systematic error Vestn. Mosk. Univ. 3 6 17-9 (in Russian)
35. Lepskii O V 1990 On a problem of adaptive estimation in Gaussian white noise Theor. Probab. Appl. 35 454-66
36. Liberty E, Woolfe F, Martinsson P G, Rokhlin V and Tygert M 2007 Randomized algorithms for the low-rank approximation of matrices Proc. Natl Acad. Sci. 104 20167-72
37. Mahoney M W and Drineas P 2009 CUR matrix decompositions for improved data analysis Proc. Natl Acad. Sci. 106 697-702
38. Mathe P 2006 The Lepskii principle revisited Inverse Problems 22 L11-L15
39. Morozov V A 1966 On the solution of functional equations by the method of regularization Sov. Math. - Dokl. 7 414-7 (www.ams.org/mathscinet-getitem?mr= 0208819)
40. O'Leary D P and Simmons J A 1981 A bibiagonalization-regularization procedure for large-scale regularization of ill-posed problems SIAM J. Sci. Stat. Comput. 2 474-89
41. Phillips D L 1962 A technique for the numerical solution of certain integral equations of the first kind J. Assoc. Comput. Mach. 9 84-97
42. Rokhlin V, Szlam A and Tygert M 2009 A randomized algorithm for principal component analysis SIAM J. Matrix Anal. Appl. 31 1100-24
43. Sanders J and Kandrot E 2010 CUDA by example: An Introduction to General-Purpose GPU Programming (Reading, MA: Addison-Wesley)
44. Stewart G W 1999 The QLP approximation to the singular value decomposition SIAM J. Sci. Comput. 20 1336-48 (Pubitemid 32251220)
45. Tautenhahn U and Hamarik U 1999 The use of monotonicity for choosing the regularization parameter in ill-posed problems Inverse Problems 15 1487-505 (Pubitemid 129655864)
46. Tikhonov A and Arsenin V 1977 Solutions of Ill-posed Problems (New York: Wiley)
47. Tikhonov A and Glasko V 1965 Use of the regularization method in nonlinear problems USSR Comput. Math. Math. Phys. 5 93-107
48. Titarenko V N and Yagola A G 2000 Application of the GCV method for well-posed and ill-posed problems Vestn. Mosk. Univ. 3 4 15-8 (in Russian)
49. Vogel C R 1996 Non-convergence of the L-curve regularization parameter selection method Inverse Problems 12 535-47 (Pubitemid 126655737)
50. Woolfe F, Liberty E, Rokhlin V and Tygert M 2008 A fast randomized algorithm for the approximation of matrices Appl. Comput. Harmon. Anal. 25 335-66