The conjugateGradient package

[Tags:bsd3, library]

Sparse matrix linear-equation solver, using the conjugate gradient algorithm. Note that the technique only applies to matrices that are symmetric and positive-definite. See for details.

The conjugate gradient method can handle very large sparse matrices, where direct methods (such as LU decomposition) are way too expensive to be useful in practice. Such large sparse matrices arise naturally in many engineering problems, such as in ASIC placement algorithms and when solving partial differential equations.

[Skip to Readme]


Versions 1.0, 1.1, 1.2, 1.3, 1.4, 2.0, 2.1, 2.2
Dependencies base (==4.*), containers, random [details]
License BSD3
Copyright Levent Erkok, 2013
Author Levent Erkok
Maintainer Levent Erkok (
Stability Experimental
Category Math
Home page
Bug tracker
Source repository head: git clone git://
Uploaded Wed Apr 17 03:17:11 UTC 2013 by LeventErkok
Distributions NixOS:2.2
Downloads 1708 total (20 in the last 30 days)
0 []
Status Docs uploaded by user
Build status unknown [no reports yet]




Maintainer's Corner

For package maintainers and hackage trustees

Readme for conjugateGradient

Readme for conjugateGradient-2.0

Conjugate Gradient Solver 

[![Build Status](](

Sparse matrix linear equation solver, using the Conjugate Gradient algorithm:

The method is applicable to matrices that are symmetric and positive definite.

On hackage: