PREDICTING STRUCTURE IN SPARSE-MATRIX COMPUTATIONS

被引：68
|
作者：
GILBERT, JR
机构：
[1] UNIV ICELAND,REYKJAVIK,ICELAND
[2] UNIV MINNESOTA,INST MATH & APPLICAT,MINNEAPOLIS,MN 55455
来源：
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS | 1994年 / 15卷 / 01期
关键词：
SPARSE MATRIX ALGORITHMS; GRAPH THEORY; MATRIX FACTORIZATION; SYSTEMS OF LINEAR EQUATIONS; EIGENVECTORS;
D O I：
10.1137/S0895479887139455
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Many sparse matrix algorithms-for example, solving a sparse system of linear equations-begin by predicting the nonzero structure of the output of a matrix computation from the nonzero structure of its input. This paper is a catalog of ways to predict nonzero structure. It contains known results for some problems, including various matrix factorizations, and new results for other problems, including some eigenvector computations.
引用
下载
收藏
页码：62 / 79
页数：18
相关论文
共 50 条
12345