A note on Reusken's lemma

DOI10.1007/BF02238100zbMATH Open0836.65129OpenAlexW1506656115WikidataQ125014046 ScholiaQ125014046MaRDI QIDQ1895657FDOQ1895657

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

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

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)

Cites Work

• Title not available (Why is that?)
• On the Robustness of ILU Smoothing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Steplength optimization and linear multigrid methods
• Title not available (Why is that?)
• On Maximum Norm Convergence of Multigrid Methods for Two-Point Boundary Value Problems
• Multigrid with matrix-dependent transfer operators for a singular perturbation problem

Cited In (2)

• Title not available (Why is that?)
• 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)