class | advantages | disadvantages | minimal resources | algorithm |
---|---|---|---|---|
{@link numericalMethods.algebra.linear.decompose.LR}
|
· very fast · no additional resources · when successful gives determinant |
· does not decompose all regular matrices · no control on condition of triangular matrices |
· one matrix |
Gauss |
{@link numericalMethods.algebra.linear.decompose.PLR}
|
· fast · no additional resources · gives determinant |
· no control on condition of triangular matrices |
· one matrix · one vector |
Gauss with pivoting |
{@link numericalMethods.algebra.linear.decompose.QR}
|
· triangular matrix has never worse condition than original matrix · gives ||determinant|| |
· not very fast · sometimes not good-natured |
· two matrices |
Gram-Schmidt |
{@link numericalMethods.algebra.linear.decompose.Householder}
|
· always good-natured · few additional resources · works on non-square matrices (more rows than columns) · gives determinant |
· not very fast |
· one matrix · one vector · one temporary vector |
Householder |