Local Linear Approximation (Multivariate)
The single-variable local linear approximation generalizes elegantly to multiple variables. Near a point , a differentiable function is approximated by a linear function:
This can be written compactly as , where is the Jacobian matrix (row vector of partials). This linear map is the best linear approximation to near .
Geometrically for : the graph is a surface in , and the local linear approximation gives the tangent plane at the point . The equation of the tangent plane is .
Formal View
Why This Matters
The local linear approximation is the foundation of all first-order optimization methods and sensitivity analysis.
- Gradient descent: moving in the direction that decreases the LLA most rapidly
- Error propagation: estimating how small input errors translate to output errors
- Newton's method in multiple variables uses the LLA to take linearized steps
Quiz
For at the point , the local linear approximation is:
The local linear approximation of at equals plus a dot product of the gradient and the displacement vector.
Common Mistakes
- Forgetting the constant term — the LLA is an affine function, not a linear one.
- Using global approximation when the LLA is only accurate near .
- Confusing the LLA (a real-valued affine function) with the Jacobian matrix (a matrix).