Researchers break speed barrier in solving important class of linear systems Date: October 22, 2010 Source: Carnegie Mellon University Summary: Computer scientists have devised an innovative and ...

A classic algorithm for solving linear systems, dubbed Gaussian elimination in modern times, was first published by Chinese mathematicians 2,000 years ago.

The most famous quantum linear system solving algorithm is the Harrow-Hassidim-Lloyd (HHL) algorithm, which accelerates the solution of linear systems through quantum superposition and interference.

Y. Saad, Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems, Mathematics of Computation, Vol. 37, No. 155 (Jul., 1981), pp. 105-126 ...

Methods for solving symmetric indefinite systems are surveyed including a new one which is stable and almost as fast as the Cholesky method.