A comparative numerical study of graph-based splitting algorithms for linear subspaces
This paper presents a comparative numerical study of six graph-based splitting algorithms specialized for linear subspaces, identifying optimal relaxation parameters and analyzing iteration counts to reveal performance patterns that may inform future theoretical analysis.