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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call