Results 21 to 30 of about 27,057,635 (304)
matrix-toolbox/CHM_scripts: Sinkhorn Algorithm
, 2023 Several CHM matrices (M-scripts) obtained by the Sinkhorn Algorithm are ...
matrix-toolbox
core +1 more source
An inequality for the hadamard product of an M-matrix and an inverse M-matrix
Linear Algebra and its Applications, 1988 Let A and B be M-matrices and let \(A\circ B=[a_{ik}b_{ik}]\) be their Hadamard product. The authors obtain the following estimates from below for the smallest eigenvalue \(q(A\circ B^{-1}):\) \[ (a)\quad q(A\circ B^{-1})\geq (q(A)/q(B))(\min_ iu_ iv_ i/\sum_{i}u_ iv_ i), \] where u and v are the left and the right Perron eigenvectors of B ...
Fiedler, M., Markham, Thomas L.
openaire +2 more sources
The effective potential of an M-matrix [PDF]
Journal of Mathematical Physics, 2021 In the presence of a confining potential V, the eigenfunctions of a continuous Schrödinger operator −Δ + V decay exponentially with the rate governed by the part of V, which is above the corresponding eigenvalue; this can be quantified by a method of Agmon.
Marcel Filoche +2 more
openaire +3 more sources
ALGORITHMS FOR THE RICCATI EQUATION WITH A NONSINGULAR M-MATRIX
Annals of the Academy of Romanian Scientists Series on Mathematics and Its Application, 2023 We consider different algorithms with linear rate of convergence for computing the minimal nonnegative solution of M-matrix algebraic Riccati equation. The performance of the considered algorithms are illustrated on numerical examples.
Ivanov, Ivelin, Baeva, Neli
openaire +1 more source
New bounds for the minimum eigenvalue of M-matrices
Open Mathematics, 2016 Some new bounds for the minimum eigenvalue of M-matrices are obtained. These inequalities improve existing results, and the estimating formulas are easier to calculate since they only depend on the entries of matrices.
Wang Feng, Sun Deshu
doaj +1 more source
Color critical hypergraphs and forbidden configurations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 The present paper connects sharpenings of Sauer's bound on forbidden configurations with color critical hypergraphs. We define a matrix to be \emphsimple if it is a $(0,1)-matrix$ with no repeated columns.
Richard Anstee +3 more
doaj +1 more source
Matrix-vector representation of a directed graph.
, 2020 The matrix M and the vector v correspond to the edge set and the vertex set of the graph, respectively. An iteration of graph processing is represented as a matrix-vector multiplication with generalized operations.
Chiwan Park (8356896) +2 more
core +1 more source
Spektrum Laplace pada graf kincir angin berarah (Q_k^3)
Majalah Ilmiah Matematika dan Statistika, 2022 Suppose that 0 = µ0 ≤ µ1 ≤ ... ≤ µn-1 are eigen values of a Laplacian matrix graph with n vertices and m(µ0), m(µ1), …, m(µn-1) are the multiplicity of each µ, so the Laplacian spectrum of a graph can be expressed as a matrix 2 × n whose line elements ...
Melly Amaliyanah +2 more
doaj +1 more source
ON CAUCHY-TYPE BOUNDS FOR THE EIGENVALUES OF A SPECIAL CLASS OF MATRIX POLYNOMIALS
Ural Mathematical Journal, 2023 Let \(\mathbb{C}^{m\times m}\) be the set of all \(m\times m\) matrices whose entries are in \(\mathbb{C},\) the set of complex numbers. Then \(P(z):=\sum\limits_{j=0}^nA_jz^j,\) \(A_j\in \mathbb{C}^{m\times m},\) \(0\leq j\leq n\) is called a matrix ...
Zahid Bashir Monga, Wali Mohammad Shah
doaj +1 more source
Square matrices with the inverse diagonal property
Kuwait Journal of ScienceWe identify the class of real square invertible matrices A for which the signs of the diagonal entries of A−1 match those of A, and begin their study. We say such matrices have the inverse diagonal property (IDP).
Susana Furtado +3 more
doaj +1 more source