Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms (Q5317893): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1002/nla.323 / rank
Normal rank
 
Property / author
 
Property / author: Jane K. Cullum / rank
Normal rank
 
Property / author
 
Property / author: Jane K. Cullum / 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.1002/nla.323 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032846647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverings of Bipartite Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NLA.323 / rank
 
Normal rank

Latest revision as of 16:41, 30 December 2024

scientific article; zbMATH DE number 2206744
Language Label Description Also known as
English
Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms
scientific article; zbMATH DE number 2206744

    Statements

    Effects of problem decomposition (partitioning) on the rate of convergence of parallel numerical algorithms (English)
    0 references
    0 references
    0 references
    0 references
    21 September 2005
    0 references
    parallel algorithms
    0 references
    graph partitioning
    0 references
    problem decomposition
    0 references
    rate of convergence
    0 references

    Identifiers