A polynomial time spectra decomposition test for certain classes of inverse M-matrices.
Stuart, Jeffrey L. (1998)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Algorithm of -factorization of rational matrices with zeros and poles on the imaginary axis.”
A polynomial time spectra decomposition test for certain classes of inverse M-matrices.
A method of inverting matrices
Olga Porkorná (1970)
Aplikace matematiky
Similarity:
The recurrent calculation of the inversion of a special class of matrices
František Mikloško (1978)
Banach Center Publications
Similarity:
Numerically stable algorithm for pole assignment of linear single-input systems
Petko Hr. Petkov, Nicolai D. Christov, Michail M. Konstantinov (1986)
Kybernetika
Similarity:
Intervals of certain classes of Z-matrices
M. Rajesh Kannan, K.C. Sivakumar (2014)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
Let A and B be M-matrices satisfying A ≤ B and J = [A,B] be the set of all matrices C such that A ≤ C ≤ B, where the order is component wise. It is rather well known that if A is an M-matrix and B is an invertible M-matrix and A ≤ B, then aA + bB is an invertible M-matrix for all a,b > 0. In this article, we present an elementary proof of a stronger version of this result and study corresponding results for certain other classes as well.