Approximate factorizations with S/P consistently ordered M-factors (Q1263235): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114233895, #quickstatements; #temporary_batch_1712261475387
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: ON ITERATIVE SOLUTION OF ELLIPTIC DIFFERENCE EQUATIONS ON A MESH-CONNECTED ARRAY OF PROCESSORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning and Two-Level Multigrid Methods of Arbitrary Degree of Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper eigenvalue bounds for pencils of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Axelsson's perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower eigenvalue bounds for pencils of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and Conditioning Properties of Sparse Approximate Block Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence Criteria for Partial Matrix Factorizations in Iterative Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditioning analysis of positive definite matrices by approximate factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3290092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Methods for Solving Partial Difference Equations of Elliptic Type / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5639278 / rank
 
Normal rank

Latest revision as of 11:50, 20 June 2024

scientific article
Language Label Description Also known as
English
Approximate factorizations with S/P consistently ordered M-factors
scientific article

    Statements

    Approximate factorizations with S/P consistently ordered M-factors (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    When the triangular factors are ``S/P consistently ordered'' M-matrices than the behavior of a modified incomplete factorization for positive definite linear systems is predictable if nonstrict-diagonal dominance is given. Quasi-singular problems can also be solved at the same speed as regular ones. Numerical examples are presented.
    0 references
    0 references
    0 references
    S/P consistently ordered M-matrices
    0 references
    incomplete factorization
    0 references
    positive definite linear systems
    0 references
    nonstrict-diagonal dominance
    0 references
    Quasi-singular problems
    0 references
    Numerical examples
    0 references
    0 references