Results 11 to 20 of about 1,572,263 (313)
Geometric aspects of the symmetric inverse M-matrix problem [PDF]
We investigate the symmetric inverse M-matrix problem from a geometric perspective. The central question in this geometric context is, which conditions on the k-dimensional facets of an n-simplex S guarantee that S has no obtuse dihedral angles. First we study the properties of an n-simplex S whose k-facets are all nonobtuse, and generalize some ...
Brandts, J., Cihangir, A.
openaire +6 more sources
Nonnegative alternating circulants leading to M-matrix group inverses [PDF]
Let \(\mathcal C\) denote the set of all irreducible nonnegative alternating circulant matrices, i.e. all matrices \(A= \sum^{n- 1}_{i= 0} \alpha_i P^i\), when \(P\) is an \(n\)th order cyclic permutation matrix, where \(\alpha_i> 0\) and \(\alpha_i= \alpha_j\) for \(i= j\pmod 2\).
Chen, Yonghong +2 more
openaire +3 more sources
Some inequalities for the Hadamard product of an M-matrix and an inverse M-matrix [PDF]
Abstract Let A and B be nonsingular M-matrices. Some new lower bounds on the minimum eigenvalue q ( A ∘ B − 1 )
Zhou, Duanmei +3 more
openaire +2 more sources
Some inequalities for the minimum eigenvalue of the Hadamard product of an M-matrix and an inverse M-matrix [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhao, Jianxing, Wang, Feng, Sang, Caili
openaire +3 more sources
By employing the notion of M-matrices and Banach's contraction mapping theorem, we provide complete characterisation of the existence and uniqueness of an equilibrium of a Cohen–Grossberg–Hopfield-type neural network endowed with multiple distributed ...
Israel Ncube
doaj +1 more source
On the coset duals of extended higher spin theories [PDF]
We study the holographic duality between the M x M matrix extension of Vasiliev higher spin theories on AdS3 and the large N limit of SU(N+M)/SU(N) x U(1) type cosets.
A Achucarro +59 more
core +1 more source
The symmetric M-matrix and symmetric inverse M-matrix completion problems
A partial matrix is a matrix in which some entries are specified and others are not. The completion problem for partial matrices consists in choosing values for the unspecified entries in such a way as the completed matrix belongs to a particular class of matrices. A partial \(n \times n\) matrix specifies a pattern (i.e.
openaire +5 more sources
Some convergent sequences of the lower bounds of the minimum eigenvalue for the Hadamard product of a nonsingular M-matrix B and the inverse of a nonsingular M-matrix A are given by using Brauer’s theorem.
Zhao Jianxing, Sang Caili
doaj +1 more source
On the Iterative Methods for the Solution of Three Types of Nonlinear Matrix Equations
In this paper, we investigate the iterative methods for the solution of different types of nonlinear matrix equations. More specifically, we consider iterative methods for the minimal nonnegative solution of a set of Riccati equations, a nonnegative ...
Ivan G. Ivanov, Hongli Yang
doaj +1 more source
On the Reductions and Classical Solutions of the Schlesinger equations [PDF]
The Schlesinger equations $S_{(n,m)}$ describe monodromy preserving deformations of order $m$ Fuchsian systems with $n+1$ poles. They can be considered as a family of commuting time-dependent Hamiltonian systems on the direct product of $n$ copies of $m ...
Dubrovin, B., Mazzocco, M.
core +3 more sources

