Crout matrix decomposition
id:
crout-matrix-decomposition-180-1402083
title:
Crout matrix decomposition
text:
In linear algebra, the Crout matrix decomposition is an LU decomposition which decomposes a matrix into a lower triangular matrix (L), an upper triangular matrix (U) and, although not always needed, a permutation matrix (P). It was developed by Prescott Durand Crout. The Crout matrix decomposition algorithm differs slightly from the Doolittle method. Doolittle's method returns a unit lower triangular matrix and an upper triangular matrix, while the Crout method returns a lower triangular matrix
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Crout_matrix_decomposition
date created:
2004-08-14T14:35:44Z
date modified:
2024-09-05T17:32:07Z
main entity:
{"identifier":"Q15924432","url":"https://www.wikidata.org/entity/Q15924432"}
image:
fields total:
13
integrity:
14