Jacobi and Gauss-Seidel iterations for polytopic systems: Convergence via convex \(M\)-matrices (Q1577435)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1501472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Jacobi and Gauss-Seidel iterations for polytopic systems: Convergence via convex \(M\)-matrices |
scientific article; zbMATH DE number 1501472 |
Statements
Jacobi and Gauss-Seidel iterations for polytopic systems: Convergence via convex \(M\)-matrices (English)
0 references
6 June 2001
0 references
Linear interval equations are linear equations where the coefficient matrices range over a box. Common methods for solving such equations are Jacobi and Gauss-Seidel iterations. In the present paper, the coefficient matrices of the equations range over convex polytopes. It is shown that the Jacobi and Gauss-Seidel method converge if the matrices in the polytope are \(M\)-matrices. Conditions for a polytope matrix to contain ony \(M\)-matrices are derived. Further, generalizations of the investigations to block-matrices and nonlinear systems are discussed.
0 references
convergence
0 references
Jacobi method
0 references
linear interval equations
0 references
Gauss-Seidel method
0 references
\(M\)-matrices
0 references
polytope matrix
0 references
block-matrices
0 references
nonlinear systems
0 references
0.7645370364189148
0 references
