Computing Row and Column Counts for Sparse QR and LU Factorization

被引：0
|
作者：
J. R. Gilbert
X. S. Li
E. G. Ng
B. W. Peyton
机构：
[1] Xerox Palo Alto Research Center,National Energy Research Scientific Computing Division
[2] Lawrence Berkeley National Laboratory,Computer Science and Mathematics Division
[3] Oak Ridge National Laboratory,undefined
来源：
BIT Numerical Mathematics | 2001年 / 41卷
关键词：
Sparse ; and ; factorizations; column elimination tree; row and column counts; disjoint set union;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We present algorithms to determine the number of nonzeros in each row and column of the factors of a sparse matrix, for both the QR factorization and the LU factorization with partial pivoting. The algorithms use only the nonzero structure of the input matrix, and run in time nearly linear in the number of nonzeros in that matrix. They may be used to set up data structures or schedule parallel operations in advance of the numerical factorization.
引用
收藏
页码：693 / 710
页数：17
相关论文
共 50 条
12345