Convex Sets of Full Rank Matrices

Barbara Kołodziejczak () and Tomasz Szulc ()
Additional contact information
Barbara Kołodziejczak: Adam Mickiewicz University, Faculty of Mathematics and Computer Science
Tomasz Szulc: Adam Mickiewicz University, Faculty of Mathematics and Computer Science

A chapter in Developments in Reliable Computing, 1999, pp 359-364 from Springer

Abstract: Abstract Let A = (a ij ) and B = (b ij ) be n-by-m real matrices. Using the notion of a block P-matrix [2] we give a necessary and sufficient condition for the set r(A, B) (c(A, B), resp.) of n-by-m matrices whose rows (columns, resp.) are independent convex combinations of the rows (columns, resp.) of A and B to consist entirely of full row (column, resp.) rank matrices. This improves a result on the set r(A, B) (c(A, B), resp.) proven in [8]. Moreover, we also derive a sufficient condition for the interval of A and B, i.e., for the set i(A, B) of real n-by-m matrices (t ij a ij + (1 − t ij )b ij ) with t ij ∈ [0,1] to have the abovementioned rank property.

Keywords: full row rank; full column rank; set of matrices (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-017-1247-7_28

Ordering information: This item can be ordered from
http://www.springer.com/9789401712477

DOI: 10.1007/978-94-017-1247-7_28

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().