Fortran Looking for a Lamczos program in fortran

  • Thread starter Thread starter yshai avishai
  • Start date Start date
  • Tags Tags
    Fortran Program
AI Thread Summary
A user is seeking a user-friendly Fortran 77 source deck for the Lanczos algorithm tailored for large sparse Hermitian matrices, expressing difficulty with an existing resource by Jane Cullum and Ralph Willoughby. Recommendations include LINPACK, which offers various resources on Lanczos, and ARPACK, a library designed for large-scale eigenvalue problems. Caution is advised regarding the age of the Cullum and Willoughby work, as it may not meet modern standards for large eigenproblems, given that their largest test problem involved only 5,000 degrees of freedom. For those interested in a deeper understanding of the Lanczos method, a comprehensive resource is available that provides extensive insights into the algorithms.
yshai avishai
Messages
1
Reaction score
0
Anyone can help me getting a source deck of Lanczos in f77 for large sparse Hermitian matrices? I need one that is user friendly. There is one written by Jane Cullum and Ralph Willowghbi that I find too difficult to use. Or is there some library that has it and can be linked?

Thanks in advance
 
Technology news on Phys.org
Have you tried LINPACK?
 
I don't know that book, but it was written in 1985 so it dates back almost to the start of "practical" use of Lanczos eigensolution methods, and therefore I would be cautious about the quality of the algorithms. Also note the authors' largest test problem was only 5,000 DOF, which is 100 times smaller than today's concept of a "large" eigenproblem.

Try http://www.caam.rice.edu/software/ARPACK/
 
Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...
I had a Microsoft Technical interview this past Friday, the question I was asked was this : How do you find the middle value for a dataset that is too big to fit in RAM? I was not able to figure this out during the interview, but I have been look in this all weekend and I read something online that said it can be done at O(N) using something called the counting sort histogram algorithm ( I did not learn that in my advanced data structures and algorithms class). I have watched some youtube...

Similar threads

Replies
2
Views
1K
Replies
16
Views
3K
Replies
2
Views
3K
Replies
5
Views
2K
Replies
20
Views
6K
Replies
8
Views
2K
Back
Top