A parallel iterative method with a factorized preconditioning matrix for elliptic equations (Q5935958): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A class of first order factorization methods / 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: A generalized SSOR method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3716247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel version of the alternating triangular method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel version of the generalized alternating triangular method for elliptic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings for Parallel Conjugate Gradient Preconditioners / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of ordering on preconditioned conjugate gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of parallel incomplete point factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: DRIC: A dynamic version of the RIC method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251974 / rank
 
Normal rank

Revision as of 16:49, 3 June 2024

scientific article; zbMATH DE number 1612817
Language Label Description Also known as
English
A parallel iterative method with a factorized preconditioning matrix for elliptic equations
scientific article; zbMATH DE number 1612817

    Statements

    A parallel iterative method with a factorized preconditioning matrix for elliptic equations (English)
    0 references
    0 references
    6 March 2002
    0 references
    Preconditioning by several incomplete Cholesky decompositions is discussed. A variant is discussed that is appropriate for a nine-point stencil and parallel computing. The coefficients of the preconditioning matrix are explicitly given. Numerical results are presented for examples with up to 512 grid points.
    0 references
    preconditioning
    0 references
    difference method
    0 references
    incomplete Cholesky decompositions
    0 references
    parallel computing
    0 references
    numerical results
    0 references
    0 references
    0 references

    Identifiers

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