• Tidak ada hasil yang ditemukan

abs_vol19_pp121-128. 26KB Jun 04 2011 12:05:47 AM

N/A
N/A
Protected

Academic year: 2017

Membagikan "abs_vol19_pp121-128. 26KB Jun 04 2011 12:05:47 AM"

Copied!
1
0
0

Teks penuh

(1)

ELA

SIGN PATTERNS THAT REQUIRE OR ALLOW

POWER-POSITIVITY

MINERVA CATRAL†, LESLIE HOGBEN, D. D. OLESKY§, AND

P. VAN DEN DRIESSCHE¶

Abstract. A matrixAis power-positive if some positive integer power ofAis entrywise positive. A sign patternAis shown to require power-positivity if and only if eitherAor−Ais nonnegative and has a primitive digraph, or equivalently, eitherA or−A requires eventual positivity. A sign patternAis shown to be potentially power-positive if and only ifAor−Ais potentially eventually positive.

Key words. Power-positive matrix, Eventually positive matrix, Requires power-positivity, Potentially power-positive, Potentially eventually positive, Sign pattern.

AMS subject classifications.(2010) 15B48, 15B35, 05C50, 15A18.

Received by the editors November 12, 2009. Accepted for publication February 18, 2010.

Handling Editor: Michael J. Tsatsomeros.

Department of Mathematics, Iowa State University, Ames, IA 50011, USA

([email protected]).

Department of Mathematics, Iowa State University, Ames, IA 50011, USA ([email protected])

& American Institute of Mathematics, 360 Portage Ave, Palo Alto, CA 94306 ([email protected]).

§Department of Computer Science, University of Victoria, Victoria, BC V8W 3P6, Canada

([email protected]).

Department of Mathematics and Statistics, University of Victoria, Victoria, BC V8W 3R4,

Canada ([email protected]).

Electronic Journal of Linear Algebra ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 19, pp. 121-128, February 2010

Referensi

Dokumen terkait

In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m × n matrices and of square matrices with at least one zero row

For the Q -completion problem, sufficient conditions for a digraph to have Q -completion are given, necessary conditions for a digraph to have Q -completion are provided, and

The problem of finding the minimum rank (maximum nullity) of edge subdivisions of a given graph G is investigated.. Is is shown that if an edge is adjacent to a vertex of degree 1 or

Eventually nonnegative matrix, Eventually positive matrix, Eventually exponen- tially positive matrix, Exponentially positive matrix, Sign pattern, Perron-Frobenius.. AMS

Matrix functions, Generalization of nonnegative matrices, Eventually nonnegative matrices, Eventually positive matrices, Exponentially nonnegative matrices, Eventually exponen-

A key tool to obtain these bounds is using some Hermitian matrices which are, in the sense of Loewner matrix ordering, below the Hermitian part of A or, more generally, below

By a digraph we understand a finite directed graph with no multiple edges, but possibly loops.. We denote the

Also, it is proved that the bipartite graph or, equivalently, the zero pattern of a free matrix uniquely determines that of its Moore-Penrose inverse, and this mapping is