On the design of nested iterations for elliptic difference equations

DOI10.1007/BF01932674zbMATH Open0244.65073OpenAlexW1964599708MaRDI QIDQ5656341FDOQ5656341

Lydia Kronsjö, Germund Dahlquist

Publication date: 1972

Published in: BIT (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Cites Work

• Title not available (Why is that?)
• Accelerating the Convergence of Discretization Algorithms
• Asymptotic expansions for the error of discretization algorithms for non- linear functional equations

Cited In (6)

• A note on the “nested iterations” method
• Fictitious domain formulations of unilateral problems: analysis and algorithms
• Parallel-in-time simulation of an electrical machine using MGRIT
• A note on the complexity of solving Poisson's equation for spaces of bounded mixed derivatives
• Optimized general sparse grid approximation spaces for operator equations
• Asynchronous Truncated Multigrid-Reduction-in-Time

This page was built for publication: On the design of nested iterations for elliptic difference equations

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