|
Abstract
|
We study an algorithm to compute minimum norm solution of ill-posed problems in Hilbert space and investigate its regularizing properties with discrepancy principle stopping rule. This algorithm results from straightly applying the LSQR method to the main problem before discretizing. In fact, the proposed algorithm obtains a sequence of approximate solutions of the original problem.
|