Write an algorithm for solving the tridiagonal system a1 b1 c1 a2 ... ... ... an1 bn1
Chapter 7, Problem 8(choose chapter or problem)
Write an algorithm for solving the tridiagonal system a1 b1 c1 a2 ... ... ... an1 bn1 cn1 an x1 x2 . . . xn1 xn = d1 d2 . . . dn1 dn by Gaussian elimination with the diagonal elements as pivots. How many additions/subtractions and multiplications/divisions are necessary?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer