Skip to content

symmetric matrices algorithms to compute eigenvalue/eigenvector pairs

License

Notifications You must be signed in to change notification settings

felipeZ/eigenvalues

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Build Status License crates.io badge docs

Eigenvalue Decomposition

This package contains some iterative algorithms for computing the eigenvalues/eigenvectors of a symmetric matrix H, implemented in Rust.

Matrix Representation

The library examples represent H using the nalgebra DMatrix type, but the matrix H does not need to be dense. Sparse or other representations are handled by implementing the Matrixoperations trait.

Available Algorithms:

Note:

The Davidson method is suitable for diagonal-dominant symmetric matrices that are quite common in certain scientific problems like electronic structure calculations. The Davidson method could be not practical for other kind of symmetric matrices.