Separators and structure prediction in sparse orthogonal factorization
Open Access
- 1 September 1997
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 262, 83-97
- https://doi.org/10.1016/s0024-3795(97)80024-9
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination TreeJournal of Algorithms, 1995
- A separator theorem for graphs with an excluded minor and its applicationsPublished by Association for Computing Machinery (ACM) ,1990
- On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element MatricesSIAM Journal on Scientific and Statistical Computing, 1988
- Some nested dissection order is nearly optimalInformation Processing Letters, 1988
- A Data Structure for Sparse $QR$ and $LU$ FactorizationsSIAM Journal on Scientific and Statistical Computing, 1988
- The Null Space Problem II. AlgorithmsSIAM Journal on Algebraic Discrete Methods, 1987
- Computing a Sparse Basis for the Null SpaceSIAM Journal on Algebraic Discrete Methods, 1987
- Predicting fill for sparse orthogonal factorizationJournal of the ACM, 1986
- A separator theorem for graphs of bounded genusJournal of Algorithms, 1984
- Solution of sparse linear least squares problems using givens rotationsLinear Algebra and its Applications, 1980