Biconjugate gradient method

In mathematics, more specifically in numerical linear algebra, the biconjugate gradient method is an algorithm to solve systems of linear equations

${\displaystyle Ax=b.\,}$

Unlike the conjugate gradient method, this algorithm does not require the matrix ${\displaystyle A}$ to be self-adjoint, but instead one needs to perform multiplications by the conjugate transpose A^*.