Efficient Diagonalisation of Bogoliubov deGennes Equation on Large Grids

[ayankhan]

Dear Colleagues,
My work is related to the diagonalisation of Bogoliubov deGennes (BDG) equation.
But numerically it is becomming very tough when I go beyond 51\times 51 grid.
I am working in fortran90 and using lapack subroutine (zheevx) for diagonalisation. The matrix is not sparse.
regards
ayan

 

[olgranpappy]

Dear Colleagues,
My work is related to the diagonalisation of Bogoliubov deGennes (BDG) equation.
But numerically it is becomming very tough when I go beyond 51\times 51 grid.
I am working in fortran90 and using lapack subroutine (zheevx) for diagonalisation. The matrix is not sparse.
regards
ayan

and what is your question? ;P

oh, okay, the question is implied. So, how big is the matrix you are diagonalizing?

 

[ayankhan]

I want to resolve the hamiltonian in 101\times101 grid. which means the BDG matrix will be of 202\times202.
regards
ayan

 

[olgranpappy]

I want to resolve the hamiltonian in 101\times101 grid. which means the BDG matrix will be of 202\times202.
regards
ayan

That's not very big... What seems to be the problem? In fact this is small enough that you should be able to do it with Mathematica very quickly I think.