A 1-norm bound for inverses of triangular matrices with monotone entries.
Page 1 Next
Berenhaut, Kenneth S., Guy, Richard T., Vish, Nathaniel G. (2008)
Banach Journal of Mathematical Analysis [electronic only]
Y. Vitek (1974/1975)
Numerische Mathematik
Brualdi, Richard A., Hwang, Suk-Geun (2005)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Mario Petrich, Pedro V. Silva (2001)
Czechoslovak Mathematical Journal
Let be the set of nonnegative integers and the ring of integers. Let be the ring of matrices over generated by the following two matrices: one obtained from the identity matrix by shifting the ones one position to the right and the other one position down. This ring plays an important role in the study of directly finite rings. Calculation of invertible and idempotent elements of yields that the subrings generated by them coincide. This subring is the sum of the ideal consisting of...
Länger, Helmut (1993)
Mathematica Pannonica
Nabben, Reinhard (2000)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Kirkland, S. (2004)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Štefan Schwarz (1986)
Mathematica Slovaca
Marcin Gąsiorek, Daniel Simson (2012)
Colloquium Mathematicae
A complete list of positive Tits-sincere one-peak posets is provided by applying combinatorial algorithms and computer calculations using Maple and Python. The problem whether any square integer matrix is ℤ-congruent to its transpose is also discussed. An affirmative answer is given for the incidence matrices and the Tits matrices of positive one-peak posets I.
José Luis Palacios (1986)
Časopis pro pěstování matematiky
Oepomo, Tedja Santanoe (2003)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Štefan Schwarz (1977)
Czechoslovak Mathematical Journal
Olga Taussky (1986)
Monatshefte für Mathematik
Israel Rocha, Vilmar Trevisan (2016)
Czechoslovak Mathematical Journal
The perturbed Laplacian matrix of a graph is defined as , where is any diagonal matrix and is a weighted adjacency matrix of . We develop a Fiedler-like theory for this matrix, leading to results that are of the same type as those obtained with the algebraic connectivity of a graph. We show a monotonicity theorem for the harmonic eigenfunction corresponding to the second smallest eigenvalue of the perturbed Laplacian matrix over the points of articulation of a graph. Furthermore, we use...
Costa, Cecília, Serôdio, Rogério (1999)
ETNA. Electronic Transactions on Numerical Analysis [electronic only]
Fumio Hiai, Dénes Petz (2006)
Banach Center Publications
Chong-Yun Chao, Shmuel Winograd (1977)
Czechoslovak Mathematical Journal
Dipak Jadhav, Rajendra Deore (2023)
Czechoslovak Mathematical Journal
We develop a geometric method for studying the spectral arbitrariness of a given sign pattern matrix. The method also provides a computational way of computing matrix realizations for a given characteristic polynomial. We also provide a partial answer to -conjecture. We determine that the -conjecture holds for the class of spectrally arbitrary patterns that have a column or row with at least nonzero entries.
Gassó Maria T., Torregrosa Juan R., Abad Manuel (2015)
Special Matrices
In this paperwe study the Hadamard product of inverse-positive matrices.We observe that this class of matrices is not closed under the Hadamard product, but we show that for a particular sign pattern of the inverse-positive matrices A and B, the Hadamard product A ◦ B−1 is again an inverse-positive matrix.
Jean-Marie Blin (1976)
RAIRO - Operations Research - Recherche Opérationnelle
Page 1 Next