Optimal polynomial smoothers for parallel AMG
From MaRDI portal
Cites work
- A massively parallel solver for discrete Poisson-like problems
- Adaptive reduction-based AMG
- Agglomeration multigrid methods with implicit Runge-Kutta smoothers applied to aerodynamic simulations on unstructured grids
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- Algebraic multigrid methods
- AMG Preconditioners for Linear Solvers towards Extreme Scale
- BootCMatch: a software package for bootstrap AMG based on graph weighted matching
- Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II
- Comparison of multigrid algorithms for high-order continuous finite element discretizations.
- scientific article; zbMATH DE number 3562346 (Why is no real title available?)
- scientific article; zbMATH DE number 3797118 (Why is no real title available?)
- scientific article; zbMATH DE number 1862742 (Why is no real title available?)
- Improving the arithmetic intensity of multigrid with the help of polynomial smoothers.
- Learning Optimal Multigrid Smoothers via Neural Networks
- Local Fourier analysis of multigrid methods with polynomial smoothers and aggressive coarsening
- Multigrid Methods for Variational Problems: General Theory for the V-Cycle
- Multigrid smoothers for ultraparallel computing
- Multilevel Block Factorization Preconditioners
- Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing.
- On AMG methods with F-smoothing based on Chebyshev polynomials and their relation to AMGr
- Optimal polynomial smoothers for multigrid V‐cycles
- Optimal Runge-Kutta smoothers for the \(p\)-multigrid discontinuous Galerkin solution of the 1D Euler equations
- Optimizing a multigrid Runge-Kutta smoother for variable-coefficient convection-diffusion equations
- Optimizing Runge-Kutta smoothers for unsteady flow problems
- Parallel multigrid smoothing: Polynomial versus Gauss--Seidel
- Polynomial of best uniform approximation to 1/x and smoothing in two-level methods
- Preparing sparse solvers for exascale computing
- Robust parallel smoothing for multigrid via sparse approximate inverses
This page was built for publication: Optimal polynomial smoothers for parallel AMG
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891564)