An iterative algorithm for searching a scaling matrix for diagonal dominance
type: Item
instance of: scholarly article
title: An iterative algorithm for searching a scaling matrix for diagonal dominance
zbMATH Open document ID: 1073.65041
author: Ting-Zhu Huang
author: Cheng Li
published in: Applied Mathematics and Computation
publication date: 2005-06-13T00:00:00Z
review text: It is well known that a real (or complex) square matrix \(A\) is an \(M\)-matrix (or \(H\)-matrix) if and only if there exists a positive diagonal matrix \(D\) such that \(AD\) is strictly diagonally dominant. The paper introduces a convergent iteration algorithm to compute the scaling matrix \(D\) for irreducible \(M\) (or \(H\)) matrices.
reviewed by: F. Szidarovszky
Mathematics Subject Classification ID: 65F35
Mathematics Subject Classification ID: 65F30
Mathematics Subject Classification ID: 15A12
zbMATH DE Number: 2175200
zbMATH Keywords: Scaling
zbMATH Keywords: Diagonal dominance
zbMATH Keywords: \(H\)-matrix
zbMATH Keywords: \(M\)-matrix
zbMATH Keywords: Iterative algorithm
MaRDI profile type: Publication
full work available at URL: j.amc.2004.06.101
OpenAlex ID: W1981202521
cites work: Q4326384
cites work: A note on generalized diagonally dominant matrices
cites work: A lower bound for the smallest singular value of a matrix
cites work: On diagonal dominance arguments for bounding \(\| A^{-1}\|_\infty\)
cites work: \(\| A^{-1} \|_\infty\) and equidiagonal-dominance
DOI: 10.1016/J.AMC.2004.06.101
description: scientific article; zbMATH DE number 2175200