Incomplete block matrix factorization preconditioning methods. The ultimate answer? (Q1064733): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Owe Axelsson / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Volker Mehrmann / rank
Normal rank
 
Property / author
 
Property / author: Owe Axelsson / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Volker Mehrmann / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-0427(85)90004-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1989220483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized SSOR method / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some versions of incomplete block-matrix factorization iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general incomplete block-matrix factorization method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the eigenvalue distribution of a class of preconditioning methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sparse Block Factorization Iterative Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3943082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Preconditioning for the Conjugate Gradient Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decay Rates for Inverses of Band Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing certain elements of the inverse of a sparse matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of first order factorization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5832645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector Computations for Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guidelines for the usage of incomplete decompositions in solving sets of linear equations as they occur in practical problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The block preconditioned conjugate gradient method on vector computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3281387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5342712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5604166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical bases of finite-element spaces in the discretization of nonsymmetric elliptic boundary value problems / rank
 
Normal rank

Latest revision as of 19:14, 14 June 2024

scientific article
Language Label Description Also known as
English
Incomplete block matrix factorization preconditioning methods. The ultimate answer?
scientific article

    Statements

    Incomplete block matrix factorization preconditioning methods. The ultimate answer? (English)
    0 references
    1985
    0 references
    A survey and comparison for iterative methods for large sparse linear systems is given. The methods are preconditioning methods based on incomplete block matrix factorizations. It is shown how these methods can be vectorized and parallelized and that these methods are very efficient and robust compared with pointwise incomplete factorization preconditioning methods or multilevel methods.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel computing
    0 references
    survey
    0 references
    comparison
    0 references
    large sparse linear systems
    0 references
    preconditioning methods
    0 references
    incomplete block matrix factorizations
    0 references
    multilevel methods
    0 references
    0 references
    0 references