Kooperativer Bibliotheksverbund

Berlin Brandenburg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Description: This paper describes a massively parallel algebraic multigrid method based on non-smoothed aggregation. It is especially suited for solving heterogeneous elliptic problems as it uses a greedy heuristic algorithm for the aggregation that detects changes in the coefficients and prevents aggregation across them. Using decoupled aggregation on each process with data agglomeration onto fewer processes on the coarse level, it weakly scales well in terms of both total time to solution and time per iteration to nearly 300,000 cores. Because of simple piecewise constant interpolation between the levels, its memory consumption is low and allows solving problems with more than 100,000,000,000 degrees of freedom. Comment: 22 pages, 1 figure
    Keywords: Mathematics - Numerical Analysis ; Computer Science - Distributed, Parallel, And Cluster Computing ; Computer Science - Mathematical Software ; Computer Science - Numerical Analysis ; 65f08, 65n08, 65n55, 65y05 ; F.2.1 ; G.1.3 ; G.1.8 ; G.4
    Source: Cornell University
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages