| Display title | Crout matrix decomposition |
| Default sort key | Crout Matrix Decomposition |
| Page length (in bytes) | 2,657 |
| Namespace ID | 0 |
| Page ID | 209445 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>JTerm |
| Date of page creation | 15:54, 21 December 2020 |
| Latest editor | imported>JTerm |
| Date of latest edit | 15:54, 21 December 2020 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | 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... |
