7,114
edits
m (→Methods of solution: + also) 

Because <math> \begin{bmatrix} A \end{bmatrix} </math> is block tridiagonal and sparse, many methods of solution
have been developed to optimally solve this linear system for <math> \begin{bmatrix} U \end{bmatrix} </math>.
Among the methods are a generalized [[Thomas algorithm]], [[cyclic reduction]], [[successive overrelaxation]], and [[Fourier transform]]s. A theoretically optimal <math> O(n) </math> solution can also be computed using [[multigrid methods]].
== Applications ==
