# conjugateGradient: Sparse matrix linear-equation solver

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 http://en.wikipedia.org/wiki/Conjugate_gradient_method 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 [faq] | 1.0, 1.1, 1.2, 1.3, 1.4, 2.0, 2.1, 2.2 |
---|---|

Dependencies | base (==4.*), containers (>=0.5), random [details] |

License | BSD-3-Clause |

Copyright | Levent Erkok, 2013 |

Author | Levent Erkok |

Maintainer | Levent Erkok (erkokl@gmail.com) |

Category | Math |

Home page | http://github.com/LeventErkok/conjugateGradient |

Bug tracker | http://github.com/LeventErkok/conjugateGradient/issues |

Source repo | head: git clone git://github.com/LeventErkok/conjugateGradient.git |

Uploaded | by LeventErkok at Sat Apr 20 06:34:41 UTC 2013 |

Distributions | NixOS:2.2 |

Downloads | 4011 total (137 in the last 30 days) |

Rating | (no votes yet) [estimated by rule of succession] |

Your Rating | |

Status | Docs uploaded by user Build status unknown [no reports yet] |

## Downloads

- conjugateGradient-2.2.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)