ISSN:
1573-1340
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract A natural generalization of the Jacobi and Gauss-Seidel iterations for interval systems is to allow the matrices to reside in convex polytopes. In order to apply the standard convergence criteria involving M-matrices to iterations for polytopic systems, we derive conditions for a convex polytope of matrices to be a polytope of M-matrices in terms of its vertices. We show the conditions are used in the convergence analysis of iterations for block and nonlinear polytopic systems.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1009961021112
Permalink