An iterative algorithm for solving sparse linear equations

摘要

This article introduces a new iterative technique for solving systems of linear equations of the kind Ax = b. Convergence, and with a given rate, is guaranteed with the square nonsingular matrix A being non-negative. The iterative algorithm depends on a scheme derived from Bayesian updating. The algorithm is shown to compare very favorably with the wisely used GMRES routine. With the algorithm being easy to code, it has the potential to be highly useable.