A new iterative criterion for H-matrices: The reducible case
نویسندگان
چکیده
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 ∈ Cn,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. © 2008 Elsevier Inc. All rights reserved. AMS classification: Primary 65F10
منابع مشابه
A new non-parameter criterion for H-matrices
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 ...
متن کاملComputing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method
A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...
متن کاملFinite iterative methods for solving systems of linear matrix equations over reflexive and anti-reflexive matrices
A matrix $Pintextmd{C}^{ntimes n}$ is called a generalized reflection matrix if $P^{H}=P$ and $P^{2}=I$. An $ntimes n$ complex matrix $A$ is said to be a reflexive (anti-reflexive) matrix with respect to the generalized reflection matrix $P$ if $A=PAP$ ($A=-PAP$). In this paper, we introduce two iterative methods for solving the pair of matrix equations $AXB=C$ and $DXE=F$ over reflexiv...
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of the ...
متن کاملOPTIMAL ANALYSIS OF NON-REGULAR GRAPHS USING THE RESULTS OF REGULAR MODELS VIA AN ITERATIVE METHOD
In this paper an efficient method is developed for the analysis of non-regular graphs which contain regular submodels. A model is called regular if it can be expressed as the product of two or three subgraphs. Efficient decomposition methods are available in the literature for the analysis of some classes of regular models. In the present method, for a non-regular model, first the nodes of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008