A divide-and-conquer bound for aggregate's quality and algebraic connectivity
From MaRDI portal
Publication:2012519
DOI10.1016/J.DISC.2017.05.003zbMATH Open1367.05135OpenAlexW2466308708MaRDI QIDQ2012519FDOQ2012519
Authors: Artem Napov 
Publication date: 1 August 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://dipot.ulb.ac.be/dspace/bitstream/2013/230581/5/qual_difusion.pdf
Recommendations
- An efficient multigrid method for graph Laplacian systems. II: Robust aggregation
- A lower bound for algebraic connectivity based on the connection-graph-stability method
- Bounds on the algebraic connectivity of graphs
- Algebraic connectivity and disjoint vertex subsets of graphs
- scientific article; zbMATH DE number 2246587
Cites Work
- Title not available (Why is that?)
- Laplacian matrices of graphs: A survey
- Title not available (Why is that?)
- Aggregation-Based Algebraic Multigrid for Convection-Diffusion Equations
- Laplace eigenvalues of graphs---a survey
- Old and new results on algebraic connectivity of graphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- An algebraic multigrid method with guaranteed convergence rate
- An aggregation-based algebraic multigrid method
- Algebraic analysis of aggregation-based multigrid.
- Towards algebraic multigrid for elliptic problems of second order
- An efficient multigrid method for graph Laplacian systems. II: Robust aggregation
- Title not available (Why is that?)
- Multi-level iterative technique and aggregation concept with semi-analytical preconditioning for solving boundary-value problems
This page was built for publication: A divide-and-conquer bound for aggregate's quality and algebraic connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012519)
