2009 | OriginalPaper | Buchkapitel
The FGLM Problem and Möller’s Algorithm on Zero-dimensional Ideals
verfasst von : Teo Mora
Erschienen in: Gröbner Bases, Coding, and Cryptography
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Möller’s Algorithm is a procedure which, given a set of linear functionals defining a zero-dimensional polynomial ideal, allows to compute, with good complexity,
a set of polynomials which are triangular/bihortogonal to the given functionals;
at least a “minimal” polynomial which vanishes to all the given functionals;
a Gröbner basis of the given ideal.
As such Möller’s Algorithm has applications
when the functionals are point evaluation (where the only relevant informations are the bihortogonal polynomials);
as an interpretation of Berlekamp–Massey Algorithm (such interpretation is due to Fitzpatrick) where the deduced minimal vanishing polynomial is the key equation;
as an efficient solution of the FGLM-Problem (deduced with good complexity the lex Gröbner basis of a zero-dim. ideal given by another easy-to-be-computed Gröbner basis of the same ideal).