Skip Navigation

The Computer Journal 1964 7(3):222-227; doi:10.1093/comjnl/7.3.222
© 1964 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Doust, A.
Right arrow Articles by Price, V. E.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

The latent roots and vectors of a singular matrix

A. Doust1 * and V. E. Price2 §

1 English Electric-LEO Computers Ltd, Hartree House, Queensway, London, UK, 2 Northampton College of Advanced Technology, St Johns Street, London, UK

In this paper a method is presented for calculating a square matrix W, of order r, from a square matrix A of order n and rank r, such that the latent roots of W are the non-zero latent roots of A, and the latent vectors of A can easily be obtained from the corresponding latent vectors of W. A modification of the method is also given so that W is symmetric when A is a positive semi-definite symmetric matrix.


* English Electric-LEO Computers Ltd., Hartree House, Queensway, London, W.1.

§ Northampton College of Advanced Technology, St. Johns St., London, E.C.1.


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.