Truncated Normal Forms for Solving Polynomial Systems: Generalized and Efficient Algorithms - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2019

Truncated Normal Forms for Solving Polynomial Systems: Generalized and Efficient Algorithms

(1) , (2) , (2)
1
2

Abstract

We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. Normal form algorithms provide an algebraic approach to solve this problem. The framework presented in Telen et al. (2018) uses truncated normal forms (TNFs) to compute the algebra structure of R/I and the solutions of I. This framework allows for the use of much more general bases than the standard monomials for R/I. This is exploited in this paper to introduce the use of two special (nonmonomial) types of basis functions with nice properties. This allows, for instance, to adapt the basis functions to the expected location of the roots of I. We also propose algorithms for efficient computation of TNFs and a generalization of the construction of TNFs in the case of non-generic zero-dimensional systems. The potential of the TNF method and usefulness of the new results are exposed by many experiments.
Fichier principal
Vignette du fichier
paper.pdf (1.14 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01738695 , version 1 (21-03-2018)
hal-01738695 , version 2 (07-12-2018)

Identifiers

Cite

Bernard Mourrain, Simon Telen, Marc van Barel. Truncated Normal Forms for Solving Polynomial Systems: Generalized and Efficient Algorithms. Journal of Symbolic Computation, 2019, ⟨10.1016/j.jsc.2019.10.009⟩. ⟨hal-01738695v2⟩
546 View
458 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More