When Gaussian elimination without row interchanges is defined, an upper Hessenberg matrix needs at most one elimination per pivot column, because only its first subdiagonal can be nonzero. The LU decomposition has a unit lower bidiagonal matrix and an upper triangular matrix . If the input matrix is also symmetric, it is a tridiagonal matrix and is upper bidiagonal.
The nonzero-pivot condition is essential: is upper Hessenberg and invertible but has no such unpivoted LU decomposition. A pivoted factorization can still be computed, with its permutations recorded explicitly.

Articles by others on the same topic (0)

There are currently no matching articles.