Practical improvement of the divide-and-conquer eigenvalue algorithms

@article{Bini1992PracticalIO,
  title={Practical improvement of the divide-and-conquer eigenvalue algorithms},
  author={Dario Bini and Victor Y. Pan},
  journal={Computing},
  year={1992},
  volume={48},
  pages={109-123}
}
We present a practical modification of the recent divide-and-conquer algorithms of [3] for approximating the eigenvalues of a real symmetric tridiagonal matrix. In this modified version, we avoid the numerical stability problems of the algorithms of [3] but preserve their insensitivity to clustering the eigenvalues and the possibility to give a priori upper bounds on their computational cost for any input matrix. We confirm the theoretical effectiveness of our algorithms by numerical… CONTINUE READING

References

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

An iteration scheme for the divide - and - conquer eigenvalue solvers

D. Bini, L. Gemignani
Manuscript , Dipartimento di Matematica , Universit ~ di Pisa , Pisa , • 1991

A divide and conquer method for the symmetric tridiagonal eigenproblem

J. J. M. Cuppen
Numer . Math . • 1981

Rank - one modificationof the symmetric eigenproblem

J. R. Bunch, P. NielsenC., D. C. Sorensen
Numer . Math . • 1978

Eigenvalues of symmetric tridiagonal matrices : a fast , accurate and reliable algorithm

V. Pereyra, G. Scherer
J . Inst . Maths Applies . • 1973

Similar Papers

Loading similar papers…