Enclosing solutions of singular interval systems iteratively (Q2484076)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enclosing solutions of singular interval systems iteratively |
scientific article; zbMATH DE number 2190626
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enclosing solutions of singular interval systems iteratively |
scientific article; zbMATH DE number 2190626 |
Statements
Enclosing solutions of singular interval systems iteratively (English)
0 references
2 August 2005
0 references
The authors study the equation \[ [x]=[A][x]+[b] \] where \([A]\) is a square interval matrix, \([x]\), \([b]\) are interval vectors, and the arithmetic operations are performed in interval arithmetic. Under the assumptions of irreducibility of \(| [A]| \) and of the existence of a solution to the equation they formulate a necessary and sufficient condition for the iteration \[ [x]^{k+1}=[A][x]^{k}+[b] \] to converge for an arbitrary initial interval vector \([x]^{0}\).
0 references
interval linear equations
0 references
fixed-point iteration
0 references
convergence
0 references
interval arithmetic
0 references
0.874688982963562
0 references
0.8576387763023376
0 references
0.8180698156356812
0 references