Skip to main content

A fast parallel algorithm for eigenvalue problem of jacobi matrices

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 324))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cook S.A. The taxonomy of problems with fast parallel algorithms. Inf. and Control, v. 64, 1985, 2–22.

    Google Scholar 

  2. Parlett B.N. The symmetric eigenvalue problem. Prentice-Hall, 1980.

    Google Scholar 

  3. Reif J.H. Logarithmic depth circuits for algebraic functions. SIAM J. on Computing, v. 15, No.1, 1986, pp. 231–242.

    Google Scholar 

  4. Vichirco V.I. An algorithm for some sum of reciprocals. Zap. Nauchn. Semin. LOMI, v. 137, Leningrad, 1984, pp. 3–6 (In Russian).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frumkin, M.A. (1988). A fast parallel algorithm for eigenvalue problem of jacobi matrices. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017152

Download citation

  • DOI: https://doi.org/10.1007/BFb0017152

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics