Acceleration of convergence of a two-level algebraic algorithm by aggregation in smoothing process
From MaRDI portal
(Redirected from Publication:2365729)
Recommendations
- Acceleration of convergence of a two-level algorithm by smoothing transfer operators
- Convergence of algebraic multigrid based on smoothed aggregation
- An improved convergence analysis of smoothed aggregation algebraic multigrid.
- Improved convergence bounds for smoothed aggregation method: Linear dependence of the convergence rate on the number of levels
- Improved convergence estimate for a multiply polynomially smoothed two-level method with an aggressive coarsening.
- Improved convergence bounds for two-level methods with an aggressive coarsening and massive polynomial smoothing
- A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm
- Smoothing accelerated algorithm for constrained nonsmooth convex optimization problems
- Convergence acceleration by the $E_{+p}$-algorithm
- An Aggregation Multilevel Method Using Smooth Error Vectors
Cites work
Cited in
(11)- Fast multigrid solver
- A modification of the two-level algorithm with overcorrection
- Generalizing Lloyd's algorithm for graph clustering
- Acceleration of convergence of a two-level algorithm by smoothing transfer operators
- HAZniCS -- software components for multiphysics problems
- Algebraic multigrid methods
- Preconditioning of conjugate gradients by multigrid solver
- Improved convergence bounds for smoothed aggregation method: Linear dependence of the convergence rate on the number of levels
- scientific article; zbMATH DE number 428241 (Why is no real title available?)
- Multi-level method in eigenvalue problem
- A short philosophical note on the origin of smoothed aggregations.
This page was built for publication: Acceleration of convergence of a two-level algebraic algorithm by aggregation in smoothing process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2365729)
