abs_vol17_pp287-303. 28KB Jun 04 2011 12:05:46 AM
Teks penuh
Dokumen terkait
In this article a fast computational method is provided in order to calculate the Moore-Penrose inverse of full rank m × n matrices and of square matrices with at least one zero row
In this paper, lower bounds are provided for the dimensions of linearizations and strong linearizations of a given m × n matrix polynomial, and particular lineariza- tions
Stochastic and doubly stochastic matrices are also constructed with a given spectrum and with any legitimately prescribed elementary divisors..
result and known Perron-Frobenius theory of eventually nonnegative matrices are used to establish an algorithm to determine whether a matrix is strongly eventually nonnegative (i.e.,
This paper considers the maximum value of the permanent over the class H (m, n) of n × n Hessenberg, (0, 1)-matrices with m 1’s, and shows that among those matrices that attain
purpose of this paper is to give some necessary and sufficient conditions for the existence and the representations of the group inverse of the block matrix A C..
In Section 3 it is shown that the same situation holds for the nonnegative P0-matrix completion problem, that is, a pattern for n × n matrices that includes all diagonal positions
Applying the properties of the Hadamard core for totally nonnegative matrices, we obtain the Schur complement inequalities for the Hadamard product of totally nonnegative
