Factorability of general symmetric matrices
Rufus Oldenburger (1940)
Compositio Mathematica
Similarity:
Rufus Oldenburger (1940)
Compositio Mathematica
Similarity:
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.
Johnson, Charles R., Kroschel, Brenda K. (1996)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Lubomír Kubáček (1997)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
Meenakshi, Ar., Anandam, N. (1992)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Ondřej Došlý (1987)
Časopis pro pěstování matematiky
Similarity:
João Lita da Silva, António Manuel Oliveira (2009)
Discussiones Mathematicae Probability and Statistics
Similarity:
A matrix generalization of Kronecker's lemma is presented with assumptions that make it possible not only the unboundedness of the condition number considered by Anderson and Moore (1976) but also other sequences of real matrices, not necessarily monotone increasing, symmetric and nonnegative definite. A useful matrix decomposition and a well-known equivalent result about convergent series are used in this generalization.
Stuart, Jeffrey L. (1998)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity: