Abstract
AbstractThis paper describes a method whereby iteration can be carried out simultaneously with two or more trial vectors in order to obtain the latent roots of largest modulus of a symmetric matrix and their corresponding latent vectors. The convergence of any particular vector is automatically accelerated by making use of the current approximations to those vectors subdominant to it, the dominant latent vectors being obtained quite rapidly. The method is particularly suitable where a few of the dominant latent roots and vectors are required of a large symmetric matrix.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Mathematical Proceedings of the Cambridge Philosophical Society
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
