Results 21 to 30 of about 1,610,795 (266)
A faster algorithm for identification of an M-Matrix
Summary: \(M\)-matrices are important in the consideration of rates of convergence of iterative methods for solving large systems of equations and are applicable in areas such as input-output systems in economic modelling, queuing theory, and engineering. The usual definition of an \(M\)-matrix has, among other requirements, that it must be nonsingular
Wood, R. J., O'Neill, M. J.
openaire +3 more sources
Spektrum Laplace pada graf kincir angin berarah (Q_k^3)
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
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
We 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
A new eigenvalue bound for the Hadamard product of an M-matrix and an inverse M-matrix
If A and B are nn nonsingular M-matrices, a new lower bound for the minimum eigenvalue (AB 1 ) for the Hadamard product of A and B 1 is derived. This bound improves the result of (R. Huang. Some inequalities for the Hadamard product and the Fan product of matrices. Linear Algebra Appl., 428:1551-1559, 2008.).
Fubin Chen, Yaotang Li, Defeng Wang
openaire +1 more source
Confinement/deconfinement transition in the D0-brane matrix model — A signature of M-theory?
We study the confinement/deconfinement transition in the D0-brane matrix model (often called the BFSS matrix model) and its one-parameter deformation (the BMN matrix model) numerically by lattice Monte Carlo simulations.
Monte Carlo String/M-theory collaboration (MCSMC) +8 more
doaj +1 more source
ON $M$-MATRIX AND INVERSE $M$-MATRIX COMPLETION PROBLEMS
Matrix completion problems play a crucial role in situations where only partial information about a matrix is known, but the complete matrix must satisfy specific structural and spectral properties. These problems aim to determine how to complete such incomplete matrices while preserving desired characteristics.
null N. S. Minikumari +4 more
openaire +1 more source
Estimates for the minimum eigenvalue of an M-matrix
Abstract New sharper lower bounds for the minimal eigenvalues of symmetric M-matrices and nonsymmetric M-matrices are proposed by constructing two increasing sequences. By contrasting the proposed instances with the related findings, two instances are offered to demonstrate the effectiveness of the technique.
Qin Zhong, Ling Li
openaire +1 more source
A Graph Classification Method Based on Support Vector Machines and Locality-Sensitive Hashing
Graphs classification is a relevant problem that arises in many disciplines. Using graphs directly instead of vectorization allows exploiting the intrinsic representations of the data.
Maria D. Gonzalez-Lima +2 more
doaj +1 more source
Several new inequalities for the minimum eigenvalue of M-matrices
Several convergent sequences of the lower bounds for the minimum eigenvalue of M-matrices are given. It is proved that these sequences are monotone increasing and improve some existing results.
Jianxing Zhao, Caili Sang
doaj +1 more source

