A class of incomplete orthogonal factorization methods. II: Implemetation and results (Q2568630)

From MaRDI portal
Revision as of 16:43, 10 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A class of incomplete orthogonal factorization methods. II: Implemetation and results
scientific article

    Statements

    A class of incomplete orthogonal factorization methods. II: Implemetation and results (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 October 2005
    0 references
    The authors present a considerable amount of implementation research following up on their previous theoretical research [\textit{Z. Bai}, \textit{I. S. Duff} and \textit{A. J. Wathen}, BIT 41, No. 1, 53--70 (2001; Zbl 0990.65038)] regarding incomplete orthogonal factorization methods, using Given's rotations, for square and rectangular sparse matrices. The approach stems from the idea to compute the orthogonal factorization of a matrix which is sufficiently close to the original one. Three separate methods are discussed in details, and abundant practical considerations are presented including algorithmic aspects and numerical examples.
    0 references
    preconditioning
    0 references
    sparse linear systems
    0 references
    sparse least-squares
    0 references
    iterative methods
    0 references
    incomplete orthogonal factorizations
    0 references
    Givens rotations
    0 references
    numerical examples
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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