AbstractThe modified overrelaxation (MSOR) method is applied to a linear system Ax=b, where A has property A. We get bounds for the spectral radius of the iteration matrix of this method, and we achieve convergence conditions for the MSOR method when A is strictly diagonally dominant. We extend our conclusions to another kind of matrices—H,L,M or Stieltjes. In the last section we use the vectorial norms, getting convergence conditions for the MSOR method, when A is a block-H matrix. We also generalize a theorem of Robert's for this kind of matrices
AbstractCovering the last half of the 20th century, we present some of the basic and well-known resu...
AbstractThus far for an n × n complex nonsingular matrix A, the symmetric successive overrelaxation ...
AbstractLet v denote the spectral radius of JAB, the block Jacobi iteration matrix. For the classes ...
AbstractIn order to solve a linear system Ax = b, Hadjidimos et al. (1992) defined a class of modifi...
AbstractThe symmetric successive overrelaxation (SSOR) iterative method is applied to the solution o...
AbstractLet v denote the spectral radius of JAB, the block Jacobi iteration matrix. For the classes ...
AbstractIn this paper, we give sufficient conditions for the convergence of the (AOR) method, when t...
AbstractFor the solution of the linear system Ax=(I−T)x=c (1), where T is a weakly cyclic of index p...
AbstractIn order to solve a linear system Ax = b, Hadjidimos et al. (1992) defined a class of modifi...
AbstractThe functional equation relating the eigenvalues of the block Symmetric Successive Overrelax...
AbstractThus far for an n × n complex nonsingular matrix A, the symmetric successive overrelaxation ...
AbstractOne attractive feature of the classical successive overrelaxation (SOR) iterative method is ...
AbstractWe consider the SSOR and USSOR methods in order to approximate the solution of the linear sy...
AbstractThe symmetric successive overrelaxation (SSOR) iterative method is applied to the solution o...
AbstractThe MAOR method as a generalization of the well-known MSOR method was introduced by Hadjidim...
AbstractCovering the last half of the 20th century, we present some of the basic and well-known resu...
AbstractThus far for an n × n complex nonsingular matrix A, the symmetric successive overrelaxation ...
AbstractLet v denote the spectral radius of JAB, the block Jacobi iteration matrix. For the classes ...
AbstractIn order to solve a linear system Ax = b, Hadjidimos et al. (1992) defined a class of modifi...
AbstractThe symmetric successive overrelaxation (SSOR) iterative method is applied to the solution o...
AbstractLet v denote the spectral radius of JAB, the block Jacobi iteration matrix. For the classes ...
AbstractIn this paper, we give sufficient conditions for the convergence of the (AOR) method, when t...
AbstractFor the solution of the linear system Ax=(I−T)x=c (1), where T is a weakly cyclic of index p...
AbstractIn order to solve a linear system Ax = b, Hadjidimos et al. (1992) defined a class of modifi...
AbstractThe functional equation relating the eigenvalues of the block Symmetric Successive Overrelax...
AbstractThus far for an n × n complex nonsingular matrix A, the symmetric successive overrelaxation ...
AbstractOne attractive feature of the classical successive overrelaxation (SOR) iterative method is ...
AbstractWe consider the SSOR and USSOR methods in order to approximate the solution of the linear sy...
AbstractThe symmetric successive overrelaxation (SSOR) iterative method is applied to the solution o...
AbstractThe MAOR method as a generalization of the well-known MSOR method was introduced by Hadjidim...
AbstractCovering the last half of the 20th century, we present some of the basic and well-known resu...
AbstractThus far for an n × n complex nonsingular matrix A, the symmetric successive overrelaxation ...
AbstractLet v denote the spectral radius of JAB, the block Jacobi iteration matrix. For the classes ...