A new iterative criterion for H-matrices: The reducible case

dc.creator	Alanelli, M.	en
dc.creator	Hadjidimos, A.	en
dc.date.accessioned	2015-11-23T10:21:55Z
dc.date.available	2015-11-23T10:21:55Z
dc.date.issued	2008
dc.identifier	10.1016/j.laa.2007.12.020
dc.identifier.issn	0024-3795
dc.identifier.uri	http://hdl.handle.net/11615/25430
dc.description.abstract	H-matrices appear in various areas of science and engineering and it is of vital importance to have an Algorithm to identify the H-matrix character of a certain matrix A epsilon C-n,C-n. Recently, the present authors have proposed a new iterative criterion (Algorithm AH) to completely identify the H-matrix property of an irreducible matrix. The present work extends the previous Algorithm to cover the reducible case as well. (C) 2008 Elsevier Inc. All rights reserved.	en
dc.source	Linear Algebra and Its Applications	en
dc.source.uri	<Go to ISI>://WOS:000256392900030
dc.subject	M- and H-matrices	en
dc.subject	(generalized) strictly diagonally dominant matrices	en
dc.subject	criteria for H-matrices	en
dc.subject	DIAGONALLY DOMINANT MATRICES	en
dc.subject	Mathematics, Applied	en
dc.subject	Mathematics	en
dc.title	A new iterative criterion for H-matrices: The reducible case	en
dc.type	journalArticle	en

Αρχεία σε αυτό το τεκμήριο

Αρχεία	Μέγεθος	Τύπος	Προβολή
Δεν υπάρχουν αρχεία που να σχετίζονται με αυτό το τεκμήριο.