A Nonlinear Algebraic Multigrid Framework for the Power Flow Equations
From MaRDI portal
Publication:5745129
DOI10.1137/16M1109965zbMath1446.65017OpenAlexW2803250208WikidataQ129779675 ScholiaQ129779675MaRDI QIDQ5745129
Panayot S. Vassilevski, Colin Ponce, David Bindel
Publication date: 5 June 2018
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1109965
Computational methods for sparse matrices (65F50) Numerical computation of solutions to systems of equations (65H10) Iterative numerical methods for linear systems (65F10)
Uses Software
Cites Work
- Unnamed Item
- Accelerated multigrid for graph Laplacian operators
- An efficient multigrid method for graph Laplacian systems
- Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
- Nonlinear multigrid solvers exploiting AMGe coarse spaces with approximation properties
- Engineering a combinatorial Laplacian solver: lessons learned
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- Reducing Parallel Communication in Algebraic Multigrid through Sparsification
- Non-Galerkin Coarse Grids for Algebraic Multigrid
- A two‐grid SA‐AMG convergence bound that improves when increasing the polynomial degree
- Algebraic Multigrid for Markov Chains
- Anderson Acceleration for Fixed-Point Iterations
- Multilevel Block Factorization Preconditioners
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- A Multigrid Tutorial, Second Edition
- An improved convergence analysis of smoothed aggregation algebraic multigrid
- Solving Graph Laplacian Systems Through Recursive Partitioning and Two-Grid Preconditioning
- Reducing communication in algebraic multigrid using additive variants
- Commuting projections on graphs
