INTEGER LU-FACTORIZATIONS

被引：6
|
作者：
BEVIS, JH
HALL, FJ
机构：
[1] Department of Mathematics, Computer Science Georgia State University Atlanta
来源：
LINEAR ALGEBRA AND ITS APPLICATIONS | 1991年 / 150卷
关键词：
D O I：
10.1016/0024-3795(91)90174-U
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let A be an m-by-n integer matrix and r = rank(A). A necessary and sufficient condition is given for A to have an integer LU-factorization, and a modification of Gaussian elimination is given for finding such factorizations when the first r leading principal minors are nonzero. An algorithm is given for ordering the vertices of a tree with a loop at its root so that its adjacency matrix has an integer LU-factorization.
引用
收藏
页码：267 / 285
页数：19
相关论文
共 50 条
12345