Pages that link to "Item:Q2845613"
From MaRDI portal
The following pages link to Algebraic multilevel preconditioners for the graph Laplacian based on matching in graphs (Q2845613):
Displaying 16 items.
- A note on algebraic multigrid methods for the discrete weighted Laplacian (Q611459) (← links)
- Adaptive AMG with coarsening based on compatible weighted matching (Q1684418) (← links)
- Multilevel preconditioning of graph-Laplacians: Polynomial approximation of the pivot blocks inverses (Q1761651) (← links)
- Multigrid methods for convection-diffusion problems discretized by a monotone scheme (Q2309051) (← links)
- Parallel Aggregation Based on Compatible Weighted Matching for AMG (Q3297463) (← links)
- Diffusion State Distances: Multitemporal Analysis, Fast Algorithms, and Applications to Biological Networks (Q4999351) (← links)
- AMG Preconditioners for Linear Solvers towards Extreme Scale (Q5161765) (← links)
- A Posteriori Error Estimates for Multilevel Methods for Graph Laplacians (Q5161767) (← links)
- An Adaptive Multigrid Method Based on Path Cover (Q5241251) (← links)
- Matrix Reordering Using Multilevel Graph Coarsening for ILU Preconditioning (Q5251937) (← links)
- Spectral Upscaling for Graph Laplacian Problems with Application to Reservoir Simulation (Q5372631) (← links)
- Support-Graph Preconditioners (Q5470502) (← links)
- Theoretical bounds for algebraic multigrid performance: review and analysis (Q5502410) (← links)
- Iterative solution of spatial network models by subspace decomposition (Q6076243) (← links)
- Coarse-grid selection using simulated annealing (Q6137788) (← links)
- Generalizing Lloyd's algorithm for graph clustering (Q6598501) (← links)