Iterative Solution Methods for Large Linear Discrete Ill-Posed Problems

作者: Daniela Calvetti , Lothar Reichel , Qin Zhang , None

DOI: 10.1007/978-1-4612-0571-5_7

关键词: Iterative methodLinear systemLocal convergenceSuccessive over-relaxationMathematical optimizationDiscretizationTikhonov regularizationConjugate gradient methodChebyshev iterationComputer scienceApplied mathematics

摘要: This chapter discusses iterative methods for the solution of very large severely ill-conditioned linear systems equations that arise from discretization ill-posed problems. The right-hand side vector represents given data and is assumed to be contaminated by errors. Solution proposed in literature employ some form filtering reduce influence error on computed approximate solution. amount determined a parameter often referred as regularization parameter. We discuss how affects consider selection Methods which suitable value during computation without user intervention are emphasized. New based expanding explicitly chosen filter functions terms Chebyshev polynomials presented. properties these illustrated with applications image restoration.

参考文章(69)
Martin Hanke, Per Christian Hansen, Regularization methods for large-scale problems ,(1993)
Yu. V. Kapitonov, M. I. Ovseets, Optimal pooling algorithm for linearly structured programs Cybernetics. ,vol. 22, pp. 1- 5 ,(1986) , 10.1007/BF01078620
Marlis Hochbruck, Martin Hanke, A CHEBYSHEV-LIKE SEMIITERATION FOR INCONSISTENT LINEAR SYSTEMS ETNA. Electronic Transactions on Numerical Analysis [electronic only]. ,vol. 1, pp. 89- 103 ,(1993)
S. I Kabanikhin, V. G. Romanov, Inverse Problems for Maxwell's Equations ,(1994)
Alfred Karl Louis, Inverse und schlecht gestellte Probleme Vieweg+Teubner Verlag. ,(1989) , 10.1007/978-3-322-84808-6
D. Calvetti, G. H. Golub, L. Reichel, Estimation of the L-Curve via Lanczos Bidiagonalization Bit Numerical Mathematics. ,vol. 39, pp. 603- 619 ,(1999) , 10.1023/A:1022383005969