Homepage › Solution manuals › Gilbert Strang › Introduction to Linear Algebra › Exercise 2.6.20

Exercise 2.6.20

Answers

A tridiagonal $T$ has 2 nonzeros in the pivot row and only one nonzero below the pivot (one operation to find $ℓ$ and then one for the new pivot!). Only $2 n$ operations for elimination on a tridiagonal matrix. $T =$ bidiagonal $L$ times bidiagonal $U$ .

mathchakra

2021-12-20 21:14

Exercise 2.6.20

Answers

Comments

Add answer