Skip Navigation

The Computer Journal 1971 14(3):280-284; doi:10.1093/comjnl/14.3.280
© 1971 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (8)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Grad, J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Matrix balancing

J. Grad *

Institut ‘Jozef Stefan’, Ljubljana, Yugoslavia

In this paper we prove the convergence of the sequence of similarity transformations performed on a general real matrix of order n that transform the original matrix into a balanced form where for each i from 1 to n the sums of the absolute values of elements of row i and column i are equal. For some matrices the eigenvalues computed from balanced or nearly balanced form appear to be more accurate than the eigenvalues computed from the original non-balanced matrix.

Received January 1970.

* Institut ‘Jozef Stefan’, Ljubljana, Yugoslavia


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.