On the partial ordering of almost definite matrices
Ar. Meenakshi (1989)
Czechoslovak Mathematical Journal
Similarity:
Ar. Meenakshi (1989)
Czechoslovak Mathematical Journal
Similarity:
Seok-Zun Song, Young-Bae Jun (2006)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
The zero-term rank of a matrix is the minimum number of lines (row or columns) needed to cover all the zero entries of the given matrix. We characterize the linear operators that preserve the zero-term rank of the m × n integer matrices. That is, a linear operator T preserves the zero-term rank if and only if it has the form T(A)=P(A ∘ B)Q, where P, Q are permutation matrices and A ∘ B is the Schur product with B whose entries are all nonzero integers.
Štefan Schwarz (1985)
Mathematica Slovaca
Similarity:
Cao, Chongguang, Tang, Xiaomin (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Kalinowski, Józef (2009)
Beiträge zur Algebra und Geometrie
Similarity:
Beasley, LeRoy B. (1999)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Marques de Sá, Eduardo (1989)
Portugaliae mathematica
Similarity:
Duanmei Zhou, Guoliang Chen, Jiu Ding (2017)
Open Mathematics
Similarity:
Let A = PQT, where P and Q are two n × 2 complex matrices of full column rank such that QTP is singular. We solve the quadratic matrix equation AXA = XAX. Together with a previous paper devoted to the case that QTP is nonsingular, we have completely solved the matrix equation with any given matrix A of rank-two.