About: Crout matrix decomposition

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Crout matrix decomposition Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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 and a unit upper triangular matrix. So, if a matrix decomposition of a matrix A is such that: A = LDU

Attributes	Values
rdfs:label	Crout matrix decomposition (en)
rdfs:comment	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 and a unit upper triangular matrix. So, if a matrix decomposition of a matrix A is such that: A = LDU (en)
sameAs	Crout matrix decomposition Crout matrix decomposition
dbp:wikiPageUsesTemplate	dbt:Reflist
Subject	Matrix decompositions
Link from a Wikipage to an external page	https://web.archive.org/web/20131003135132/http:/tutorialfrenzy.com/matlab-crout-lu-factorization-linear-equations-systems.php
gold:hypernym	Decomposition
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Crout_matrix_decomposition?oldid=956132782&ns=0
Wikipage page ID	900131 (xsd:integer)
page length (characters) of wiki page	2638 (xsd:nonNegativeInteger)
Wikipage revision ID	956132782 (xsd:integer)
Link from a Wikipage to another Wikipage	Algorithm Matrix decompositions Linear algebra Prescott Durand Crout Triangular matrix Permutation matrix LU decomposition Matrix (mathematics)
has abstract	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 and a unit upper triangular matrix. So, if a matrix decomposition of a matrix A is such that: A = LDU being L a unit lower triangular matrix, D a diagonal matrix and U a unit upper triangular matrix, then Doolittle's method produces A = L(DU) and Crout's method produces A = (LD)U. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Crout_matrix_decomposition
is Wikipage redirect of	Crout's Method Crout's algorithm Crout's method Crout decomposition
is Link from a Wikipage to another Wikipage of	Crout List of numerical analysis topics LU decomposition Crout's Method Crout's algorithm Crout's method Crout decomposition
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Crout_matrix_decomposition

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software