Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions

DOI10.1006/jsco.2001.0471zbMath1003.12004OpenAlexW1979248351MaRDI QIDQ5945288

Laureano Gonzalez-Vega, Gema Maria Diaz Toca

Publication date: 27 January 2003

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.2001.0471

zbMATH Keywords

Bezoutiansquarefree decompositionunivariate polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in real and complex fields: factorization (12D05) Polynomials, factorization in commutative rings (13P05) Computational methods for problems pertaining to field theory (12-08)

Related Items (1)

Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices

Cites Work

• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• Symbolic integration. I: Transcendental functions
• Simultaneous elimination by using several tools from real algebraic geometry
• An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
• Spécialisation de la suite de Sturm et sous-résultants (I)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions