Parallel Networks for Multi-Grid Algorithms: Architecture and Complexity

DOI10.1137/0906048MaRDI QIDQ3736855zbMATH OpenOpenAlexWikidataFDO

Authors Tony F. Chan, Robert Schreiber

Publication date 1985

Published in SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0906048

zbMATH Keywords

computational complexitymulti-grid algorithmsparallel architecturespeedup and efficiency

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Recommendations

• Efficient multigrid algorithms for locally constrained parallel systems
• Multigrid methods on parallel computers—A survey of recent developments
• A parallel multigrid FAS scheme for transputer networks
• scientific article; zbMATH DE number 4064411
• scientific article; zbMATH DE number 4001393

Cited in

(5)

• Parallel implementation of a multigrid method on the experimental lCAP supercomputer
• A general computational formalism for networks of structured grids
• Efficient multigrid algorithms for locally constrained parallel systems
• A parallel multigrid FAS scheme for transputer networks
• Colouring the discretization graphs arising in the multigrid method

This page was built for publication: Parallel Networks for Multi-Grid Algorithms: Architecture and Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3736855)