A Note on the Column Elimination Tree - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport Technique) Année : 2001

A Note on the Column Elimination Tree

Résumé

This short communication considers the LU factorization with partial pivoting and shows that an all-at-once result is possible for the structure prediction of the column dependencies in L and U. Specifically, we prove that for every square strong Hall matrix A there exists a permutation P such that every edge of its column elimination tree corresponds to a symbolic nonzero in the upper triangular factor U. In the symbolic sense, this resolves a conjecture of Gilbert and Ng [6].
Fichier principal
Vignette du fichier
RT-0251.pdf (235.42 Ko) Télécharger le fichier

Dates et versions

inria-00069923 , version 1 (19-05-2006)

Identifiants

  • HAL Id : inria-00069923 , version 1

Citer

John R. Gilbert, Laura Grigori. A Note on the Column Elimination Tree. [Technical Report] RT-0251, INRIA. 2001, pp.7. ⟨inria-00069923⟩
61 Consultations
346 Téléchargements

Partager

Gmail Facebook X LinkedIn More