Balancing sparse matrices for computing eigenvalues

Applying a permuted diagonal similarity transform DPAP T D −1 to a matrix A before calculating its eigenvalues can improve the speed and accuracy with which the eigenvalues are computed. This is often called balancing. This paper describes several balancing algorithms for sparse matrices and compare...

Celý popis

Podrobná bibliografia

Vydané v:	Linear algebra and its applications Ročník 309; číslo 1; s. 261 - 287
Hlavní autori:	Chen, Tzu-Yi, Demmel, James W.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 15.04.2000
Predmet:	Accurate eigenvalues Balancing Norm minimization Sparse matrix algorithms Accurate eigenvalues 65F15 Balancing Norm minimization 65F35 Sparse matrix algorithms
ISSN:	0024-3795, 1873-1856
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!