Graduate Efficiently Computing Eigenvalues of a Sparse Banded Matrix

Click For Summary
Efficient computation of eigenvalues for a sparse banded matrix, specifically a penta-diagonal Hamiltonian, is discussed. LAPACK routines, particularly dsyev and dsbev, are mentioned, though the latter did not yield significant improvements due to the distance of the outer bands. The limitations of LAPACK in leveraging sparsity for matrices with bands far from the diagonal are noted. ARPACK is suggested as an alternative, although its documentation is considered challenging to navigate. Exploring these options could enhance the efficiency of eigenvalue computations for the specified matrix structure.
Jimmy and Bimmy
Messages
3
Reaction score
0
I have a Hamiltonian represented by a penta-diagonal matrix

The first bands are directly adjascent to the diagonals. The other two bands are N places above and below the diagonal.

Can anyone recommend an efficient algorithm or routine for finding the eigenvalues and eigenvectors?
 
Physics news on Phys.org
DrClaude said:
Thanks for the reply.

I have been using dsyev from the lapack routine (which is for symmetric matrices). I switched to dsbev (which is for symmetric band matrices), but didn't see much improvement. This is because, even though I only have 5 bands (diagonal + 2 upper + 2 lower), the outer 2 bands are a good distance away, and lapack doesn't take advantage of spare matrices.

Someone recommended arpack, but the documentation can be hard to follow.
 

Similar threads

  • · Replies 33 ·
2
Replies
33
Views
1K
  • · Replies 22 ·
Replies
22
Views
4K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 11 ·
Replies
11
Views
4K