Summary: Solving a sparse linear system of the form \(Ax=b\) is a common engineering task, e.g., as a step in approximating solutions of differential equations. Inverting a large matrix \(A\) is often too expensive, and instead engineers rely on iterative methods, which progressively approximate the solution \(x\) of the linear system in several iterations, where each iteration is a much less expensive (sparse) matrix-vector multiplication.
We present a formal proof in the Coq proof assistant of the correctness, accuracy and convergence of one prominent iterative method, the Jacobi iteration. The accuracy and convergence properties of Jacobi iteration are well-studied, but most past analyses were performed in real arithmetic; instead, we study those properties, and prove our results, in floating-point arithmetic. We then show that our results are properly reflected in a concrete implementation in the C language. Finally, we show that the iteration will not overflow, under assumptions that we make explicit. Notably, our proofs are faithful to the details of the implementation, including C program semantics and floating-point arithmetic.
For the entire collection see [Zbl 1531.68022].