Minimal Polynomial Algorithms for Finite Sequences

TL;DR

This paper presents a simplified version of a minimal polynomial algorithm for finite sequences, improving upon recent methods by rewriting a known algorithm.

Contribution

It offers a more straightforward and accessible algorithm for computing minimal polynomials, enhancing existing approaches.

Findings

Simpler algorithm derived from known methods

Equivalent performance to recent algorithms

Potential for easier implementation and understanding

Abstract

We show that a straightforward rewrite of a known minimal polynomial algorithm yields a simpler version of a recent algorithm of A. Salagean.