Optimizing the number of multigrid cycles in the full multigrid algorithm
Publication:3094574
DOI10.1002/nla.697zbMath1242.65266OpenAlexW2151859814MaRDI QIDQ3094574
Tobias Gradl, Ulrich Rüde, Alexander Thekale, Kathrin Klamroth
Publication date: 25 October 2011
Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nla.697
convergencefinite elementerror boundsLaplace equationbranch and bound algorithmfull multigridcycle optimizationnonlinear integer programming problem
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Error bounds for boundary value problems involving PDEs (65N15) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Complexity and performance of numerical algorithms (65Y20)
Related Items (5)
Cites Work
- Unnamed Item
- Convergence of the multilevel full approximation scheme including the V- cycle
- Cache optimization for structured and unstructured grid multigrid
- Multigrid Methods for Variational Problems: General Theory for the V-Cycle
- Local Mesh Refinement Multilevel Techniques
- A Unified Convergence Theory for Abstract Multigrid or Multilevel Algorithms, Serial and Parallel
This page was built for publication: Optimizing the number of multigrid cycles in the full multigrid algorithm