Computing the lowest eigenvalues of the Fermion matrix by subspace iterations

@inproceedings{Bunk1996ComputingTL,
  title={Computing the lowest eigenvalues of the Fermion matrix by subspace iterations},
  author={Burkhard Bunk},
  year={1996}
}
provides the smallest eigenvalue, together with the corresponding eigenvector. The minimum of a functional can be found iteratively by the method of conjugate gradients (CG)[1], its application to the special case of the Ritz functional has been worked out by Geradin[2] and Fried[3]. If a small number of lowest eigenvalues is required instead, q(x) may be minimised repeatedly, restricting x to the space orthogonal to the previous eigenvectors. An efficient implementation of this idea is… CONTINUE READING
2 Citations
2 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-2 of 2 references

W

  • W. H. Press, B. P. Flannery, S. A. Teukolsky
  • T. Vetterling, Numerical Recipes, Cambridge…
  • 1989
Highly Influential
3 Excerpts

Modern Algorithms for Large Sparse Eigenvalue Problems, Akademie

  • A. Meyer
  • 1987
1 Excerpt

Similar Papers

Loading similar papers…