Title | ||
---|---|---|
Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices |
Abstract | ||
---|---|---|
Three fast and stable divide and conquer algorithms to compute the eigendecomposition of symmetric diagonal-plus-semiseparable matrices are considered. |
Year | DOI | Venue |
---|---|---|
2005 | 10.1007/s11075-004-6998-y | Numerical Algorithms |
Keywords | Field | DocType |
semiseparable matrix,fast algorithms,stable algorithms,eigendecomposition | Diagonal,Mathematical optimization,Matrix (mathematics),Algorithm,Eigendecomposition of a matrix,Divide and conquer algorithms,Mathematics | Journal |
Volume | Issue | ISSN |
39 | 4 | 1017-1398 |
Citations | PageRank | References |
6 | 0.73 | 3 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
N. Mastronardi | 1 | 30 | 3.98 |
E. Van Camp | 2 | 6 | 0.73 |
M. Van Barel | 3 | 47 | 6.56 |