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

Let R be an n × n upper triangular matrix whose diagonal entries are all distinct. Let Rk denote the leading principal submatrix of R of order k and set U1 = (1).
(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

1 Expert Approved Answer
Step: 1 Unlock

a Algorithm for computing eigenvectors of an n n upper triangular ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

949-M-L-A-E (998).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!