Flexible Modified LSMR Method for Least Squares Problems
<|reference_start|>Flexible Modified LSMR Method for Least Squares Problems: LSMR is a widely recognized method for solving least squares problems via the double QR decomposition. Various preconditioning techniques have been explored to improve its efficiency. One issue that arises when implementing these preconditioning techniques is the need to solve two linear systems per iterative step. In this paper, to tackle this issue, among others, a modified LSMR method (MLSMR), in which only one linear system per iterative step needs to be solved instead of two, is introduced, and then it is integrated with the idea of flexible GMRES to yield a flexible MLSMR method (FMLSMR). Numerical examples are presented to demonstrate the efficiency of the proposed FMLSMR method.<|reference_end|>
@article{yang2024flexible,
    title={Flexible Modified LSMR Method for Least Squares Problems},
    author={Mei Yang, Gul Karaduman, Ren-Cang Li},
    journal={arXiv preprint arXiv:2408.16652},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.16652},
    primaryClass={math.NA cs.NA}
}