Skip to Main content Skip to Navigation
Reports

A Note on the Column Elimination Tree

John R. Gilbert Laura Grigori 1
1 RESEDAS - Software Tools for Telecommunications and Distributed Systems
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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].
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00069923
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 6:35:37 PM
Last modification on : Friday, February 26, 2021 - 3:28:07 PM
Long-term archiving on: : Saturday, April 3, 2010 - 11:26:01 PM

Identifiers

  • HAL Id : inria-00069923, version 1

Collections

Citation

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

Share

Metrics

Record views

168

Files downloads

437