# The conjugateGradient package

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.

- No changelog available

## Properties

Versions | 1.0, 1.1, 1.2, 1.3, 1.4, 2.0, 2.1, 2.2 |
---|---|

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

License | BSD3 |

Copyright | Levent Erkok, 2013 |

Author | Levent Erkok |

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

Stability | Experimental |

Category | Math |

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

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

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

Uploaded | Fri Apr 19 03:38:55 UTC 2013 by LeventErkok |

Distributions | NixOS:2.2 |

Downloads | 998 total (79 in last 30 days) |

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

## Modules

[Index]

## Downloads

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

#### Maintainers' corner

For package maintainers and hackage trustees