Question: Let R be an n n upper triangular matrix whose diagonal entries are all distinct. Let Rk denote the leading principal submatrix of R
(a) Use the result from Exercise 11 to derive an algorithm for finding the eigenvectors of R. The matrix U of eigenvectors should be upper triangular with l's on the diagonal.
(b) Show that the algorithm requires approximately n3/6 floating-point multiplications/divisions.
Step by Step Solution
3.40 Rating (156 Votes )
There are 3 Steps involved in it
a Algorithm for computing eigenvectors of an n n upper triangular ... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
949-M-L-A-E (998).docx
120 KBs Word File
