Fast eigensolver for dense real-symmetric matrices. A new eigensolver for dense real-symmetric matrices resulting from upgrading and combining previous programs is tested for matrices of orders 100 to 2000 on Cray YMP, Pentium, Mips R1×000 and Dec Alpha 21×64 single processors. Comparisons of execution times with the latest versions (November 1999) of LAPACK routines are quite favorable, by a factor of two in most cases, while requiring only one half as much memory and no special installation.
Keywords for this software
References in zbMATH (referenced in 2 articles )
Showing results 1 to 2 of 2.
- Vinitsky, Sergue; Gusev, Alexander; Chuluunbaatar, Ochbadrakh; Rostovtsev, Vitaly; Le Hai, Luong; Derbov, Vladimir; Krassovitskiy, Pavel: Symbolic-numerical algorithm for generating cluster eigenfunctions: tunneling of clusters through repulsive barriers (2013)
- Bunge, Carlos F.: Fast eigensolver for dense real-symmetric matrices (2001)