A multigrid algorithm for parallel computers: CPMG
Linear boundary value problems for ordinary differential equations (34B05) Numerical solution of boundary value problems involving ordinary differential equations (65L10) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05)
The authors suggest a new parallel multigrid algorithm and show that the algorithm has nearly the same convergence rate as the \(V\)-cycle multigrid algorithm for those problems for which the initial error is distributed over all frequency modes. The algorithm has been successfully implemented on a parallel machine. It is shown that the algorithm is about 17 percent faster than the standard \(V\)-cycle algorithm.
- Multigrid methods on parallel computers—A survey of recent developments
- Note on the Parallel Efficiency of the Frederickson-McBryan Multigrid Algorithm
- A MODEL AND IMPLEMENTATION OF MULTIGRID FOR MASSIVELY PARALLEL COMPUTERS
- scientific article; zbMATH DE number 4064411
- Efficient multigrid algorithms for locally constrained parallel systems
- A short note on standard parallel multigrid algorithm for 3D problems
- Single-level multigrid
- Optimum tactics of parallel multi-grid algorithm with virtual boundary forecast method running on a local network with the PVM platform
- CPMG
- The convergence of parallel multiblock multigrid methods
- Note on the Parallel Efficiency of the Frederickson-McBryan Multigrid Algorithm
- Using Symmetries and Antisymmetries to Analyze a Parallel Multigrid Algorithm: The Elliptic Boundary Value Problem Case
- scientific article; zbMATH DE number 884967 (Why is no real title available?)
- Normalized Convergence Rates for the PSMG Method
This page was built for publication: A multigrid algorithm for parallel computers: CPMG
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1260947)
