• DocumentCode
    939363
  • Title

    An asymptotically superior algorithm for computing the characteristic polynomial of a tridiagonal matrix

  • Author

    Krishna, Hari

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Syracuse Univ., NY, USA
  • Volume
    76
  • Issue
    10
  • fYear
    1988
  • fDate
    10/1/1988 12:00:00 AM
  • Firstpage
    1393
  • Lastpage
    1394
  • Abstract
    The author describes an algorithm for computing the characteristic polynomial of a tridiagonal matrix. It is quite general and consists in the application of the divide-and-conquer technique to the evaluation of a three-term recurrence relation. The algorithm developed requires O(n log2n) arithmetic operations as compared to the classical algorithm that requires O(n2 ) arithmetic operations
  • Keywords
    matrix algebra; polynomials; arithmetic operations; characteristic polynomial; divide-and-conquer technique; three-term recurrence relation; tridiagonal matrix; Arithmetic; Computational complexity; Mathematics; Military computing; Polynomials; Writing;
  • fLanguage
    English
  • Journal_Title
    Proceedings of the IEEE
  • Publisher
    ieee
  • ISSN
    0018-9219
  • Type

    jour

  • DOI
    10.1109/5.16343
  • Filename
    16343
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=939363