Mathematics for computer algebra
Mathematics for computer algebra
Symbolic integration I: transcendental functions
Symbolic integration I: transcendental functions
Simultaneous elimination by using several tools from real algebraic geometry
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Using Symmetric Functions to Describe the Solution Set of a Zero Dimensional Ideal
AAECC-11 Proceedings of the 11th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Journal of Symbolic Computation
On computing polynomial GCDs in alternate bases
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Computing polynomial LCM and GCD in lagrange basis
ACM Communications in Computer Algebra
Hi-index | 0.00 |
In this paper, we describe the application of a new version of Barnett's method to the squarefree decomposition of a univariate polynomial with coefficients in K [ x ], x being a parameter and K a characteristic zero field. This new version of Barnett's method uses Bezoutian matrices instead of matrices obtained from evaluating polynomials in a companion matrix and allows the determination of the squarefree decomposition parametrizing the gcd of the polynomial and its successive derivatives with respect to the main variable. The application of this parametric squarefree decomposition to the integration of parametric rational functions is also presented.