A DIVIDE-AND-CONQUER ALGORITHM FOR THE BIDIAGONAL SVD

被引:86
|
作者
GU, M
EISENSTAT, SC
机构
[1] UNIV CALIF BERKELEY,LAWRENCE BERKELEY LAB,BERKELEY,CA 94720
[2] YALE UNIV,DEPT COMP SCI,NEW HAVEN,CT 06520
关键词
SINGULAR VALUE DECOMPOSITION; DIVIDE-AND-CONQUER; BIDIAGONAL MATRIX;
D O I
10.1137/S0895479892242232
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The authors present a stable and efficient divide-and-conquer algorithm for computing the singular value decomposition (SVD) of a lower bidiagonal matrix. Previous divide-and-conquer algorithms all suffer from a potential loss of orthogonality among the computed singular vectors unless extended precision arithmetic is used. A generalization that computes the SVD of a lower banded matrix is also presented.
引用
收藏
页码:79 / 92
页数:14
相关论文
共 50 条
  • [31] A parallel processing method of divide-and-conquer and a highly efficient parallel sorting algorithm
    Huang, Minghe
    Zhong, Cuixiang
    Dai, Liping
    Lei, Gang
    DCABES 2006 Proceedings, Vols 1 and 2, 2006, : 86 - 88
  • [32] STATIC ANALYSIS FOR DIVIDE-AND-CONQUER PATTERN DISCOVERY
    Kozsik, Tamas
    Toth, Melinda
    Istvan Bozo
    Horvath, Zoltan
    COMPUTING AND INFORMATICS, 2016, 35 (04) : 764 - 791
  • [33] Divide-and-Conquer Parallelism for Learning Mixture Models
    Kawakatsu, Takaya
    Kinoshita, Akira
    Takasu, Atsuhiro
    Adachi, Jun
    TRANSACTIONS ON LARGE-SCALE DATA- AND KNOWLEDGE-CENTERED SYSTEMS XXVIII: SPECIAL ISSUE ON DATABASE- AND EXPERT-SYSTEMS APPLICATIONS, 2016, 9940 : 23 - 47
  • [34] Modular Divide-and-Conquer Parallelization of Nested Loops
    Farzan, Azadeh
    Nicolet, Victor
    PROCEEDINGS OF THE 40TH ACM SIGPLAN CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '19), 2019, : 610 - 624
  • [35] Multiview Hybrid Embedding: A Divide-and-Conquer Approach
    Xu, Jiamiao
    Yu, Shujian
    You, Xinge
    Leng, Mengjun
    Jing, Xiao-Yuan
    Chen, C. L. Philip
    IEEE TRANSACTIONS ON CYBERNETICS, 2020, 50 (08) : 3640 - 3653
  • [36] Improved master theorems for divide-and-conquer recurrences
    Roura, S
    JOURNAL OF THE ACM, 2001, 48 (02) : 170 - 205
  • [37] ON THE ORTHOGONALITY OF EIGENVECTORS COMPUTED BY DIVIDE-AND-CONQUER TECHNIQUES
    SORENSEN, DC
    PING, TPT
    SIAM JOURNAL ON NUMERICAL ANALYSIS, 1991, 28 (06) : 1752 - 1775
  • [38] A general and efficient divide-and-conquer algorithm framework for multi-core clusters
    Carlos H. González
    Basilio B. Fraguela
    Cluster Computing, 2017, 20 : 2605 - 2626
  • [39] DIVIDE-AND-CONQUER - A PARALLEL ALGORITHM FOR THE SOLUTION OF A TRIDIAGONAL LINEAR-SYSTEM OF EQUATIONS
    BONDELI, S
    PARALLEL COMPUTING, 1991, 17 (4-5) : 419 - 434
  • [40] A general and efficient divide-and-conquer algorithm framework for multi-core clusters
    Gonzalez, Carlos H.
    Fraguela, Basilio B.
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2017, 20 (03): : 2605 - 2626