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 条
  • [21] Speaker Diarization Using Divide-and-Conquer
    Cheng, Shih-Sian
    Tseng, Chun-Han
    Chen, Chia-Ping
    Wang, Hsin-Min
    INTERSPEECH 2009: 10TH ANNUAL CONFERENCE OF THE INTERNATIONAL SPEECH COMMUNICATION ASSOCIATION 2009, VOLS 1-5, 2009, : 1059 - +
  • [22] Orthogonal complement based divide-and-conquer algorithm for constrained multibody systems
    Mukherjee, Rudranarayan M.
    Anderson, Kurt S.
    NONLINEAR DYNAMICS, 2007, 48 (1-2) : 199 - 215
  • [23] MULTIDIMENSIONAL DIVIDE-AND-CONQUER MAXIMIN RECURRENCES
    ALONSO, L
    REINGOLD, EM
    SCHOTT, R
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 1995, 8 (03) : 428 - 447
  • [24] Divide-and-conquer for Voronoi diagrams revisited
    Aichholzer, Oswin
    Aigner, Wolfgang
    Aurenhammer, Franz
    Hackl, Thomas
    Juettler, Bert
    Pilgerstorfer, Elisabeth
    Rabl, Margot
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2010, 43 (08): : 688 - 699
  • [25] Orthogonal Complement Based Divide-and-Conquer Algorithm for constrained multibody systems
    Rudranarayan M. Mukherjee
    Kurt S. Anderson
    Nonlinear Dynamics, 2007, 48 : 199 - 215
  • [26] DIVIDE-AND-CONQUER AND PARALLEL GRAPH REDUCTION
    RABHI, FA
    MANSON, GA
    PARALLEL COMPUTING, 1991, 17 (2-3) : 189 - 205
  • [27] A Divide-and-Conquer Approach to Quad Remeshing
    Zhang, Muyang
    Huang, Jin
    Liu, Xinguo
    Bao, Hujun
    IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2013, 19 (06) : 941 - 952
  • [28] An efficient hybrid tridiagonal divide-and-conquer algorithm on distributed memory architectures
    Li, Shengguo
    Rouet, Francois-Henry
    Liu, Jie
    Huang, Chun
    Gao, Xingyu
    Chi, Xuebin
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2018, 344 : 512 - 520
  • [29] DCHap: A Divide-and-Conquer Haplotype Phasing Algorithm for Third-Generation Sequences
    Li, Yanbo
    Lin, Yu
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2022, 19 (03) : 1277 - 1284
  • [30] THE MR3-GK ALGORITHM FOR THE BIDIAGONAL SVD
    Willems, Paul R.
    Lang, Bruno
    ELECTRONIC TRANSACTIONS ON NUMERICAL ANALYSIS, 2012, 39 : 1 - 21