AI RESEARCH
Towards Universal Convergence of Backward Error in Linear System Solvers
arXiv CS.LG
•
ArXi:2604.16075v1 Announce Type: cross The quest for an algorithm that solves an $n\times n$ linear system in $O(n^2)$ time complexity, or $O(n^2 \text{poly}(1/\epsilon))$ when solving up to $\epsilon$ relative error, is a long-standing open problem in numerical linear algebra and theoretical computer science. There are two predominant paradigms for measuring relative