
doi: 10.1137/0902012
An algorithm is presented for balancing the A and B matrices prior to computing the eigensystem of the generalized eigenvalue problem $Ax = \lambda Bx$. The three-step algorithm is specifically designed to precede the $QZ$-type algorithms, but improved performance is expected from most eigensystem solvers. Permutations and two-sided diagonal transformations are applied to A and B to produce matrices with certain desirable properties. Test cases are presented to illustrate the improved accuracy of the computed eigenvalues.
Numerical computation of eigenvalues and eigenvectors of matrices, diagonal transformation, generalized eigenvalue, Numerical computation of matrix norms, conditioning, scaling, scaling, balancing, QZ algorithm, graded matrix
Numerical computation of eigenvalues and eigenvectors of matrices, diagonal transformation, generalized eigenvalue, Numerical computation of matrix norms, conditioning, scaling, scaling, balancing, QZ algorithm, graded matrix
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 41 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
