A Nonlinear Algebraic Multigrid Framework for the Power Flow Equations
DOI10.1137/16M1109965zbMATH Open1446.65017OpenAlexW2803250208WikidataQ129779675 ScholiaQ129779675MaRDI QIDQ5745129FDOQ5745129
Panayot S. Vassilevski, Colin Ponce, D. 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
Recommendations
- Algebraic multigrid for the nonlinear powerflow equations
- Solving the nonlinear power flow problem through general solutions of under-determined linearised systems
- Newton Method and Trajectory-Based Method for Solving Power Flow Problems: Nonlinear Studies
- On Generalizing the Algebraic Multigrid Framework
- On a comparison of Newton-Raphson solvers for power flow problems
- Non-Galerkin coarse grids for algebraic multigrid
- A semismooth Newton method for solving optimal power flow
- scientific article; zbMATH DE number 1863288
- Multigrid for model reduction of power grid networks.
- A robust and informative method for solving large-scale power flow problems
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of solutions to systems of equations (65H10)
Cites Work
- Anderson Acceleration for Fixed-Point Iterations
- Title not available (Why is that?)
- Multi-Level Adaptive Solutions to Boundary-Value Problems
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- A Multigrid Tutorial, Second Edition
- Multilevel Block Factorization Preconditioners
- Efficient solution of symmetric eigenvalue problems using multigrid preconditioners in the locally optimal block conjugate gradient method
- Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
- An improved convergence analysis of smoothed aggregation algebraic multigrid
- Algebraic Multigrid for Markov Chains
- Solving Graph Laplacian Systems Through Recursive Partitioning and Two-Grid Preconditioning
- Accelerated multigrid for graph Laplacian operators
- An efficient multigrid method for graph Laplacian systems
- Non-Galerkin coarse grids for algebraic multigrid
- Reducing communication in algebraic multigrid using additive variants
- Nonlinear multigrid solvers exploiting AMGe coarse spaces with approximation properties
- Commuting projections on graphs
- Engineering a combinatorial Laplacian solver: lessons learned
- Reducing parallel communication in algebraic multigrid through sparsification
- A two‐grid SA‐AMG convergence bound that improves when increasing the polynomial degree
Cited In (2)
Uses Software
This page was built for publication: A Nonlinear Algebraic Multigrid Framework for the Power Flow Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745129)
