tridiagonal matrix algorithm
/T R IH1 D IY0 AE1 G AH0 N AH0 L M EY0 T R IH0 K S AE0 L G ER0 IH0 DH AH0 M/N
- 1
In numerical linear algebra, the tridiagonal matrix algorithm, also known as the Thomas algorithm (named after Llewellyn Thomas), is a simplified form of Gaussian elimination that can be used to solve tridiagonal systems of equations.
Translate “tridiagonal matrix algorithm” into another language
Choose a language below to open the translator with English selected as the source language.