On Gelbaum's Algorithm for Computing the Minimal Polynomial of a Matrix (Q3707255)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3936375
Language Label Description Also known as
default for all languages
No label defined
    English
    On Gelbaum's Algorithm for Computing the Minimal Polynomial of a Matrix
    scientific article; zbMATH DE number 3936375

      Statements

      On Gelbaum's Algorithm for Computing the Minimal Polynomial of a Matrix (English)
      0 references
      0 references
      1985
      0 references
      operations count
      0 references
      minimal polynomial
      0 references
      This paper compares the operations count for finding the minimal polynomial of a matrix A by the traditional method using det(\(\lambda\) I- A) and by \textit{B. Gelbaum}'s method [ibid. 90, 43-44 (1983; Zbl 0529.15007)]. In both cases \(O(n^ 5)\) multiplications are required, but Gelbaum's algorithm takes only \(O(n^ 4)\) steps in some cases while the traditional method always requires \(O(n^ 5)\) steps.
      0 references

      Identifiers