Bi-CG: An effective solver for three fields domain decomposition method in parallel environments (Q2489360): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/j.amc.2005.06.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054089597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Solution Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substructuring preconditioners for the three fields domain decomposition method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4426216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Construction of Preconditioners for Elliptic Problems by Substructuring. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilevel preconditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank

Latest revision as of 14:11, 24 June 2024

scientific article
Language Label Description Also known as
English
Bi-CG: An effective solver for three fields domain decomposition method in parallel environments
scientific article

    Statements

    Bi-CG: An effective solver for three fields domain decomposition method in parallel environments (English)
    0 references
    0 references
    16 May 2006
    0 references
    Three fields domain decomposition method
    0 references
    Bi-Conjugate Gradient method
    0 references
    Galerkin method
    0 references
    numerical examples
    0 references
    preconditioning
    0 references
    comparison of methods
    0 references
    elliptic boundary value problems
    0 references

    Identifiers

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