2024-03-28T09:09:18Z
https://repository.nii.ac.jp/oai
oai:repository.nii.ac.jp:00001264
2023-01-11T01:51:16Z
136
NII Technical Report (NII-2011-001E):Inner-Iteration Krylov Subspace Methods for Least Squares Problems
保國, 惠一
Morikuni, Keiichi
速水, 謙
Hayami, Ken
テクニカルレポート
Technical Report
Stationary inner iterations in combination with Krylov subspace methods are proposed for least squares problems. The inner iterations are efficient in terms of computational work and memory, and serve as powerful preconditioners also for ill-conditioned and rank-deficient least squares problems. Theoretical justifications for using the inner iterations as preconditioners are presented. Numerical experiments for overdetermined least squares problems including ill-conditioned and rank-deficient problems show that the proposed methods outperform previous methods.
departmental bulletin paper
国立情報学研究所
2011-04-04
application/pdf
NIIテクニカル・レポート
1
27
NII Technical Report
1346-5597
https://repository.nii.ac.jp/record/1264/files/11-001E.pdf
eng