David S. Watkins
The $QR$ algorithm is still one of the most important methods for computing eigenvalues and eigenvectors of matrices. Most discussions of the $QR$ algorithm begin with a very basic version and move by steps toward the versions of the algorithm that are actually used. This paper outlines a pedagogical path that leads directly to the implicit multishift $QR$ algorithms that are used in practice, bypassing the basic $QR$ algorithm completely.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados