The bit-complexity of discrete solutions of partial differential equations: Compact multigrid

DOI10.1016/0898-1221(90)90235-CzbMath0711.65100OpenAlexW1987894708MaRDI QIDQ922664

John H. Reif, Pan, Victor Y.

Publication date: 1990

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(90)90235-c

zbMATH Keywords

complexitymultigrid algorithmscompact multigrid

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20)

Related Items (5)

Towards computability of elliptic boundary value problems in variational formulation ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision ⋮ Computational complexity of classical solutions of partial differential equations ⋮ Bit-complexity of solving systems of linear evolutionary partial differential equations

Cites Work

• Multigrid methods. Proceedings of the Conference Held at Köln-Porz, November 23-27, 1981
• On the multi-grid method applied to difference equations
• An Optimal Order Process for Solving Finite Element Equations
• Multi-Level Adaptive Solutions to Boundary-Value Problems
• Parallel algorithms for elliptic equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The bit-complexity of discrete solutions of partial differential equations: Compact multigrid