Everything About ___
Live briefing

Everything about Conjugate gradient method

Mathematical optimization algorithm

In mathematics, the conjugate gradient method is an algorithm for the numerical solution of particular systems of linear equations, namely those whose matrix is positive-semidefinite. The conjugate gradient method is often implemented as an iterative algorithm, applicable to sparse systems that are too large to be handled by a direct implementation or other direct methods such as the Cholesky decomposition. Large sparse systems often arise when numerically solving partial differential equations or optimization problems. Wikipedia →

đź§­ Start here: a 6-step reading path

  1. Read the overview: Conjugate gradient methodA 5-minute orientation
  2. Skim a recent paper: An efficient hybrid conjugate gradient method for unconstrained optimizationInfluential work since 2022
  3. Pick up a classic book: Conjugate gradient type methods for ill-posed problemsThe most-reprinted book on the subject
  4. Read the landmark paper: Restart procedures for the conjugate gradient methodCited 1,379 times
  5. Go sideways: Biconjugate gradient methodA closely related topic
  6. Go sideways: Anderson accelerationA closely related topic

đź“– Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

đź”— Related topics