• DocumentCode
    1711093
  • Title

    Deterministic computation of the Frobenius form

  • Author

    Storjohann, Arne

  • Author_Institution
    Ontario Res. Centre for Comput. Algebra, Univ. of Western Ontario, London, Ont., Canada
  • fYear
    2001
  • Firstpage
    368
  • Lastpage
    377
  • Abstract
    A deterministic algorithm for computing the Frobenius canonical-form of a matrix over a field is described. A similarity transformation-matrix is recovered in the same time. The algorithm is nearly optimal, requiring about the same number of field operations as required for matrix multiplication. Previously-known reductions to matrix multiplication are probabilistic.
  • Keywords
    computational complexity; deterministic algorithms; matrix multiplication; optimisation; Frobenius canonical-form; Frobenius form; deterministic algorithm; deterministic computation; field operations; matrix multiplication; probabilistic reductions; similarity transformation matrix; Algebra; Algorithms; Application software; Bismuth; Computer science; Costs; Polynomials; Shape; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on
  • Print_ISBN
    0-7695-1116-3
  • Type

    conf

  • DOI
    10.1109/SFCS.2001.959911
  • Filename
    959911
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1711093