Reducing Parallel Communication in Algebraic Multigrid through Sparsification (Q2830618): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Parallel coarse-grid selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Performance of an Algebraic Multigrid Solver on Multicore Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse matrix approximations for multigrid methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black box multigrid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black box multigrid for nonsymmetric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance‐two interpolation for parallel algebraic multigrid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing Complexity in Parallel Algebraic Multigrid Preconditioners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Galerkin Coarse Grids for Algebraic Multigrid / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general framework for graph sparsification / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multigrid Methods for Variational Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new perspective on strength measures in algebraic multigrid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sparsification by Effective Resistances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-Galerkin Multigrid Based on Sparsified Smoothed Aggregation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collocation Coarse Approximation in Multigrid / rank
 
Normal rank
Property / cites work
 
Property / cites work: On long-range interpolation operators for aggressive coarsening / rank
 
Normal rank

Revision as of 19:42, 12 July 2024

scientific article
Language Label Description Also known as
English
Reducing Parallel Communication in Algebraic Multigrid through Sparsification
scientific article

    Statements

    Reducing Parallel Communication in Algebraic Multigrid through Sparsification (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 October 2016
    0 references
    multigrid
    0 references
    algebraic multigrid
    0 references
    non-Galerkin multigrid
    0 references
    high performance computing
    0 references
    parallel computation
    0 references
    numerical example
    0 references
    large sparse linear systems
    0 references
    convergence
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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