Piecewise Interpolation

Author

Apurva Nakade

Published

July 13, 2026

Piecewise interpolation methods approximate a function using simple pieces — straight line segments or low-degree polynomials — fit between a set of sample points. These methods are central to numerical analysis because they let us work with unknown or expensive-to-evaluate functions using only a handful of samples.

Adaptive Integration

Computational Math

Adaptive Quadrature

Error Estimation

Adaptive quadrature refines the partition of \([a,b]\) only where it’s needed, instead of the fixed grid used in Numerical Integration: it compares Simpson’s rule on \([a,b]\)…

Numerical Integration

Computational Math

Trapezoidal Rule

Approximates \(\int_a^b f(x)\, dx\) by replacing \(f\) with a simple piecewise interpolant on \(n\) equally spaced subintervals and integrating that interpolant exactly — a…

Polynomial Interpolation

Computational Math

Linear Interpolation

Connects \(n+1\) samples of \(f\) on \([a,b]\) with straight segments (linear) or with cubics matching value and first two derivatives at each node (cubic spline), then…