Hermite reduction
The step of symbolic integration that splits the integral of a rational function A/D into a rational function and an integral whose denominator is squarefree, using only extended gcds and no factorization of D. What remains after it integrates to a sum of logarithms.
For , the integral of is a rational function plus a sum of logarithms, and the rational part comes entirely from the repeated factors of . Hermite's method removes them one power at a time.[1] Write with squarefree, and . Since is squarefree, , so and the extended Euclidean algorithm gives and with
and then
To check it, differentiate the first term:
Adding the integrand on the right, the terms cancel and what is left is . Each step lowers the power of by one, so repeating it along the square-free decomposition ends with a squarefree denominator.
For : , , , . Solving gives , , and
The derivative of the result minus the integrand, by central differences with h = 1e-6.
x = 0.3 -3.7e-11x = 1.0 -2.1e-11x = 2.5 -7.6e-12
The remaining integral has a squarefree denominator, so it is a sum of logarithms over the algebraic closure; is . The Rothstein–Trager resultant finds those logarithms without factoring the denominator. Hermite reduction is also the rational part of the Risch algorithm, applied in the top variable of a tower.
Ostrogradsky (1845) and Horowitz (1971) get the same split in one step:[3][2] with and , there are polynomials with , and their coefficients solve a single linear system.
see also
- Partial fractionsRewriting a rational function as a polynomial plus one term per irreducible factor power of the denominator. Splitting across coprime denominators is the Bezout identity and nothing more; doing it over irreducible rather than square-free factors is what requires a factoriser.
- Square-free decompositionSplitting a polynomial into pairwise coprime square-free factors with their multiplicities. In characteristic zero, Yun's algorithm gets a whole multiplicity level per GCD because a polynomial and its derivative share exactly the repeated factors; in characteristic p it needs an extra branch, since the derivative of x^p is zero.
- Risch algorithmA decision procedure for integration in finite terms: given an elementary function, it either finds an elementary antiderivative or proves that none exists. It rests on Liouville's theorem, which fixes the form any elementary antiderivative must have, and works through a tower of logarithmic and exponential extensions of the rational functions.
further reading
- [1]C. Hermite, “Sur l’intégration des fractions rationnelles”, Nouvelles Annales de Mathématiques, 2e série, 11 (1872).
- [2]M. V. Ostrogradsky, “De l’intégration des fractions rationnelles”, Bulletin de la classe physico-mathématique de l’Académie Impériale des Sciences de Saint-Pétersbourg 4 (1845).
- [3]E. Horowitz, “Algorithms for partial fraction decomposition and rational function integration”, SYMSAM (1971).
- [4]M. Bronstein, Symbolic Integration I: Transcendental Functions, Springer (2nd ed., 2005).