Question: Let A be the n n tridiagonal matrix with all its diagonal entries equal to c and all 1 's on the sub- and

Let A be the n × n tridiagonal matrix with all its diagonal entries equal to c and all 1 's on the sub- and super-diagonals.
(a) For which values of c is A diagonally dominant?
(b) For which values of c does the Jacobi iteration for A u = b converge to the solution? What is the rate of convergence? Use Exercise 8.2.48.
(c) Set c = 2 and use the Jacobi method to solve the linear systems Ku = e1, for n = 5, 10, and 20. Starting with an initial guess of 0, how many Jacobi iterations does it take to obtain 3 decimal place accuracy? Does the convergence rate agree with what you computed in part (c)?

Step by Step Solution

3.30 Rating (174 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a c 2 b If c 0 then D c I O and Jacobi iteration isnt even defined Otherwise T D 1 L U is tridiagona... 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

952-M-L-A-E (3030).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!