Minimum-rank matrices with prescribed graph

被引：51

作者：

Nylen, PM

机构：

[1] Department of Mathematics, Auburn University, Auburn

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 1996年 / 248卷

关键词：

D O I：

10.1016/0024-3795(95)00238-3

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We study properties of real symmetric matrices with prescribed graph and lowest possible rank. We concentrate on the case where the graph is a tree and give an algorithm for computing the minimum possible rank in this case. A more general problem is also considered.

引用

页码：303 / 316

页数：14

共 10 条

[1]

[Anonymous], LINEAR MULTILINEAR A

[2]

BARRETT WW, 1991, LINEAR MULTLINEAR AL, V30, P13

[3] CONSTRUCTION OF ACYCLIC MATRICES FROM SPECTRAL DATA [J].

DUARTE, AL .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1989, 113 :173-182

[4]

FIEDLER M, 1975, CZECH MATH J, V25, P607

[5]

FRIEDLAND S, 1972, ISRAEL J MATH, V1, P184

[6]

FURTH D, 1989, LINEAR MULTILINEAR A, V25, P191

[7]

GENIN J, 1974, J MATH ANAL APPL, V45, P646

[8]

Horn RA., 1985, Matrix Analysis, P257

[9] ON THE EIGENVALUES AND EIGENVECTORS OF A CLASS OF MATRICES [J].

PARTER, S .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1960, 8 (02) :376-388

[10] SPECTRAL MULTIPLICITY AND SPLITTING RESULTS FOR A CLASS OF QUALITATIVE MATRICES [J].

WIENER, G .

LINEAR ALGEBRA AND ITS APPLICATIONS, 1984, 61 (SEP) :15-29

← 1 →