arXiv:2611.23829v1 Announce Type: new Abstract: For linear systems arising from the discretization of certain classes of mathematical models, the splitting of the linear system into its Hermitian and skew-Hermitian parts has a physical meaning. If, in addition, the Hermitian part is positive definite, there exist Krylov subspace methods based on three-term recurrences where the Hermitian part is used as a preconditioner. Two such Krylov subspace methods are Widlund's method and Rapoport's method. In this paper we establish a ``near-optimal'' guarantee for the convergence of Widlund's method, showing that the overall convergence of Widlund's method is nearly as good as that of Rapoport's method. Specifically, we show that for every iteration $k$, there exists an iteration $j\leq k$ where the residual norm of Widlund's method is less than $\sqrt{k+1} $ times the residual norm of Rapoport's method at iteration $k$. This bound is sharp. We also provide a computational study on various implementations of Widlund's method in the exact and inexact cases, and show that certain implementations may stagnate while others do not, i.e., we look at the robustness of the different implementations. We recommend two implementations.