A fast and stable test to check if a weakly diagonally dominant matrix is a nonsingular M-matrix

DOI10.1090/mcom/3347zbMath1404.65029arXiv1701.06951OpenAlexW2774833929MaRDI QIDQ4561372

Parsiad Azimzadeh

Publication date: 5 December 2018

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.06951

zbMATH Keywords

\(M\)-matrixsparse matrixsubstochastic matrixdiagonally dominantweakly chained diagonally dominant

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Inequalities involving eigenvalues and eigenvectors (15A42) Positive matrices and their generalizations; cones of matrices (15B48) Stochastic matrices (15B51)

Related Items

A fixed-point policy-iteration-type algorithm for symmetric nonzero-sum stochastic impulse control games ⋮ High Order Bellman Equations and Weakly Chained Diagonally Dominant Tensors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some new inequalities for the minimum eigenvalue of \(M\)-matrices
• Several new inequalities for the minimum eigenvalue of \(M\)-matrices
• Weakly chained diagonally dominant \(B\)-matrices and error bounds for linear complementarity problems
• The infinity norm bound for the inverse of nonsingular diagonal dominant matrices
• An upper bound for \(\| A^{-1}\|_{\infty}\) of strictly diagonally dominant \(M\)-matrices
• An upper bound for \(\| A^{-1} \|_\infty \) of strictly diagonally dominant \(M\)-matrices
• Estimation of \(\| A^{-1}\| _\infty \) for weakly chained diagonally dominant \(M\)-matrices
• M-matrix characterizations. I: nonsingular M-matrices
• A new upper bound for \(\|A^{-1}\|\) of a strictly \(\alpha\)-diagonally dominant \(M\)-matrix
• Inequalities for the minimum eigenvalue of doubly strictly diagonally dominant \(M\)-matrices
• Weakly Chained Matrices, Policy Iteration, and Impulse Control
• New inequalities for the minimum eigenvalue ofM-matrices
• Subdirect sums of weakly chained diagonally dominant matrices
• The Accuracy of Floating Point Summation
• Some Convergence Results for Howard's Algorithm
• A stable test to check if a matrix is a nonsingular $M$-matrix
• On Two-Sided Bounds Related to Weakly Diagonally Dominant M-Matrices with Application to Digital Circuit Dynamics
• On a Finite Difference Analogue of an Elliptic Boundary Problem which is Neither Diagonally Dominant Nor of Non‐negative Type
• A Sufficient Condition for Nonvanishing of Determinants