Frédéric Lehobey
- 1.ABDELJAOUED, J. Algorithmes rapides pour le calcul du polyn~me caractgristique. PhD thesis, U.F.R. des sciences et techniques de l'Universitd de Franche-Comtd, Besan(;on, France, March 1997.Google Scholar
- 2.ARNAUDIES, J.-M., AND VALIBOUZE, A. R~solvantes de Lagrange. Rapport interne 93/61, LITP, d~cembre 1993. To appear in Journal of Pure and Applied Algebra, special issue of MEGA'96.Google Scholar
- 3.ARNAUDIES, J.-M., AND VALIBOUZE, A. Calculs de rdsolvantes. Rapport interne 94/46, LITP, juillet 1994.Google Scholar
- 4.BErtKOWlTZ, S. J. On computing the determinant in small parallel time using a small number of processors. Information Processing Letter, 18 (1984), 147-150. Google ScholarDigital Library
- 5.BErtwlcI<, W. E. H. The condition that a quintic equation should be soluble by radicals. Proceedings of the London Mathematical Society (2) 14 (1915), 301-307.Google Scholar
- 6.BERWICK, W. E. H. On soluble sextic equations. Proceedings of the London Mathematical Society (2) 29 (1929), 1-28.Google Scholar
- 7.BrtENT, R. P. Multiple-precision zero-finding methods and the complexity of elementary function evaluation. In Analytic Computational Complexity, J. F. Traub, Ed. Academic Press, 1975, pp. 151-176.Google Scholar
- 8.CASr'ERSON, D., AND McKAv, J. Symmetric functions, m-sets, and Galois groups. Mathematics of Computation 63, 208 (October 1994), 749-757. Google ScholarDigital Library
- 9.EICHENLAUB, Y., AND OLIVlErt, M. Computation of galois groups for polynomials with degree up to eleven. Preprint, 1994.Google Scholar
- 10.GIUSTI, M., LAZArtD, D., AND VALIBOUZE, A. Algebraic transformations of polynomial equations, symmetric polynomials and elimination. In ISSAC'88, LNCS 358, P. Gianni, Ed., Springer, pp. 309-314. Google ScholarDigital Library
- 11.HENrttCl, P. Automatic computations with power series. Journal of the Association for Computing Machinery 3, 1 (January 1956), 10-15. Google ScholarDigital Library
- 12.HENrtICX, P. Discrete Fourier Analysis - Cauchy Integrals - Construction of Conformal Maps - Univalent Fhnctions, vol. 3 of Applied and Computational Complex Analysis. John Wiley and Sons, New York, 1986.Google Scholar
- 13.KOZEN, D., AND LANDAU, S. Polynomial decomposition algorithms. JSC 7 (1989), 445-456. Google ScholarDigital Library
- 14.LAGRANGE, J.-L. Rdflexions sur la rdsolution algdbrique des dquations, vol. 3 of (Buvres de Lagrange. Gauthier-Villars, Paris, 1869, pp. 205-421. Nouveaux Mdmoires de l'Acad4mie royale des Sciences et Belles- Lettres de Berlin, armies 1770 et 1771.Google Scholar
- 15.LEHOBEY, F. Calcul de rdsolvantes r~cursives. In preparation.Google Scholar
- 16.LEHOBEY, F. Algorithmic methods and practical issues in the computation of Galois group of polynomials. DEA, Universitd de Rennes 1, 1993.Google Scholar
- 17.SoICSErt, L. The computation of Galois groups. Master's thesis, Concordia University, Montreal, 1981.Google Scholar
- 18.SOICHER, L. H. An algorithm for computing Galois groups. In Computational Group Theory. Academic Press, London, 1984, pp. 291-296.Google Scholar
- 19.STAUDUHAR, R.P. The determination of Galois groups. Mathematics of Computation 27, 124 (October 1973), 981-996.Google Scholar
- 20.VALIBOUZE, A. Galois groups of all polynomials with applications up to degree 7. Private communication, August 1996.Google Scholar
- 21.VALIBOUZE, A. Modules de Cauchy, polynSmes caractdristiques et rdsolvantes. Rapport interne 95/62, LITP, janvier 1996.Google Scholar
Index Terms
- Resolvent computations by resultants without extraneous powers
Recommendations
Heuristics to sift extraneous factors in Dixon resultants
AbstractDixon resultant is an efficient and practical method for simultaneously eliminating many variables from a parametric polynomial system P with coefficients in a field. It has been widely used in a variety of scientific fields including ...
Algebraic computation of resolvents without extraneous powers
This paper presents an algorithm for computing algebraically relative resolvents which enhances an existing algorithm by avoiding the accumulation of superfluous powers in the intermediate computations. The superfluous power generated at each step is ...
Multivariate resultants in Bernstein basis
ADG'08: Proceedings of the 7th international conference on Automated deduction in geometryMacaulay and Dixon resultant formulations are proposed for parametrized multivariate polynomial systems represented in Bernstein basis. It is proved that the Macaulay resultant for a polynomial system in Bernstein basis vanishes for the total degree ...
Comments