Results 231 to 240 of about 1,573,587 (265)

A note on a criterion for M-matrix

Computational Mathematics and Modeling, 2009
There are many ways to characterize \(M\)-matrices. One of these is: a real \(n\times n\) matrix \(A\) is an \(M\)-matrix if and only if all its off-diagonal entries are \(\leq0\) and all leading principal minors are positive. The authors present a further criterion which may be simpler to verify.
Hashimoto, Tomoaki, Amemiya, Takashi
openaire   +2 more sources

M-matrix products having positive principal minors

Linear and Multilinear Algebra, 1984
Sufficient conditions are given for powers and products of M-matrices to have all principal minors positive. Several of these conditions involve directed graphs of the matrices. In particular we show that if A and B are irreducible M-matrices which have longest simple circuit of length two with A+B having no simple circuit longer than three, then the ...
Charles R. Johnson, D. D Olesky, P. van den Driessche   +2 more
openaire   +1 more source

Preconditioned AOR Iterative Method for M-Matrix

2013 Ninth International Conference on Computational Intelligence and Security, 2013
In this paper, we propose a new selection mode of 'r, t' for the preconditioner I+C and analyze the convergence performance of the preconditioned AOR iterative method induced by this preconditioner. For a nonsingular M-matrix, we show that the preconditioned AOR iterative method with this choice and the preconditioned methods advised by Evans et al ...
Qiufang Xue, Xingbao Gao, Xiaoguang Liu
openaire   +1 more source

Accurate Numerical Solution for Shifted M-Matrix Algebraic Riccati Equations

Journal of Scientific Computing, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Changli Liu, Jungong Xue, Ren-Cang Li
openaire   +2 more sources

Convergence of SSOR multisplitting method for an M-matrix

Journal of Applied Mathematics and Computing, 2007
The authors consider the multisplitting method and the relaxed multisplitting method for solving a linear system of equations with a large sparse \(M\)-matrix. They prove convergence results for both classes of methods under appropriate assumptions on the relaxation parameters.
Yun, Jae Heon, Han, Yu Du, Oh, Seyoung
openaire   +1 more source

K–M Matrix and Fermion Masses

Communications in Theoretical Physics, 1991
We discuss the relations between the K–M matrix and the masses of the quarks and leptons in the case of four generations, and give the exact expression of the K–M matrix in terms of the masses of quarks and leptons. The requirement that the theoretical and experimental values of the K–M ,matrix are consistent leads to an allowed range of quark masses ...
openaire   +1 more source

M-Matrix Properties

1989
We now proceed to consider some main properties of M-matrices. They are of general interest, and besides they bear some direct relationship to discretization methods as will be seen later on. Referring to the literature, we shall omit the proofs, which are far from being elementary.
openaire   +1 more source

Computing the Smallest Eigenvalue of an M-Matrix

SIAM Journal on Matrix Analysis and Applications, 1996
A computation of the smallest eigenvalue and the corresponding eigenvector of an irreducible nonsingular \(\text{M}\)-matrix \(A\) is considered. Section 2 introduces some lemmas for M-matrices. Sections 3 and 4 discuss perturbation theory for the eigenvalues and for each component of the corresponding eigenvector.
openaire   +1 more source

The M-Matrix Group Generalized Inverse Problem for Weighted Trees

SIAM Journal on Matrix Analysis and Applications, 1998
Summary: We characterize all weighted trees whose Laplacian has a group inverse which is an M-matrix. Actually, only a very narrow set of weighted trees yields such Laplacians. Our investigation involves analyzing circumstances under which a certain Z-matrix, derived from the tree and whose order is one less than the number of vertices in the tree, is ...
Kirkland, Stephen J., Neumann, Michael
openaire   +1 more source

Highly accurate doubling algorithms for M-matrix algebraic Riccati equations

Numerische Mathematik, 2016
This is about the minimal solution of the \(M\)-matrix algebraic Riccati equation (MARE) \(XDX - AX - XB + C = 0\), where \[ W=\begin{bmatrix} B & -D\\-C&A\end{bmatrix} \] is a nonsingular or an irreducible singular \(M\)-matrix. If an \(M\)-matrix \(S\) has a triplet representation \((N_S,u,v)\) with \(N_S=\mathrm{diag}(S)-S\), \(u>0\), and \(v=Su\geq
Xue, Jungong, Li, Ren-Cang
openaire   +1 more source