What Is Linear Approximation?
Linear approximation (also called linearization or the tangent line approximation) replaces a complicated function, near a chosen point, with the simplest function that matches it there: its tangent line. The linearization of f at x = a is:
L(x) = f(a) + f'(a)·(x − a)
For x-values close to a, L(x) ≈ f(x) — often startlingly close. The idea works because differentiable functions are locally straight: zoom in on any smooth curve and it flattens into its tangent line. Linear approximation formalizes the "zoom in" as an algebraic recipe: take the function's value at a well-understood point, and correct it by the slope times the distance you've moved.
This is the first rung of a ladder — matching the value and slope gives a line; matching the concavity too gives a quadratic; continuing the pattern generates Taylor polynomials. In that sense, L(x) is exactly the first-order Taylor polynomial, and the Taylor Series Calculator shows what climbing further up the ladder buys you.
How to Use This Calculator
Enter your function, a center point a (choose one where f and f' are easy to evaluate — perfect squares for roots, multiples of π for trig), and optionally a nearby x-value to estimate. The calculator builds L(x) explicitly, then — if you gave an estimation point — computes L(x), the true f(x), and the absolute error between them, so you can see precisely how good the approximation is. The graph overlays the curve and its linearization; watch how they hug near the center and peel apart farther away.
Worked Example: Estimating √4.1 Without a Calculator
Approximate √4.1 using f(x) = √x centered at a = 4 (chosen because √4 is exact). We need f(4) = 2 and f'(x) = 1/(2√x), so f'(4) = 1/4. The linearization is:
L(x) = 2 + ¼(x − 4)
Then L(4.1) = 2 + ¼(0.1) = 2.025. The true value is √4.1 = 2.02485…, so the approximation is off by about 0.00015 — better than one part in ten thousand, from arithmetic you could do mentally. This is exactly how quick numerical estimates were made for centuries before calculators.
How Good Is the Approximation?
The error of a linear approximation is controlled by the second derivative: |f(x) − L(x)| ≤ M(x−a)²/2, where M bounds |f''| between a and x. Two practical consequences:
- Error grows with the square of the distance. Doubling how far you stray from the center roughly quadruples the error — so stay close to a.
- Flatter curvature means better approximations. Functions with small |f''| near a (gentle bending) are approximated well over wider intervals; sharply curved functions demand you stay closer.
The sign of f'' also tells you the error's direction: where a function is concave down (like √x), the tangent line sits above the curve, so L(x) slightly overestimates — matching our example, where 2.025 exceeded the true 2.02485.
Common Mistakes to Avoid
- Centering at the point you want to estimate. The center a must be a point where you know f(a) and f'(a) exactly; the point you're estimating should be nearby but different.
- Using the approximation too far from the center. L(x) is a local tool — the quadratic error growth makes distant estimates unreliable.
- Confusing L(x) with f(x) in later steps. The linearization is an approximation; carrying it into further exact computations as if it were the true function compounds error.
- Sign slips in (x − a). Estimating below the center makes (x − a) negative — the correction subtracts. Keep the order: the point minus the center.
Real-World Applications of Linearization
Linearization is arguably the most-used single technique in applied mathematics, because linear systems can be solved completely while nonlinear ones usually can't. Control engineering linearizes aircraft dynamics around cruise conditions, chemical reactors around steady states, and power grids around operating points, then designs controllers for the linear model — valid precisely because deviations stay small. The physics classic is the pendulum: replacing sin(θ) by its linearization θ (at a = 0) turns an unsolvable equation into simple harmonic motion, giving the textbook period formula.
In measurement and uncertainty analysis, the standard error-propagation formula — how uncertainty in an input translates to uncertainty in an output — is a direct application of Δf ≈ f'(a)·Δx, the differential form of linear approximation. Surveyors, physicists, and analytical chemists apply it daily. And in economics, statements like "a 1% price increase reduces demand by about 2%" are elasticities: linear approximations of demand curves, useful exactly because real decisions happen in small neighborhoods of current conditions.
Frequently Asked Questions
Is linear approximation the same as the tangent line?
Same line, different emphasis. "Tangent line" names the geometric object; "linear approximation" uses that line as a stand-in for the function to estimate values. The formula L(x) = f(a) + f'(a)(x−a) is the tangent line's equation, deployed as an estimator.
How do I pick a good center point a?
Pick the point nearest your target where the function's exact value is known: perfect squares or cubes for roots (a = 4 for √4.1), multiples of π/6 for trig functions, powers of e for logarithms. The closer the center to the target, the smaller the error.
What are "differentials" (dy and dx) and how do they relate?
The differential form dy = f'(a)·dx expresses the same approximation: a small input change dx produces an output change of approximately f'(a)·dx. It's linear approximation written in change-language rather than value-language, and it's the notation used in error-propagation formulas.
When is linear approximation not good enough?
When you need accuracy far from the center, or the function bends sharply (large |f''|). The remedies are higher-order Taylor polynomials — the Taylor Series Calculator adds quadratic, cubic, and higher correction terms — or simply computing the function directly.
Does the calculator's error report use the true function value?
Yes — it evaluates the actual f at your estimation point numerically and reports |f(x) − L(x)|, so you see the approximation's real accuracy, not just a theoretical bound.
Is Newton's method related to linear approximation?
Directly — Newton's root-finding method approximates f by its linearization at the current guess, solves L(x) = 0 exactly (easy, since L is a line), and takes that solution as the improved guess. Repeating the process converges to a root of f astonishingly fast. It's linear approximation deployed iteratively, and one of the most consequential algorithms built on the idea.