Using Symmetries and Antisymmetries to Analyze a Parallel Multigrid Algorithm: The Elliptic Boundary Value Problem Case

Symmetry and antisymmetry properties of a class of elliptic partial differential equations are exploited to prove when a particular parallel multilevel algorithm is a direct method rather than the usual iterative method. No smoothing is required for this result. Examples are presented, including var...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SIAM journal on numerical analysis Ročník 26; číslo 6; s. 1439 - 1461
Hlavní autoři: Douglas, Craig C., Smith, Barry F.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia, PA Society for Industrial and Applied Mathematics 01.12.1989
Témata:
Algorithms
Antisymmetry
Applied mathematics
Boundary value problems
Data smoothing
Decomposition
Decomposition methods
Exact sciences and technology
Iterative methods
Mathematics
Multigrid methods
Numerical analysis
Numerical analysis. Scientific computation
Partial differential equations
Partial differential equations, boundary value problems
Sciences and techniques of general use
Symmetry
Total costs
Wall clocks
Parallel algorithm
Numerical analysis
Elliptic equation
Boundary value problem
Multigrid
Convergence rate
Numerical convergence
Partial differential equation
ISSN:0036-1429, 1095-7170
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Symmetry and antisymmetry properties of a class of elliptic partial differential equations are exploited to prove when a particular parallel multilevel algorithm is a direct method rather than the usual iterative method. No smoothing is required for this result. Examples are presented, including variable coefficient ones. A connection between the algorithm in this article and domain decomposition is established, even though this algorithm is more general and different. The parallel algorithm is also analyzed when it is iterative and it is shown how to increase processor utilization. Hackbusch's robust multigrid algorithm ["A new approach to robust multi-grid solvers," in ICIAM '87: Proceedings of the First International Conference on Industrial and Applied Mathematics, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1988, pp. 111-126] is analyzed for some model problems and it is shown that the parallel algorithm in this article uses much less computer time with at most the same amount of storage.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0036-1429
1095-7170
DOI:10.1137/0726084