• Journal of Applied and Pure Mathematics
• /
• v.5 no.5_6
• /
• pp.303-313
• /
• 2023

Generalized strictly diagonally dominant matrices have a wide range of applications in matrix theory and practical applications, so it is of great theoretical and practical value to study their numerical determination methods. In this paper, we study the numerical determination of generalized strictly diagonally dominant matrices by using the properties of generalized strictly diagonally dominant matrices. We obtain a new criterion for subdivision iteration determination of the generalized strictly diagonally dominant matrices by subdividing the set of non-prevailing row indices and constructing new iteration factors for the set of predominant row indices, new elements of the positive diagonal factors are derived. Advantages are illustrated by numerical examples.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1319-1330
• /
• 2009

In [2] A.Hadjidimos proposed the generalized accelerated over-relaxation (GAOR) methods which generalize the basic iterative method for the solution of linear systems. In this paper we consider the convergence of the two parallel accelerated generalized AOR iterative methods and obtain some convergence theorems for the case when the coefficient matrix A is a block diagonally dominant matrix or a generalized block diagonally dominant matrix.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.943-953
• /
• 2009

In this paper, we give the lower and upper bounds for inverse elements of strictly diagonally dominant seventh-diagonal matrices, and improve the bounds on [SIAM. J. matrix Anal.App1.20(1999)820-837].

• Bulletin of the Korean Mathematical Society
• /
• v.41 no.1
• /
• pp.125-135
• /
• 2004

One of the intriguing and fundamental algorithmic graph problems is the computation of the strongly connected components of a directed graph G. In this paper we first introduce a simple procedure for determining the location of the nonzero elements occurring in $B^{-1}$ without fully inverting B, where EB\;{\equiv}\;(b_{ij)\;and\;B^T$ are diagonally dominant matrices with $b_{ii}\;>\;0$ for all i and $b_{ij}\;{\leq}\;0$, for $i\;{\neq}\;j$, and then, as an application, show that all of the strongly connected components of a directed graph G can be recognized by the location of the nonzero elements occurring in the matrix $C(G)\;=\;(D\;-\;A(G))^{-1}$. Here A(G) is an adjacency matrix of G and D is an arbitrary scalar matrix such that (D - A(G)) becomes a diagonally dominant matrix.