Modified Gauss-Seidel type methods and Jacobi type methods for Z-matrices (Q1587902): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Sun, Weiwei / rank
Normal rank
 
Property / author
 
Property / author: Sun, Weiwei / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified iterative methods for consistent linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the modified Gauss-Seidel method for \(Z\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative splitting theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorems on M-splittings of a singular M-Matrix which depend on graph structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On upper triangular block weak regular splittings of a singular \(M\)-matrix / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:47, 3 June 2024

scientific article
Language Label Description Also known as
English
Modified Gauss-Seidel type methods and Jacobi type methods for Z-matrices
scientific article

    Statements

    Modified Gauss-Seidel type methods and Jacobi type methods for Z-matrices (English)
    0 references
    0 references
    0 references
    1 August 2001
    0 references
    The authors discuss the iterative solution of linear systems by modified Gauss-Seidel (MGS) type methods and modified Jacobi (MJ) type methods. The convergence of these algorithms is analyzed and many properties for a matrix splitting of the coefficient matrix of the system are presented. Some recent results are improved. The main tool for a comparison of the different Gauss-Seidel type methods used by the authors is the spectral radius of the iteration matrix of the method. The authors prove that if the coefficient matrix of the system is a non-singular M-matrix, the MGS method converges for all parameters in \([0,1]\) and the convergence rates are better than those of the corresponding Gauss-Seidel type methods. No numerical experiments.
    0 references
    Z-matrices
    0 references
    modified Gauss-Seidel type method
    0 references
    modified Jacobi type method
    0 references
    convergence
    0 references
    spectral radius
    0 references
    algorithms
    0 references
    matrix splitting
    0 references
    M-matrix
    0 references

    Identifiers