Determinantal representation of inverses and solution of linear systems
Stanimirović, Predrag (1999)
Mathematica Slovaca
Similarity:
Stanimirović, Predrag (1999)
Mathematica Slovaca
Similarity:
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.
Gradimir V. Milovanović, Predrag Stanimirović (1997)
Publications de l'Institut Mathématique
Similarity:
Bapat, R.B., Zheng, Bing (2003)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Yunkun Chen, Xinghua Shi, Yi Min Wei (2016)
Czechoslovak Mathematical Journal
Similarity:
We extend Rump's verified method (S. Oishi, K. Tanabe, T. Ogita, S. M. Rump (2007)) for computing the inverse of extremely ill-conditioned square matrices to computing the Moore-Penrose inverse of extremely ill-conditioned rectangular matrices with full column (row) rank. We establish the convergence of our numerical verified method for computing the Moore-Penrose inverse. We also discuss the rank-deficient case and test some ill-conditioned examples. We provide our Matlab codes for...
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.
Stanimirović, Predrag, Stanković, Miomir (1994)
Matematichki Vesnik
Similarity: