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?

9/1/16 MATH 220 Watson I. Important Definitions a. Variable: Characteristic that changes from thing to thing b. Data sets can be: i. Numerical- Quantitative 1. Discrete- counting/integers (age rounded by years, no way to be more precise, whole numbers) 2. Continuous- measurement or...