Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices

被引：0

作者：

N. Mastronardi

E. Van Camp

M. Van Barel

机构：

[1] sez. Bari Consiglio Nazionale delle Ricerche,Istituto per le Applicazioni del Calcolo, “M. Picone”

[2] Katholieke Universiteit Leuven,Department of Computer Science

来源：

Numerical Algorithms | 2005年 / 39卷

关键词：

semiseparable matrix; fast algorithms; stable algorithms; eigendecomposition;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Three fast and stable divide and conquer algorithms to compute the eigendecomposition of symmetric diagonal-plus-semiseparable matrices are considered.

引用

页码：379 / 398

页数：19

共 17 条

[1] Bunch J.R.(1978)Rank-one modification of the symmetric eigenproblem Numer. Math. 31 31-48
[2] Nielsen C.P.(2000)Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices Linear Algebra Appl. 313 107-114
[3] Sorensen D.C.(1981)A divide and conquer method for the symmetric tridiagonal eigenproblem Numer. Math. 36 177-195
[4] Chandrasekaran S.(1994)Fast algorithms with preprocessing for matrix–vector multiplication problems J. Complexity 10 411-427
[5] Gu M.(1977)Some modified matrix eigenvalue problems SIAM Rev. 19 46-89
[6] Cuppen J.J.M.(1994)A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem SIAM J. Matrix Anal. Appl. 15 1266-1276
[7] Gohberg I.(1995)A divide-and-conquer algorithm for the symmetric tridiagonal eigenvalue problem SIAM J. Matrix Anal. Appl. 16 172-191
[8] Olshevsky V.(2001)Fast and stable algorithms for reducing diagonal plus semi-separable matrices to tridiagonal and bidiagonal form BIT 41 149-157
[9] Golub G.H.(1984)The Lanczos algorithm with partial reorthogonalization Math. Comp. 42 115-142
[10] Gu M.(undefined)undefined undefined undefined undefined-undefined

← 1 2 →