A note on Reusken's lemma

DOI10.1007/BF02238100MaRDI QIDQ1895657zbMATH OpenOpenAlexWikidataFDO

Authors Wolfgang Hackbusch

Publication date 29 April 1996

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02238100

zbMATH Keywords

robust multigrid methodssemi-iterative smoother

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10)

Recommendations

• scientific article; zbMATH DE number 894154
• scientific article; zbMATH DE number 4096681
• Sharp Estimates for Multigrid Rates of Convergence with General Smoothing and Acceleration
• On the Robustness of ILU Smoothing
• Convergence estimates for multigrid algorithms

Cites work

• scientific article; zbMATH DE number 989459 (Why is no real title available?)
• scientific article; zbMATH DE number 434794 (Why is no real title available?)
• scientific article; zbMATH DE number 3958638 (Why is no real title available?)
• scientific article; zbMATH DE number 107890 (Why is no real title available?)
• Multigrid with matrix-dependent transfer operators for a singular perturbation problem
• On Maximum Norm Convergence of Multigrid Methods for Two-Point Boundary Value Problems
• On the Robustness of ILU Smoothing
• Steplength optimization and linear multigrid methods

Cited in

(2)

• scientific article; zbMATH DE number 5194827 (Why is no real title available?)
• Additive and multiplicative multi-grid -- a comparison

This page was built for publication: A note on Reusken's lemma

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