Symbolic computation (CAS)

Level UniversityDifficulty ★★★★★Application⌖ Open in the map

What is it?

Programs that manipulate formulas exactly: simplify, differentiate, integrate, expand in series, solve. Calculus as term rewriting on expression trees.

Formulas

ddx(u⋅v)  ⇝  u′⋅v+u⋅v′\frac{\dd}{\dd x}(u\cdot v) \;\rightsquigarrow\; u'\cdot v + u\cdot v'

Why does it matter?

CAS check proofs, derive formulas for numerical codes and generate the derivative code that AD now often replaces.

The mathematics behind it

  • Differentiation rules★★★★★fundamental

    Each rule is a rewrite rule on the expression tree; the hard part is simplifying the result.

  • The Risch algorithm decides whether an elementary antiderivative exists and finds it — a landmark of computer algebra.

  • Derivative★★★★★frequent

    Symbolic differentiation is the textbook example of term rewriting on expression trees.

  • Fundamental theorem of calculus★★★★★frequent

    CAS evaluate definite integrals by finding an antiderivative (Risch algorithm) and applying Barrow's rule.

  • Taylor and Maclaurin series★★★★★frequent

    CAS compute series expansions (series(f, x, 0, n)) to simplify, take limits and approximate.

  • Real numbers★★★★★frequent

    Computer algebra systems keep 2\sqrt 2 or π\pi exact as symbols instead of approximating them.

  • Functions★★★★★frequent

    A CAS represents functions as expression trees that can be simplified, differentiated and integrated.

  • Integration by parts★★★★★frequent

    A standard heuristic of symbolic integrators (LIATE ordering).

This page has the essentials. A fuller treatment (intuition, formal definition, worked example) is on the way.

↑ ↓ to navigate · ↵ · Esc