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 条
  • [21] Preconditioned iterative methods for solving weighted linear least squares problems
    Hai-long Shen
    Xin-hui Shao
    Tie Zhang
    Applied Mathematics and Mechanics, 2012, 33 : 375 - 384
  • [22] Preconditioned conjugate gradient methods for the solution of indefinite least squares problems
    Qiaohua Liu
    Xianjuan Li
    Calcolo, 2011, 48 : 261 - 271
  • [23] A SQUARE ROOT AND DIVISION FREE GIVENS ROTATION FOR SOLVING LEAST-SQUARES PROBLEMS ON SYSTOLIC ARRAYS
    GOTZE, J
    SCHWIEGELSHOHN, U
    SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1991, 12 (04): : 800 - 807
  • [24] On greedy randomized block Gauss–Seidel method with averaging for sparse linear least-squares problems
    Yimou Liao
    Tianxiu Lu
    Calcolo, 2023, 60
  • [25] AN EFFICIENT SIEVING-BASED SECANT METHOD FOR SPARSE OPTIMIZATION PROBLEMS WITH LEAST-SQUARES CONSTRAINTS
    Li, Qian
    Sun, Defeng
    Yuan, Yancheng
    SIAM JOURNAL ON OPTIMIZATION, 2024, 34 (02) : 2038 - 2066
  • [26] Accelerated orthogonal least-squares for large-scale sparse reconstruction
    Hashemi, Abolfazl
    Vikalo, Haris
    DIGITAL SIGNAL PROCESSING, 2018, 82 : 91 - 105
  • [27] Computational experience with numerical methods for nonnegative least-squares problems
    Bellavia, Stefania
    Gondzio, Jacek
    Morini, Benedetta
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2011, 18 (03) : 363 - 385
  • [28] A BRIEF SURVEY OF METHODS FOR SOLVING NONLINEAR LEAST-SQUARES PROBLEMS
    Mohammad, Hassan
    Waziri, Mohammed Yusuf
    Santos, Sandra Augusta
    NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2019, 9 (01): : 1 - 13
  • [29] Solution of large-scale weighted least-squares problems
    Baryamureeba, V
    NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2002, 9 (02) : 93 - 106
  • [30] Two new preconditioned GAOR methods for weighted linear least squares problems
    Miao, Shu-Xin
    Luo, Yu-Hua
    Wang, Guang-Bin
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 324 : 93 - 104