Having done with subspace iteration method, I think now I can understand and implement the Lanczos method. In fact the lanczos algorithm is simpler than the subspace, but it seems to me that the common Lanczos algorithms give the largest eigenvalues rather than smalles ones. That being true, does anyone have a reference for the case of calculating smallest eigenvalues?(adsbygoogle = window.adsbygoogle || []).push({});

Your help would be highly appreciated.

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# The Lanczos method

Loading...

Similar Threads for Lanczos method | Date |
---|---|

I Econometrics regression method | Sep 20, 2017 |

I Preconditioning for linear equations | Nov 25, 2016 |

I Difference Equation Boundary Conditions0. | Oct 10, 2016 |

Lanczos Eigenvectors | Nov 3, 2009 |

Testing a Lanczos (tridiagonalization) algorithm | Jul 9, 2008 |

**Physics Forums - The Fusion of Science and Community**