MONET (Matrix Ordering algorithm for minimum NET-cuts) is a software which orders a unsymmetric into (single) bordered block diagonal matrix of the form
where the are matrices, in general rectangular with .
This reordering have a number of applications. One of these is in the parallel solution of general unsymmetric linear systems, through the factorization of the diagonal blocks in parallel.
You can find a short description of the algorithm used in MONET here, or you may want to get the paper.
tar -xvf monet_1.0_XXX.tar
This will create a MONET directory. There is a README file and a postscript document in the doc directory. Here are the gzipped tar files:
|ALPHA||DIGITAL Fortran 90 V5.2-705||-O5|
|SGI/IRIX 6.5||MIPSpro Compilers: Version 188.8.131.52m||-O3 -n32|
|PentiumII/LINUX RedHat 6.0||Absoft F90 compiler 1.01||-O|
|IBM/AIX||XL Fortran compiler 184.108.40.206||-O|
|SUN SunOS 5.7||WorkShop F90 compiler 2.0||-O|