Abstract
This paper analyzes the Rayleigh Quotient Iteration algorithm for symmetric matrices. Dynamical systems techniques are employed to characterize the sets of points for which the algorithm will converge to an eigenvector. It is shown that these sets have full measure and that their geometric nature is related to the spacing of the eigenvalues.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
