Accelerated multigrid for graph Laplacian operators
From MaRDI portal
Publication:670780
DOI10.1016/j.amc.2015.08.033zbMath1410.65099OpenAlexW1928959160WikidataQ118165438 ScholiaQ118165438MaRDI QIDQ670780
Pietro Dell'Acqua, Stefano Serra Capizzano, Antonio Frangioni
Publication date: 20 March 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11568/752735
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Iterative numerical methods for linear systems (65F10) Conditioning of matrices (15A12)
Related Items
Engineering a combinatorial Laplacian solver: lessons learned, A Nonlinear Algebraic Multigrid Framework for the Power Flow Equations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
- An aggregation-based algebraic multigrid method
- Quadratic regularizations in an interior-point method for primal block-angular problems
- Top-level acceleration of adaptive algebraic multilevel methods for steady-state solution to Markov chains
- Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems
- 0-1 reformulations of the multicommodity capacitated network design problem
- Multi-iterative methods
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- The conditioning of FD matrix sequences coming from semi-elliptic differential equations
- Prim-based support-graph preconditioners for min-cost flow problems
- Spectral Analysis of (Sequences of) Graph Matrices
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
- A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
- Smoothed Aggregation Multigrid for Markov Chains
- Algebraic Multigrid for Markov Chains
- An algebraic generalization of local Fourier analysis for grid transfer operators in multigrid based on Toeplitz matrices
- Lean Algebraic Multigrid (LAMG): Fast Graph Laplacian Linear Solver
- Recursively Accelerated Multilevel Aggregation for Markov Chains
- Analysis of Multigrid Preconditioning for Implicit PDE Solvers for Degenerate Parabolic Equations
- Analysis of a Multigrid Method as an Iterative Technique for Solving Linear Systems
- Multilevel Adaptive Aggregation for Markov Chains, with Application to Web Ranking
- A General Setting for the Parametric Google Matrix
- Maximum‐weight‐basis preconditioners
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A Multigrid Tutorial, Second Edition
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- Support Theory for Preconditioning
- V-cycle Optimal Convergence for Certain (Multilevel) Structured Linear Systems
- New Preconditioners for KKT Systems of Network Flow Problems
- Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods
- Multigrid Methods for Multilevel Circulant Matrices
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- A Survey of Eigenvector Methods for Web Information Retrieval
- Adaptive Smoothed Aggregation ($\alpha$SA) Multigrid
- Adaptive Algebraic Multigrid
- Support-Graph Preconditioners
- A review of algebraic multigrid
