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...

Full description

Bibliographic Details

Published in:	Linear algebra and its applications Vol. 309; no. 1; pp. 261 - 287
Main Authors:	Chen, Tzu-Yi, Demmel, James W.
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 15.04.2000
Subjects:	Accurate eigenvalues Balancing Norm minimization Sparse matrix algorithms Accurate eigenvalues 65F15 Balancing Norm minimization 65F35 Sparse matrix algorithms
ISSN:	0024-3795, 1873-1856
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!