Enclosing solutions of singular interval systems iteratively (Q2484076)

From MaRDI portal
Revision as of 05:26, 5 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Enclosing solutions of singular interval systems iteratively
scientific article

    Statements

    Enclosing solutions of singular interval systems iteratively (English)
    0 references
    0 references
    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
    0 references
    0 references
    interval linear equations
    0 references
    fixed-point iteration
    0 references
    convergence
    0 references
    interval arithmetic
    0 references