Talk:Lanczos algorithm

[[1]] - an unfocused variety of Lanczos algorithm

This doesn't have much but it does have a reference to a book mathworld on Lanczos Algorithm]

I don't believe this is the Lanczos algorithm at all. It is the power method.

I don't know if the algorithm is correct, but it's certainly different than the power method, and presented pretty clearly. I think it's gotten me on the right track at least... Thanks. --Jjdonald (talk) 22:22, 17 December 2007 (UTC)[reply]

Extracting information from tridiagonal matrix

So Lanczos gives you a tridiagonal matrix. I think a link would be helpful which explains how to extract low eigenvalues/eigenvectors from this matrix. —Preceding unsigned comment added by 209.6.144.249 (talk) 06:30, 2 March 2008 (UTC)[reply]

agree - or largest eigenvalues: anyway, the article starts by saying that it's for calculating eigenvalues, but then only describes how it's used to get tridiag. matrix.

b.t.w., the algorithm calculates up to v[m+1], I think this could be avoided. (also, "unrolling" the 1st part of the m=1 case as initialization should allow to avoid using v[0].) — MFH:Talk 03:09, 11 September 2008 (UTC)[reply]

PS: also, it should be said what is 'm'...