The weak and strong stability of algorithms in numerical linear algebra (Q1107263)

From MaRDI portal
Revision as of 13:22, 13 July 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
The weak and strong stability of algorithms in numerical linear algebra
scientific article

    Statements

    The weak and strong stability of algorithms in numerical linear algebra (English)
    0 references
    0 references
    1987
    0 references
    The stability of algorithm in numeical linear algebra is discussed. The concept of stability is extended to notions of weak stability and strong stability. Justifications are given for these extensions, and the implications of error analysis in terms of these definitions are discussed. The concept of weak stability helps to clarify some of the controversy which has arisen concerning the stability of algorithms for Toeplitz systems.
    0 references
    0 references
    0 references
    0 references
    0 references
    backward error analysis
    0 references
    conditioning
    0 references
    stability of algorithm
    0 references
    weak stability
    0 references
    strong stability
    0 references
    Toeplitz systems
    0 references