Results 1 to 10 of about 52 (52)
Matrix Analysis for Continuous-Time Markov Chains
Special Matrices, 2021 Continuous-time Markov chains have transition matrices that vary continuously in time. Classical theory of nonnegative matrices, M-matrices and matrix exponentials is used in the literature to study their dynamics, probability distributions and other ...
Le Hung V., Tsatsomeros M. J.
doaj +1 more source
The Number of P-Vertices of Singular Acyclic Matrices: An Inverse Problem
Discussiones Mathematicae Graph Theory, 2020 Let A be a real symmetric matrix. If after we delete a row and a column of the same index, the nullity increases by one, we call that index a P-vertex of A.
Du Zhibin, da Fonseca Carlos M.
doaj +1 more source
M-matrix and inverse M-matrix extensions
Special Matrices, 2020 A class of matrices that simultaneously generalizes the M-matrices and the inverse M-matrices is brought forward and its properties are reviewed. It is interesting to see how this class bridges the properties of the matrices it generalizes and provides a
McDonald J.J. +6 more
doaj +1 more source
The Sinkhorn-Knopp algorithm: convergence and applications [PDF]
, 2006 . As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal scaling of A that is doubly stochastic.
Philip A. Knight, Knight, Philip A.
core +1 more source
A FAST ALGORITHM FOR MATRIX BALANCING [PDF]
, 2007 . As long as a square nonnegative matrix A contains sufficient nonzero elements, then the matrix can be balanced, that is we can find a diagonal scaling of A that is doubly stochastic.
Daniel Ruiz +3 more
core +1 more source
New upper bounds on the spectral radius of unicyclic graphs [PDF]
, 2008 G = (V (G),E(G)) be a unicyclic simple undirected graph with largest vertex degree . Let Cr be the unique cycle of G. The graph G − E(Cr ) is a forest of r rooted treesT1,T2, . . .,Tr with root vertices v1, v2, . . ., vr , respectively.
Rojo, Oscar
core +1 more source
The almost semimonotone matrices
Special Matrices, 2019 A (strictly) semimonotone matrix A ∈ ℝn×n is such that for every nonzero vector x ∈ ℝn with nonnegative entries, there is an index k such that xk > 0 and (Ax)k is nonnegative (positive).
Wendler Megan
doaj +1 more source
New error bounds for linear complementarity problems of Σ-SDD matrices and SB-matrices
Open Mathematics, 2019 A new error bound for the linear complementarity problem (LCP) of Σ-SDD matrices is given, which depends only on the entries of the involved matrices. Numerical examples are given to show that the new bound is better than that provided by García-Esnaola ...
Hou Zhiwu, Jing Xia, Gao Lei
doaj +1 more source
BelgeoThis article explores the biographical mobility and residential trajectories of three individuals identifying as queer and living in a housing cooperative – which will be referred to as Tossal –located in the ruins of a former factory on the margins of ...
Hugo Soucaze
doaj +1 more source
A Numerical Algorithm For Stable 2d Autoregressive Filter Design
, 2003 Based on previous theoretical results we present in this paper a global estimation scheme for solving the stable 2D autoregressive filter problem. The di#erent algorithms are based on the traditional Newton method and on the log barrier method that is ...
Jeffrey S. Geronimo +3 more
core