A basic decomposition result related to the notion of the rank of a matrix and applications.
Mortici, Cristinel (2003)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Displaying similar documents to “Term rank of 0, 1 matrices”
A basic decomposition result related to the notion of the rank of a matrix and applications.
The rank of the difference of similar matrices
Marques de Sá, Eduardo (1989)
Portugaliae mathematica
Similarity:
Gauss sums and the number of solutions to the matrix equation over
Philip Buckhiester (1973)
Acta Arithmetica
Similarity:
Uniqueness and independence of submatrices in solutions of matrix equations.
Tian, Y. (2003)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Chipman pseudoinverse of matrix, its computation and application in spline theory
Jitka Machalová (2000)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
Zero-term rank preservers of integer matrices
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.
Remarks on the Sherman-Morrison-Woodbury formulae
Miroslav Fiedler (2003)
Mathematica Bohemica
Similarity:
We present some results on generalized inverses and their application to generalizations of the Sherman-Morrison-Woodbury-type formulae.