Showing papers on "QR decomposition published in 1966"
01 Jan 1966
TL;DR: The QR Algorithm was developed to find the eigen - values of real or complex matrices and it seems that necessary and sufficient conditions would be very complicated for a general matrix.
Abstract: The QR Algorithm was developed1 to find the eigen - values of real or complex matrices. We shall consider it here in the context of exact arithmetic. Sufficient conditions for convergence, listed in order of increasing strength, have been given.1,2,3,7 It seems that necessary and sufficient conditions would be very complicated for a general matrix.
3 citations