Practical Criteria for H-Matrices

2014 ◽  
Vol 1049-1050 ◽  
pp. 1316-1319
Author(s):  
Ming Da Zhang
Keyword(s):  
Matrix Theory ◽  
Sufficient Conditions ◽  
Diagonal Dominance ◽  
Diagonally Dominant Matrices ◽  
Diagonally Dominant Matrix ◽  
Diagonally Dominant ◽  
Strictly Diagonally Dominant Matrix ◽  
Dominant Matrix

Generalized strictly diagonally dominant matrix is very important in computing mathematics and matrix theory, many articles are searching simple and practical identification of generalized strictly diagonally dominant matrix. In this paper, using the concept of diagonal dominance, some sufficient conditions for generalized strictly diagonally dominant matrices are given.

Sufficient Conditions of H-Matrix

2014 ◽  
Vol 651-653 ◽  
pp. 2207-2210
Author(s):  
Ming Da Zhang
Keyword(s):  
Matrix Theory ◽  
Sufficient Conditions ◽  
Diagonal Dominance ◽  
Diagonally Dominant Matrices ◽  
Diagonally Dominant Matrix ◽  
Diagonally Dominant ◽  
Strictly Diagonally Dominant Matrix ◽  
Dominant Matrix

Generalized strictly diagonally dominant matrix is very important in computing mathematics and matrix theory, many articles are searching simple and practical identification of generalized strictly diagonally dominant matrix. In this paper, using the concept of diagonal dominance, some sufficient conditions for generalized strictly diagonally dominant matrices are given.

scholarly journals Improving Results on Convergence of AOR Method

2012 ◽  
Vol 2012 ◽  
pp. 1-16
Author(s):  
Guangbin Wang ◽  
Ting Wang ◽  
Yanli Du
Keyword(s):  
Sufficient Conditions ◽  
Numerical Examples ◽  
Diagonally Dominant Matrix ◽  
Aor Method ◽  
Diagonally Dominant ◽  
Dominant Matrix

We present some sufficient conditions on convergence of AOR method for solvingAx=bwithAbeing a strictly doublyαdiagonally dominant matrix. Moreover, we give two numerical examples to show the advantage of the new results.

scholarly journals Refinement of Multiparameters Overrelaxation (RMPOR) Method

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Gashaye Dessalew ◽  
Tesfaye Kebede ◽  
Gurju Awgichew ◽  
Assaye Walelign
Keyword(s):  
Positive Definite Matrix ◽  
Positive Definite ◽  
Symmetric Positive Definite Matrix ◽  
Convergence Properties ◽  
Linear System Of Equations ◽  
Symmetric Positive Definite ◽  
Diagonally Dominant Matrix ◽  
Diagonally Dominant ◽  
Strictly Diagonally Dominant Matrix ◽  
Dominant Matrix

In this paper, we present refinement of multiparameters overrelaxation (RMPOR) method which is used to solve the linear system of equations. We investigate its convergence properties for different matrices such as strictly diagonally dominant matrix, symmetric positive definite matrix, and M-matrix. The proposed method minimizes the number of iterations as compared with the multiparameter overrelaxation method. Its spectral radius is also minimum. To show the efficiency of the proposed method, we prove some theorems and take some numerical examples.

scholarly journals Characterization of diagonally dominant H-matrices

2017 ◽  
Vol 101 (115) ◽  
pp. 65-73
Author(s):  
Nenad Moraca
Keyword(s):  
Diagonal Dominance ◽  
Diagonally Dominant Matrix ◽  
Diagonally Dominant ◽  
Dominant Matrix ◽  
Equivalent Conditions

We show that the diagonal dominance nonsingularity result of Shivakumar and Chew from 1974, and the diagonal dominance nonsingularity result of Farid from 1995, and the result of Huang on characterization of diagonally dominant H-matrices from 1995, all proven independently and in different contexts are, in fact, equivalent. We also offer the fourth and the fifth simpler equivalent conditions, for a diagonally dominant matrix to be an H-matrix.

scholarly journals Convergence on Gauss-Seidel iterative methods for linear systems with general H-matrices

2015 ◽  
Vol 30 ◽  
pp. 843-870 ◽  
Author(s):  
Cheng-yi Zhang ◽  
Dan Ye ◽  
Cong-Lei Zhong ◽  
SHUANGHUA SHUANGHUA
Keyword(s):  
Linear Systems ◽  
Iterative Methods ◽  
Sufficient Conditions ◽  
Numerical Linear Algebra ◽  
Convergence Results ◽  
Diagonally Dominant Matrices ◽  
Sufficient Conditions For Convergence ◽  
Diagonally Dominant ◽  
Necessary And Sufficient ◽  
Theoretical Results

It is well known that as a famous type of iterative methods in numerical linear algebra, Gauss-Seidel iterative methods are convergent for linear systems with strictly or irreducibly diagonally dominant matrices, invertible H−matrices (generalized strictly diagonally dominant matrices) and Hermitian positive definite matrices. But, the same is not necessarily true for linear systems with non-strictly diagonally dominant matrices and general H−matrices. This paper firstly proposes some necessary and sufficient conditions for convergence on Gauss-Seidel iterative methods to establish several new theoretical results on linear systems with nonstrictly diagonally dominant matrices and general H−matrices. Then, the convergence results on preconditioned Gauss-Seidel (PGS) iterative methods for general H−matrices are presented. Finally, some numerical examples are given to demonstrate the results obtained in this paper.

scholarly journals Convergence of the GAOR Method for One Subclass ofH-Matrix

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Guangbin Wang ◽  
Ting Wang
Keyword(s):  
Linear System ◽  
Convergence Theorem ◽  
Coefficient Matrix ◽  
Linear Least Squares ◽  
Numerical Examples ◽  
Linear Least Squares Problem ◽  
Diagonally Dominant Matrix ◽  
Diagonally Dominant ◽  
Dominant Matrix ◽  
Better Than

We discuss the convergence of the GAOR method to solve linear system which occurred in solving the weighted linear least squares problem. Moreover, we present one convergence theorem of the GAOR method when the coefficient matrix is a strictly doublyαdiagonally dominant matrix which is a nonsingularH-matrix. Finally, we show that our results are better than previous ones by using four numerical examples.

Sign in / Sign up

Export Citation Format

Share Document