Skip to search formSkip to main contentSkip to account menu

Biconjugate gradient method

Known as: Bi-CG, Bicg 
In mathematics, more specifically in numerical linear algebra, the biconjugate gradient method is an algorithm to solve systems of linear equations… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
AlgorithmBiconjugate gradient stabilized methodChebyshev iterationConjugate gradient method

Broader (1)

Numerical linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property
We introduce an iterative method named BiLQ for solving general square linear systems Ax = b based on the Lanczos… 
2015
2015
GPU acceleration of EBE method for 3-D linear steady eddy current field
Parallel computing of three dimension (3D) linear steady eddy current problem based on element by element (EBE) method is… 
2013
2013
A Parallel Variant of BiCGStar-Plus Method Reduced to Single Global Synchronization
In this paper, we propose new product-type iterative methods by introducing the BiCGSafe strategy, i.e., utilization of associate… 
2010
2010
Recycling BiCG for Model Reduction
Science and engineering problems frequently require solving a sequence of dual linear systems. Two examples are the Iterative… 
2007
2007
An improved bi-conjugate residual algorithm suitable for distributed parallel computing
2005
2005
New implementation of QMR-type algorithms
1999
1999
Reducing global synchronization in the biconjugate gradient method
Starting from a specific implementation of the Lanczos biorthogonalization algorithm, an iterative process for the solution of… 
1999
1999
ML(k)BiCGSTAB: A BiCGSTAB Variant Based on Multiple Lanczos Starting Vectors
We present a variant of the popular BiCGSTAB method for solving nonsymmetric linear systems. The method, which we denote by ML(k… 
1997
1997
A Variant of the Biconjugate Gradient Metho Suitable for Massively Parallel Computing
Starting from a specific implementation of the Lanczos biorthogonalization algorithm, an iterative process for the solution of… 
1993
1993
A New Approach to Construction of Efficient Iterative Schemes for Massively Parallel Applications: Variable Block CG and BiCG Methods and Variable Block Arnoldi Procedure
The iterative solution of large sparse symmetric and unsymmetric linear systems comprises the most time consuming stage when… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)