Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

This project computes the two largest eigenvalues of a 50x50 matrix. You will use the usual Power Method to compute the largest eigenvalue. For the

image text in transcribed

This project computes the two largest eigenvalues of a 50x50 matrix. You will use the usual Power Method to compute the largest eigenvalue. For the next largest eigenvalue, you can use an Annihilation or Deflation or Shifting technique" discussed in class and also in our book. The matrix A is tridiagonal. Its main diagonal has ones on it. The super diagonal (the diagonal above the main diagonal) has negative-ones on it. The sub-diagonal (below the main diagonal) has negative-ones also. Our starting vector x, has all ones. Our tolerance is 0.01. Turn in the following on one page 1) Draw Gershgorin Circles that contain the eigenvalues of A. 2) Based on part (1), what is the spectral radius of A. Print your answer here: 3) With a starting vector X=[1 1 1 1....1]', apply the usual power method to estimate 2mux , the dominant- eigenvalue of matrix A. Use a tolerance of 0.01. Print your answer with 4 decimals: 4) Print the number of iterations required to converge. 5) Use the deflation technique discussed in class to compute the second largest eigenvalue. Tolerance = 0.01 Print the second largest eigenvalue with 4 decimals: 6) Print the number of iterations required to converge. 7) Print your computer program here. As discussed in class, the main body of your program is 3 lines, so your program should not be long. This project computes the two largest eigenvalues of a 50x50 matrix. You will use the usual Power Method to compute the largest eigenvalue. For the next largest eigenvalue, you can use an Annihilation or Deflation or Shifting technique" discussed in class and also in our book. The matrix A is tridiagonal. Its main diagonal has ones on it. The super diagonal (the diagonal above the main diagonal) has negative-ones on it. The sub-diagonal (below the main diagonal) has negative-ones also. Our starting vector x, has all ones. Our tolerance is 0.01. Turn in the following on one page 1) Draw Gershgorin Circles that contain the eigenvalues of A. 2) Based on part (1), what is the spectral radius of A. Print your answer here: 3) With a starting vector X=[1 1 1 1....1]', apply the usual power method to estimate 2mux , the dominant- eigenvalue of matrix A. Use a tolerance of 0.01. Print your answer with 4 decimals: 4) Print the number of iterations required to converge. 5) Use the deflation technique discussed in class to compute the second largest eigenvalue. Tolerance = 0.01 Print the second largest eigenvalue with 4 decimals: 6) Print the number of iterations required to converge. 7) Print your computer program here. As discussed in class, the main body of your program is 3 lines, so your program should not be long

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Marketing Research

Authors: David A. Aaker, V. Kumar , George S. Day

8th Edition

047123057X, 9780471230571

More Books

Students also viewed these Accounting questions