Free Computer Algebra Books

Rectifying transform, integration of trigonometrics. JSC 1997

Recursive integration of piecewise functions

Evaluation of trig integrals with discontinuities

Integration of signum, piecewise functions

Algorithms for partial fraction decomposition and integration of rational functions

Risch-Norman integration method

Improving exact integrals from CAS

Squarefree decomp. of polynomials with parameter and integration

y' + fy = g (EUROSAM84)

Parallel Risch algorithm II

On the Integration of Algebraic Functions

Integration in finite terms with error function

Integration in finite terms with special functions (EUROSAM84)

Symbolic integration of elliptic integrals. JSC 1999

Unification of Liouvillian extensions

Symbolic integration tutorial

SUM-It, a computer algebra library (96)

Linear ODEs, breaking through order 2 barrier

Lazy Hermite reduction (integration of algebraic functions)

Integration of elementary functions

Full partial fraction decomposition

Intro to pseudo-linear algebra

Method of differentiating under the integral sign

elementary integration.txt

Algorithm 628. Groebner bases for polynomial ideals

Groebner bases and syzygy completion (master-thesis)

Prime decomposition of radicals of polynomial ideals

Complexity of Wu-Ritt decomposition

An Algorithm to Construct Groebner Bases for Solving Integration by Parts Relations

Variable elimination using resultants (Ph. D. thesis 1997)

Zero structure theorem for exp-polynomials

The EZ polynomial GCD algorithm

Polynomial system solving survey 1994

Introduction to commutative and noncommutative Groebner bases

Hilbert function for primary ideal 1995

Groebner bases using syzygies

Eagon, Northcott, Groebner

Applying Macaulay's Trick in order to easily write a Groebner basis

Resultants of composed polynomials

Multiplicities in polynomial systems

Groebner duality and multiplicities in polynomial systems

Groebner duality and multiplicities in polynomial systems

Resolution des systemes algebriques (phd these)

Complexity of Groebner basis of radical ideal

Buchberger algorithm for complexes

Elementary subresultants theory. JSC2003

Loesung der Systemen mit kontinuerlichen Symmetrien (phd thesis)

Remarks on comprehensive Groebner and SAGBI bases

Sugar cube selection strategies for Buchberger algorithm

Selection strategies in Buchberger algorithm

GCDs and factoring multivariate polynomials using Groebner bases

Relation between Pommaret and Janet bases

Radical of polynomial ideals over arbitrary fields

New efficient algorithm for Groebner bases

Groebner bases and integration of rational functions

Heuristic selection strategy for Groebner bases

Lecture notes on Groebner bases

Factorization of polynomial systems

Multivariate polynomial resultants

Seminar on computer algebra

Holonomic systems and automatic proofs of identities. RR-2371

Holonomic functions in computer algebra (slides, talk)

Groebner bases and symbolic summation and integration

Fonctions holonome et calcul formel (PhD Thesis, fr)

Dynamic algorithm for Groebner bases

Gsolve - faster Groebner bases solver

Bezout's method for computing the resultant

Monomial representations for Groebner bases

Data representation in FELIX (DISCO92)(2 pages with Groebner basis examples)

Solving linear diophantine systems

Lower bounds for diophantine approximations

Algorithm 288, Solution of linear Diophantine systems

Undecidability of zeros of elementary functions

Zero-test algorithms for functions

Witness for zero-testing

Complexity bounds for zero-test algorithms

Complexity bounds for zero-testing of polynomials

The uniformity conjecture

The uniformity conjecture

The elementary constant problem

Testing the uniformity conjecture

Testing the uniformity conjecture

Recognizing zero

How to recognize zero

Identity of elementary functions and constants

Zero recognition of polynomial terms

Simplified method for recognizing zero in constants

What can we do with a solution (cca2002)

Problem of recognizing zero (preprint)

Problem of recognizing zero (JACM 18, 559)

What is a closed-form number

A strong computable separation bound for arithmetic expressions with radicals

Branch cuts in computer algebra

SIMATH, a CAS for number theory

CAS Benchmark 1999

Risa-asir - a CAS

Comparison of polynomial CAS

Comparison of CAS (maple code)

Approach to natural language processing using rules

Rule-based systems

1
2
3
4
...