Abstract
A new algorithm, the double-bordering algorithm, for the solution of linear systems of equations is derived, and its complexity is shown to be compatible with the complexity of Gaussian elimination, The application of the algorithm to the solution of block-tridiagonal systems is also described.