• Tidak ada hasil yang ditemukan

abs_vol18_pp146_161. 24KB Jun 04 2011 12:05:46 AM

N/A
N/A
Info
Unduh - Bebas
Protected

Academic year: 2017

Membagikan "abs_vol18_pp146_161. 24KB Jun 04 2011 12:05:46 AM"

Copied!
1
0
0

Memuat.... (Lihat teks lengkap sekarang)

Unduh sekarang ( 1 Halaman )

Teks penuh

(1)

ELA

TOTALLY POSITIVE COMPLETIONS FOR MONOTONICALLY

LABELED BLOCK CLIQUE GRAPHS

∗

CHARLES R. JOHNSON† AND CRIS NEGRON‡

Abstract. It is shown that if the connected graph of the specified entries of a combinatorially symmetric, partial totally positive matrix is monotonically labeled block clique, then there is a totally positive completion. Necessarily the completion strategy is very different from and more complicated than the known totally nonnegative one. The completion preserves symmetry and can be used to solve some non-connected or rectangular, nonsymmetric completion problems.

Key words.Totally positive matrix completion problems, Partial matrix, Monotonically labeled block clique graph.

AMS subject classifications.15A15, 15A57, 05C50.

∗ Received by the editors September 24, 2007. Accepted for publication February 24, 2009.

Handling Editor: Ravindra B. Bapat. This research was supported by NSF grant DMS-03-53510.

†Department of Mathematics, College of William and Mary, Williamsburg, Virginia 23187, USA

([email protected]).

‡Department of Mathematics, University of Virginia, Charlottesville, Virginia 22903, USA

([email protected]).

Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 18, pp. 146-161, March 2009

Referensi

Unduh sekarang ( PDF - 1 Halaman - 24.29 KB )

Dokumen terkait

abs_vol17_pp376-388. 24KB Jun 04 2011 12:05:46 AM

Strongly quadrangular matrices have been introduced in the study of the combi- natorial properties of unitary matrices.. However, the converse is not

abs_vol18_pp117-125. 30KB Jun 04 2011 12:05:46 AM

In this paper, necessary and sufficient conditions are given for the existence of the group inverse of the block matrix A A..

abs_vol22_pp389-418. 29KB Jun 04 2011 12:05:49 AM

Combinatorial matrix theory, Inertia, Inverse eigenvalue problem, Inverse inertia problem, Graph, Minimum positive semidefinite rank, Minimum rank, Nil vertex, Symmetric.. AMS

vol10_pp257-271. 221KB Jun 04 2011 12:05:50 AM

Let Q be a pattern that has weakly sign symmetric P -completion, where for any partial weakly sign symmetric P -matrix specifying Q , there is a weakly sign symmetric P -completion

vol14_pp02-11. 161KB Jun 04 2011 12:05:54 AM

Schur complement, LU factorization, Bipartite graph, Sign pattern, Zero pattern, Nearly reducible matrix, Minimally strongly connected digraph.. AMS

vol20_pp691-716. 238KB Jun 04 2011 12:06:10 AM

Minimum rank, Symmetric matrix, Finite field, Projective geometry, Polarity.. graph, Bilinear

vol22_pp125-137. 136KB Jun 04 2011 12:06:11 AM

In the case of a partial TP matrix, the graph of whose specified entries is a sym- metrically placed cycle, as given in (1.1), the necessary conditions for a TP completion are the

getdocf93c. 288KB Jun 04 2011 12:05:13 AM

Key words: Large dimensional random matrix, eigenvalues, circulant matrix, symmetric circu- lant matrix, reverse circulant matrix, k circulant matrix, empirical spectral