کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4635929 1340716 2006 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A new algorithmic characterization of H-matrices
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
A new algorithmic characterization of H-matrices
چکیده انگلیسی

An algorithmic characterization of H-matrices was provided by Huang et al. [Comput. Math. Appl. 48 (2004) 1587–1601]. In this paper, we propose a new non-parameter method, which is always convergent in finite iterative steps for H-matrices and needs fewer number of iterations than that of Huang et al.; we also provide an improved algorithm for a general matrix, which decreases the wasteful computations when the given matrix is not an H-matrix. Several numerical examples for the effectiveness of the proposed algorithms are presented.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 183, Issue 1, 1 December 2006, Pages 603–609
نویسندگان
, ,