JaDa: Exact Diagonalization of Large Sparse matrices
Exact Diagonalization of very large sparse matrices is a numerical task common to a wide range of problems in science and engineering. The aim of the project is the efficient implementation of advanced eigenvalue algorithms such as the Jacobi-Davidson method on various present-day supercomputers and exploit the results in scientific applications.
Papers & Talks
Exact Diagonalization of Large Sparse Matrices: A Challenge for Modern Supercomputers
22.5.2000: CUG SUMMIT2001, Indian Wells, USA
Fast sparse matrix-vector multiplication for TeraFlop/s computers
22-28 June 2002: Vecpar2002, Porto, Portugal