Artículos de revistas
GKB-FP: an algorithm for large-scale discrete ill-posed problems
Registro en:
Bit Numerical Mathematics. Springer, v. 50, n. 3, n. 481, n. 507, 2010.
0006-3835
WOS:000281790600003
10.1007/s10543-010-0275-3
Autor
Bazan, FSV
Borges, LS
Institución
Resumen
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) We describe an algorithm for large-scale discrete ill-posed problems, called GKB-FP,which combines the Golub-Kahan bidiagonalization algorithm with Tikhonov regularization in the generated Krylov subspace, with the regularization parameter for the projected problem being chosen by the fixed-point method by Bazan (Inverse Probl. 24(3), 2008). The fixed- point method selects as regularization parameter a fixed- point of the function parallel to r(lambda)parallel to(2)/parallel to f(lambda)parallel to(2), where f(lambda) is the regularized solution and r. is the corresponding residual. GKB-FP determines the sought fixed-point by computing a finite sequence of fixed- points of functions parallel to r(lambda)((k))parallel to(2)/parallel to f(lambda)((k))parallel to(2), where f(lambda)((k)) approximates f. in a k- dimensional Krylov subspace and r(lambda)((k)) is the corresponding residual. Based on this and provided the sought fixed-point is reached, we prove that the regularized solutions f(lambda)((k)) remain unchanged and therefore completely insensitive to the number of iterations. This and the performance of the method when applied to well- known test problems are illustrated numerically. 50 3 481 507 Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) CNPq [308154/2008-8] FAPESP [2009/52193-1]