scientific article; zbMATH DE number 177844

MaRDI QIDQ4038722zbMATH OpenFDO

Authors Victor Y. Pan, J. Reif

Publication date 18 May 1993

zbMATH Keywords

bit-complexityconnection machineMASPARmultigrid methodsparallel algorithmparallel computers

Mathematics Subject Classification ID

Finite difference methods for boundary value problems involving PDEs (65N06) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Compact Multigrid
• Implementing the multigrid method on a massively parallel computer
• An Algorithm with Polylog Parallel Complexity for Solving Parabolic Partial Differential Equations
• Limits on Parallelism in the Numerical Solution of Linear Partial Differential Equations
• Generalized compact multi-grid

Cited in

(5)

• Efficient approximate solution of sparse linear systems
• Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)
• Generalized compact multi-grid
• Compact Multigrid
• Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision

This page was built for publication:

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