Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Biconjugate gradient method
open-in-new
<p>In <a href="/facts/Mathematics/pxTouaz4">mathematics</a>, more specifically in <a href="/facts/Numerical_linear_algebra/jnS6Tteb">numerical linear algebra</a>, the biconjugate gradient method is an <a href="/facts/Algorithm/fnl5NmRt">algorithm</a> to solve <a href="/facts/System_of_linear_equations/fk9CFdgp">systems of linear equations</a> </p> A x = b . {\displaystyle Ax=b.\,} <p>Unlike the <a href="/facts/Conjugate_gradient_method/AFwzBS4U">conjugate gradient method</a>, this algorithm does not require the <a href="/facts/Matrix_(mathematics)/qa8FI4ko">matrix</a> A {\displaystyle A} to be <a href="/facts/Self-adjoint/rKqGtlpy">self-adjoint</a>, but instead one needs to perform multiplications by the <a href="/facts/Conjugate_transpose/7eBWtqVG">conjugate transpose</a> A*. </p>