Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm (Q2400307)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
scientific article

    Statements

    Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm (English)
    0 references
    0 references
    28 August 2017
    0 references
    In this paper, the authors address the interesting topic of multivariate polynomial root-finding i.e., given a finite set of points, the problem is to find a (minimal) set of multivariate polynomials that vanish on the set. In this direction, they develop two SVD-based algorithms in affine and projective settings. In addition, applying the differential functionals, it is shown how to support the multiplicity of the roots. Finally, the methods described in the paper have been applied to several polynomial dynamical system problems.
    0 references
    0 references
    numerical Buchberger-Möller algorithm
    0 references
    singular value decomposition
    0 references
    reduced Gröbbner basis
    0 references
    polynomial dynamical systems
    0 references
    fixed points
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers