You might consider the "QR algorithm": given A, factor A as QR (Q orthogonal and R triangular), then let A' = RQ. Repeat with A' as the new A, ad infinitum.
In a way, though, all implementable diagonalization algorithms are approximate, since it's impossible to diagonalize a general matrix in a finite number of elementary operations.
No comments:
Post a Comment