• DocumentCode
    3296955
  • Title

    A rank-two divide and conquer method for the symmetric tridiagonal eigenproblem

  • Author

    Gates, Kevin

  • Author_Institution
    Inst. fuer Wissenschaftliches Rechnen, Zurich, Switzerland
  • fYear
    1992
  • fDate
    19-21 Oct 1992
  • Firstpage
    402
  • Lastpage
    410
  • Abstract
    A rank-two divide and conquer algorithm is developed for calculating the eigensystem of a symmetric tridiagonal matrix. This algorithm is compared to the LAPACK recommended path for this problem and the rank-one divide and conquer algorithm. The timing results on a Sequent Symmetry S81b show that this algorithm has potential as a parallel alternative to the QR algorithm
  • Keywords
    eigenvalues and eigenfunctions; mathematics computing; matrix algebra; LAPACK; QR algorithm; Sequent Symmetry S81b; rank-two divide and conquer method; symmetric tridiagonal eigenproblem; Concurrent computing; Eigenvalues and eigenfunctions; Symmetric matrices;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Frontiers of Massively Parallel Computation, 1992., Fourth Symposium on the
  • Conference_Location
    McLean, VA
  • Print_ISBN
    0-8186-2772-7
  • Type

    conf

  • DOI
    10.1109/FMPC.1992.234887
  • Filename
    234887
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3296955