Article ID Journal Published Year Pages File Type
473543 Computers & Mathematics with Applications 2008 6 Pages PDF
Abstract

Recently, some iterative algorithms have been provided for identifying H-matrices, but most of these methods need to take an arbitrary parameter εε into account, and it seems hard and complicated to decide the optimum value of εε. In this paper, we propose an improved non-parameter algorithm, which is always convergent in finite iterative steps for H-matrices and needs fewer number of iterations than earlier ones, the new method is also suited for reducible case. Several numerical examples for the effectiveness of the proposed algorithm are presented.

Related Topics
Physical Sciences and Engineering Computer Science Computer Science (General)
Authors
, ,