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

A fixed grid of \(n\) equally spaced subintervals, as in Numerical Integration, spends the same effort everywhere — even on parts of \([a,b]\) where \(f\) is nearly linear…

Numerical Integration

Computational math

Trapezoidal rule

The definite integral \(\int_a^b f(x)\, dx\) can be approximated by replacing \(f\) with a simple piecewise interpolant on \(n\) equally spaced subintervals \([x_0, x_1]…

Linear vs. Cubic Spline Interpolation

Computational math

Linear interpolation

Given a function \(f\) on \([a, b]\), sample it at \(n+1\) equally spaced nodes \(x_0 < x_1 < \dots < x_n\) and connect the samples \((x_i, f(x_i))\) with simple pieces. A li…