Coarse-grid selection using simulated annealing
From MaRDI portal
Publication:6137788
Abstract: Multilevel techniques are efficient approaches for solving the large linear systems that arise from discretized partial differential equations and other problems. While geometric multigrid requires detailed knowledge about the underlying problem and its discretization, algebraic multigrid aims to be less intrusive, requiring less knowledge about the origin of the linear system. A key step in algebraic multigrid is the choice of the coarse/fine partitioning, aiming to balance the convergence of the iteration with its cost. In work by MacLachlan and Saad, a constrained combinatorial optimization problem is used to define the ``best coarse grid within the setting of a two-level reduction-based algebraic multigrid method and is shown to be NP-complete. Here, we develop a new coarsening algorithm based on simulated annealing to approximate solutions to this problem, which yields improved results over the greedy algorithm developed previously. We present numerical results for test problems on both structured and unstructured meshes, demonstrating the ability to exploit knowledge about the underlying grid structure if it is available.
Recommendations
- A Greedy Strategy for Coarse-Grid Selection
- Modifying CLJP to select grid hierarchies with lower operator complexities and better performance
- Coarse grid classification: a parallel coarsening scheme for algebraic multigrid methods
- Parallel coarse-grid selection
- General highly accurate algebraic coarsening
Cites work
- scientific article; zbMATH DE number 3874483 (Why is no real title available?)
- scientific article; zbMATH DE number 4078693 (Why is no real title available?)
- scientific article; zbMATH DE number 1561761 (Why is no real title available?)
- scientific article; zbMATH DE number 2088244 (Why is no real title available?)
- A Greedy Strategy for Coarse-Grid Selection
- A new perspective on strength measures in algebraic multigrid
- A note on MGR methods
- Adaptive reduction-based AMG
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs
- An algebraic multigrid method with guaranteed convergence rate
- An energy‐based AMG coarsening strategy
- An overview of the Trilinos project
- An unstructured multigrid method based on geometric smoothness
- Coarsening by compatible relaxation
- Combinatorial optimization. Theory and algorithms
- Compatible relaxation and coarsening in algebraic multigrid
- Distance-two interpolation for parallel algebraic multigrid
- Greedy Coarsening Strategies for Nonsymmetric Problems
- Least squares quantization in PCM
- Nonsymmetric reduction-based algebraic multigrid
- On AMG methods with F-smoothing based on Chebyshev polynomials and their relation to AMGr
- Parallel coarse-grid selection
- Placement by thermodynamic simulated annealing
- Reducing Complexity in Parallel Algebraic Multigrid Preconditioners
- Stochastic Optimization
- The Methods of Cyclic Reduction, Fourier Analysis and the FACR Algorithm for the Discrete Solution of Poisson’s Equation on a Rectangle
- Theoretical bounds for algebraic multigrid performance: review and analysis.
- \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
Cited in
(5)- Coarsening invariance and bucket-sorted independent sets for algebraic multigrid
- Coarse-Graining Large Search Landscapes Using Massive Edge Collapse
- Collocation coarse approximation in multigrid
- AIR multigrid with GMRES polynomials (AIRG) and additive preconditioners for Boltzmann transport
- A Greedy Strategy for Coarse-Grid Selection
This page was built for publication: Coarse-grid selection using simulated annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6137788)
