conjugateGradient: Sparse matrix linear-equation solver

[ bsd3, library, math ] [ Propose Tags ]

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]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 1.0, 1.1, 1.2, 1.3, 1.4, 2.0, 2.1, 2.2
Dependencies base (>=4 && <5), containers (>=0.5), random [details]
License BSD-3-Clause
Copyright Levent Erkok, 2013
Author Levent Erkok
Maintainer Levent Erkok (
Category Math
Home page
Bug tracker
Source repo head: git clone git://
Uploaded by LeventErkok at 2013-04-20T06:34:41Z
Distributions NixOS:2.2
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 6390 total (18 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for conjugateGradient-2.2

[back to package description]
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: