Preconditioned GMRES methods with incomplete Givens orthogonalization method for large sparse least-squares problems

被引:7
作者
Yin, Jun-Feng [1 ,2 ]
Hayami, Ken [1 ]
机构
[1] Natl Inst Informat, Chiyoda Ku, Tokyo 1018430, Japan
[2] Tongji Univ, Dept Math, Shanghai 200092, Peoples R China
关键词
Least-squares problems; Incomplete Givens orthogonalization methods; GMRES; Preconditioner; CONJUGATE-GRADIENT METHODS; LINEAR-SYSTEMS; FACTORIZATION METHODS; ALGORITHM; EQUATIONS;
D O I
10.1016/j.cam.2008.05.052
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We propose to precondition the GMRES method by using the incomplete Givens orthogonalization (IGO) method for the solution of large sparse linear least-squares problems. Theoretical analysis shows that the preconditioner satisfies the sufficient condition that can guarantee that the preconditioned GMRES method will never break down and always give the least-squares solution of the original problem. Numerical experiments further confirm that the new preconditioner is efficient. We also find that the IGO preconditioned BA-GMRES method is superior to the corresponding CGLS method for ill-conditioned and singular least-squares problems. Crown Copyright (c) 2008 Published by Elsevier B.V. All rights reserved.
引用
收藏
页码:177 / 186
页数:10
相关论文
共 50 条
  • [41] On multi-step greedy randomized coordinate descent method for solving large linear least-squares problems
    Tan, Long-Ze
    Guo, Xue-Ping
    COMPUTATIONAL & APPLIED MATHEMATICS, 2023, 42 (01)
  • [42] A New Method for Large Scale Nonnegative Least Squares Problems
    Yong, Longquan
    PROCEEDINGS OF THE 2009 INTERNATIONAL CONFERENCE ON COMPUTER TECHNOLOGY AND DEVELOPMENT, VOL 2, 2009, : 448 - 450
  • [43] A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems
    Chen, Jia-Qi
    Huang, Zheng-Da
    EAST ASIAN JOURNAL ON APPLIED MATHEMATICS, 2022,
  • [44] Fully discrete least-squares spectral element method for parabolic interface problems
    Kumar, N. Kishore
    Biswas, Pankaj
    MATHEMATICS AND COMPUTERS IN SIMULATION, 2021, 181 (181) : 364 - 379
  • [45] A Fast Block Coordinate Descent Method for Solving Linear Least-Squares Problems
    Chen, Jia-Qi
    Huang, Zheng-Da
    EAST ASIAN JOURNAL ON APPLIED MATHEMATICS, 2022, 12 (02) : 406 - 420
  • [46] Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
    Schoepfer, Frank
    Lorenz, Dirk A.
    Tondji, Lionel
    Winkler, Maximilian
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2022, 652 : 132 - 154
  • [47] TSIRM: A Two-Stage Iteration with least-squares Residual Minimization algorithm to solve large sparse linear systems
    Couturier, Raphael
    Khodja, Lilia Ziane
    Guyeux, Christophe
    2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS, 2015, : 990 - 997
  • [48] On the randomized multiple row-action methods for solving linear least-squares problems
    Zuo, Qian
    Wu, Nian-Ci
    Liu, Chengzhi
    Wang, Yatian
    NUMERICAL ALGORITHMS, 2024,
  • [49] RISE: An Incremental Trust-Region Method for Robust Online Sparse Least-Squares Estimation
    Rosen, David M.
    Kaess, Michael
    Leonard, John J.
    IEEE TRANSACTIONS ON ROBOTICS, 2014, 30 (05) : 1091 - 1108
  • [50] Maximal residual coordinate descent method with k-means clustering for solving large linear least-squares problems
    Rui, Liu
    Ai-Li, Yang
    Jian, Ma
    NUMERICAL ALGORITHMS, 2025,