Efficient iterative algorithms for bounding the inverse of a matrix (Q756361)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Efficient iterative algorithms for bounding the inverse of a matrix
scientific article

    Statements

    Efficient iterative algorithms for bounding the inverse of a matrix (English)
    0 references
    0 references
    1990
    0 references
    We are considering iterative methods for bounding the inverse of a matrix, which make use of interval arithmetic. We present a class of methods as a combination of ordinary Schulz's methods for only approximating the inverse matrix [see \textit{P. Forster}, Numer. Math. 12, 211-214 (1968; Zbl 0165.502)] and of well-known interval Schulz's methods [see (*) \textit{G. Alefeld} and the first author, Introduction to Interval Computations (1983; Zbl 0552.65041)]. Two convergence theorems are proved. Our methods are shown to be asymptotically of the same order of convergence as the ordinary Schulz's methods being part of them. Therefore we are getting considerably more efficient interval methods by our approach than by the classical interval Schulz's methods in (*) or the first author [Z. Angew. Math. Mech. 69, 115-120 (1989; Zbl 0684.65027)]. A numerical example is given.
    0 references
    matrix inversion
    0 references
    interval analysis
    0 references
    iterative methods
    0 references
    bounding the inverse of a matrix
    0 references
    interval arithmetic
    0 references
    convergence
    0 references
    interval Schulz's methods
    0 references
    numerical example
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references