Header menu link for other important links
X
Tucker's theorem for almost skew-symmetric matrices and a proof of Farkas' lemma
Published in Elsevier Inc.
2015
Volume: 482
   
Pages: 55 - 69
Abstract
A real square matrix A is said to be almost skew-symmetric if its symmetric part has rank one. In this article certain fundamental questions on almost skew-symmetric matrices are considered. Among other things, necessary and sufficient conditions on the entries of a matrix in order for it to be almost skew-symmetric are presented. Sums and subdirect sums are studied. Certain new results for the Moore-Penrose inverse of an almost skew-symmetric matrix are proved. An interesting analogue of Tucker's theorem for skew-symmetric matrices is derived for almost skew-symmetric matrices. Surprisingly, this analogue leads to a proof of Farkas' lemma. © 2015 Elsevier Inc. All rights reserved.
About the journal
JournalData powered by TypesetLinear Algebra and Its Applications
PublisherData powered by TypesetElsevier Inc.
ISSN00243795
Open AccessYes
Concepts (7)
  •  related image
    Inverse problems
  •  related image
    FARKAS LEMMA
  •  related image
    MOORE-PENROSE INVERSE
  •  related image
    SKEW-SYMMETRIC MATRICES
  •  related image
    SUMS AND SUBDIRECTSUMS
  •  related image
    TUCKERS THEOREM
  •  related image
    Matrix algebra