Algebraic factoring and rational function integration

Authors:
Barry M. Trager
Affiliations:
-
Venue:
SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Year:
1976

Citing 2
Cited 41

The Calculation of Multivariate Polynomial Resultants

Journal of the ACM (JACM)
Symbolic integration: the stormy decade

Communications of the ACM

Uniform closure properties of P-computable functions

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Enlarging the REDUCE domain of computation

SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
The Bath algebraic number package

SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Rational function decomposition

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Scratchpad's view of algebra II: A categorical view of factorization

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Risa/Asir—a computer algebra system

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
On the greatest common divisor of polynomials which depend on a parameter

ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Full partial fraction decomposition of rational functions

ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Factoring polynomials over algebraic number fields via norms

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
The average number of modular factors in Trager's polynomial factorization algorithm

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
High degree solutions of low degree equations (extended abstract)

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Factoring polynomials over local fields

Journal of Symbolic Computation
East Coast Computer Algebra Day '99 (April 24, 1999): abstracts of invited talks and presented posters

ACM SIGSAM Bulletin
Landen transformations and the integration of rational functions

Mathematics of Computation
A New Scheme for Computing with Algebraically Closed Fields

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Exact rotation-minimizing frames for spatial Pythagorean-hodograph curves

Graphical Models
Factorization over finitely generated fields

SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Polynomial factorization and nonrandomness of bits of algebraic and some transcendental numbers

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Solvability by radicals is in polynomial time

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
On the normalization of numbers and functions defined by radicals

Journal of Symbolic Computation
Cited References

Computer algebra handbook
Algorithms for polynomial GCD computation over algebraic function fields

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Probabilistic algorithms for computing resultants

Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Integration in finite terms

ACM SIGSAM Bulletin
A remark on factorisation

ACM SIGSAM Bulletin
Resolvent systems of difference polynomial ideals

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Change of order for bivariate triangular sets

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Computation of the splitting field of a dihedral polynomial

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Lifting and recombination techniques for absolute factorization

Journal of Complexity
Symbolic summation with radical expressions

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
On factorization of multivariate polynomials over algebraic number and function fields

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Computation schemes for splitting fields of polynomials

Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Computing with algebraically closed fields

Journal of Symbolic Computation
Factoring polynomials over global fields I

Journal of Symbolic Computation
Conquering inseparability: Primary decomposition and multivariate factorization over algebraic function fields of positive characteristic

Journal of Symbolic Computation
Fast computation of special resultants

Journal of Symbolic Computation
Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth Theorem

Journal of Complexity
Genus 2 point counting over prime fields

Journal of Symbolic Computation
Using Gröbner bases for finding the logarithmic part of the integral of transcendental functions

Journal of Symbolic Computation
Computing hypercircles by moving hyperplanes

Journal of Symbolic Computation
Indefinite integration as term rewriting: Integrals containing tangent

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new, simple, and efficient algorithm for factoring polynomials in several variables over an algebraic number field. The algorithm is then used iteratively, to construct the splitting field of a polynomial over the integers. Finally the factorization and splitting field algorithms are applied to the problem of determining the transcendental part of the integral of a rational function. In particular, a constructive procedure is given for finding the least degree extension field in which the integral can be expressed.