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]


Versions1.0, 1.1, 1.2, 1.3, 1.4, 2.0, 2.1, 2.2
Change logNone available
Dependenciesbase (==4.*), containers (>=0.5), random [details]
CopyrightLevent Erkok, 2013
AuthorLevent Erkok
MaintainerLevent Erkok (
Home page
Bug tracker
Source repositoryhead: git clone git://
UploadedSat Apr 20 06:34:41 UTC 2013 by LeventErkok
Downloads1403 total (35 in last 30 days)
0 []
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees

Readme for conjugateGradient-2.2

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: