Generating potentially nilpotent full sign patterns

I.J. Kim, D.D. Olesky, B.L. Shader, P. Driessche, van den, H. Holst, van der, K.N. Vander Meulen

Research output: Contribution to journalArticleAcademicpeer-review

25 Citations (Scopus)
154 Downloads (Pure)

Abstract

A sign pattern is a matrix with entries in {+,-, 0}. A full sign pattern has no zero entries. The refined inertia of a matrix pattern is defined and techniques are developed for constructing potentially nilpotent full sign patterns. Such patterns are spectrally arbitrary. These techniques can also be used to construct potentially nilpotent sign patterns that are not full, as well as potentially stable sign patterns.
Original languageEnglish
Pages (from-to)162-175
JournalElectronic Journal of Linear Algebra
Volume18
Publication statusPublished - 2009

Fingerprint

Dive into the research topics of 'Generating potentially nilpotent full sign patterns'. Together they form a unique fingerprint.

Cite this