plan3.tgz is the resulting package of Lanczos routines for finding eigenvalues (and eigenvectors) of symmetric-real and complex-hermitian sparse matrices. It has both a single-processor and a parallel version. It is based on the PLANSO package by Wu and Simon.
A x = lambda E xwhere A and E are Hermitian and E is positive semi-definite. Currently, we assume E is also diagonal.
During the summer of 2004, Geneva student Justin Lambright developed numerical methods for solving these problems. See Justin Lambright's project summary (PDF) (LaTeX).
As detailed in the project summary, we developed a dense version semidefinite.f, and a sparse version sparsesd.tgz which uses SPOOLES and plan3.tgz. A second sparse version blocksparse.tgz assumes the constrained part of the matrix is block-diagonal; it does not use SPOOLES. We have not yet parallelized this code.
See libaries by Yousaf Saad in Duluth
The computers are connected via two parallel Gigabit Ethernet networks. During the summer of 2004, extensive benchmarking of the system was performed by Geneva student Jeremy Pace. Here is his summary of activities (PDF) (LaTeX).
echo 1 > /proc/sys/net/ipv4/conf/eth?/proxy_arpin
rc.localwon't work for network restarts. Instead, here is a script that will be run automatically on startup:
Brett van de Sande,
Homepage: http://www.geneva.edu/~bvds and