Perturbation analysis for the hyperbolic QR factorization

被引:7
|
作者
Li, Hanyu [1 ]
Yang, Hu [1 ]
Shao, Hua [2 ]
机构
[1] Chongqing Univ, Coll Math & Stat, Chongqing 401331, Peoples R China
[2] Chongqing Univ Sci & Technol, Coll Math & Phys, Chongqing 401331, Peoples R China
基金
中国国家自然科学基金;
关键词
Hyperbolic QR factorization; Perturbation analysis; Normwise perturbation; Componentwise perturbation; First order perturbation bound; Rigorous perturbation bound; MATRIX FACTORIZATIONS; DECOMPOSITION; BOUNDS;
D O I
10.1016/j.camwa.2012.03.036
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The hyperbolic QR factorization is a generalization of the classical QR factorization and can be regarded as the triangular case of the indefinite QR factorization proposed by Sanja Singer and Sasa Singer. In this paper, the perturbation analysis for this factorization is considered using the classical matrix equation approach, the refined matrix equation approach, and the matrix-vector equation approach. The first order and rigorous normwise perturbation bounds with normwise or componentwise perturbations in the given matrix are derived. The obtained first order bounds can be much tighter than the corresponding existing ones. Each of the obtained rigorous bounds is composed of a small constant multiple of the corresponding first order bound and an additional term with simple form. In particular, for square matrix, the rigorous bounds for the factor R are just the root 6 + root 3 multiple of the corresponding first order bounds. These rigorous bounds can be used safely for all cases in comparison to the first order bounds. (C) 2012 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1607 / 1620
页数:14
相关论文
共 50 条
  • [41] QR factorization for the Cell Broadband Engine
    Kurzak, Jakub
    Dongarra, Jack
    [J]. SCIENTIFIC PROGRAMMING, 2009, 17 (1-2) : 31 - 42
  • [42] FAST QR FACTORIZATION OF VANDERMONDE MATRICES
    DEMEURE, CJ
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1989, 122 : 165 - 194
  • [43] Multifrontal QR factorization in a multiprocessor environment
    Amestoy, PR
    Duff, IS
    Puglisi, C
    [J]. NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 1996, 3 (04) : 275 - 300
  • [44] A family of parallel QR factorization algorithms
    Meyer, GGL
    Pascale, M
    [J]. CONCURRENCY-PRACTICE AND EXPERIENCE, 1996, 8 (06): : 461 - 473
  • [45] QR FACTORIZATION OF CONFLUENT VANDERMONDE MATRICES
    DEMEURE, CJ
    [J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1990, 38 (10): : 1799 - 1802
  • [46] PAQR: Pivoting Avoiding QR factorization
    Sid-Lakhdar, Wissam
    Cayrols, Sebastien
    Bielich, Daniel
    Abdelfattah, Ahmad
    Luszczek, Piotr
    Gates, Mark
    Tomov, Stanimire
    Johansen, Hans
    Williams-Young, David
    Davis, Timothy
    Dongarra, Jack
    Anzt, Hartwig
    [J]. 2023 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM, IPDPS, 2023, : 322 - 332
  • [47] GENERALIZED QR FACTORIZATION AND ITS APPLICATIONS
    ANDERSON, E
    BAI, Z
    DONGARRA, J
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1992, 162 : 243 - 271
  • [48] Perturbation analysis for block downdating of the generalized Cholesky factorization
    Li, Hanyu
    Yang, Hu
    Shao, Hua
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2012, 218 (18) : 9451 - 9461
  • [49] ON THE PERTURBATION OF THE CHOLESKY FACTORIZATION
    DRMAC, Z
    OMLADIC, M
    VESELIC, K
    [J]. SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1994, 15 (04) : 1319 - 1332
  • [50] Distance preserving dimension reduction using the QR factorization or the Cholesky factorization
    Kim, Hyunsoo
    Park, Haesun
    Zha, Hongyuan
    [J]. PROCEEDINGS OF THE 7TH IEEE INTERNATIONAL SYMPOSIUM ON BIOINFORMATICS AND BIOENGINEERING, VOLS I AND II, 2007, : 263 - 269