Tikhonov regularization with MTRSVD method for solving large-scale discrete ill-posed problems

Regularization is possibly the most popular method for solving discrete ill-posed problems, whose solution is less sensitive to the error in the observed vector in the right hand than the original solution. This paper presents a new modified truncated randomized singular value decomposition (TR-MTRS...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of computational and applied mathematics Ročník 405; s. 113969
Hlavní autoři: Huang, Guangxin, Liu, Yuanyuan, Yin, Feng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 15.05.2022
Témata:
Linear discrete ill-posed problem
MTSVD
Randomized algorithm
Tikhonov regularization
Linear discrete ill-posed problem
Randomized algorithm
Tikhonov regularization
MTSVD
ISSN:0377-0427, 1879-1778
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Regularization is possibly the most popular method for solving discrete ill-posed problems, whose solution is less sensitive to the error in the observed vector in the right hand than the original solution. This paper presents a new modified truncated randomized singular value decomposition (TR-MTRSVD) method for large Tikhonov regularization in standard form. The proposed TR-MTRSVD algorithm introduces the idea of randomized algorithm into the improved truncated singular value decomposition (MTSVD) method to solve large Tikhonov regularization problems. The approximation matrix Ãℓ produced by randomized SVD is replaced by the closest matrix Ãk̃ in a unitarily invariant matrix norm with the same spectral condition number. The regularization parameters are determined by the discrepancy principle. Numerical examples show the effectiveness and efficiency of the proposed TR-MTRSVD algorithm for large Tikhonov regularization problems.
ISSN:0377-0427
1879-1778
DOI:10.1016/j.cam.2021.113969