ILU++
- is a software package to solve sparse linear systems iteratively
- using state of the art preprocessing techniques (i.e. scaling and reordering of the coefficient matrix)
- using state of the art multilevel incomplete LU factorizations implementing both pivoting by rows and columns
- using new dropping techniques to reduce the propagation of errors in factorization
- is fully templated object oriented C++ code for maximal flexibility
- additionally provides a library for the most important features so that ILU++ can be linked easily with other programs
- is made available under the GNU General Public License and comes without any warranty
- currently is version 1.1.1
What is new?
- ILU++ now allow complex matrices.
- ILU++ now includes its own preprocessing routine to make an I-matrix (a matrix having elements of modulus 1 on the diagonal and elements of at most modulus one elsewhere).
- ILU++ now uses improved error and memory handling.
- ILU++ has an interface for C++ vectors from the Standard Template Library.
An Introduction to ILU++
Download ILU++ Thanks to Holger Obermaier for implementing a few bugfixes. No other changes were made in the update from version 1.1 to 1.1.1.
Extensive Numerical Results and Examples for a Large Number of Matrices
updated last: Thu Jul 26 12:30 CET 2012
