# Taylor’s Theorem and the Accuracy of Linearization

## Contents

# 4. Taylor’s Theorem and the Accuracy of Linearization#

**References:**

Theorem 0.8 in Section 0.5 Sauer

Section 1.1 of Burden&Faires, from Theorem 1.14 onward

## 4.1. Taylor’s Theorem …#

Taylor’s Theorem is most often staed in this form: when all the relevant derivatives exist,

The polynomial part of this,

is the **Taylor polynomial of degree \(n\) with center \(a\) for function \(f\)**, and the *remainder* is

with the value \(c_x\) lying between \(a\) and \(x\), and so depending on \(x\).

This gives information about the absolute error in the polynomial \(T_n(x)\) as an approximation of \(f(x)\):

where \(M_{n+1}\) is the maximum absolute value of \(f^{(n+1)}\) over the relevant interval between \(a\) and \(x\).

Of course we typically do not know much about that constant \(M_{n+1}\), so often the most important thing is the power law rate \(|x-a|^{n+1}\) at which the error reduces as \(x\) approaches \(a\).

## 4.2. … in the “h” form#

Taylor polynomials are therefore most useful when the quantity \(h := x-a\) is small, and we will most often use them in situations where the limit as \(h \to 0\) is relevant. It is convenient to change the notation a bit, treating \(h\) as the variable:

with this polynomial in \(h\) approximating \(f(a+h)\) in that

(Note: \(h\) may be negative!)

This gives a bound on the absolute error

with

## 4.3. Error formula for linearization#

A very common use of Taylor’s Theorem is the rather simple case \(n=1\); *linearization*, to approximate a twice diferentiable function by a linear one.
(This will be even more so when we come to system of equations, since the only such systems that we can systematically solve exactly are linear systems.)

Taylor’s Theorem for the linearization \(L(x) = f(a) + f'(a)(x-a)\) of \(f\) at \(a\) then says that

or in terms of \(h\),

Thus there is an error bound

Of course sometimes it is enough to use the maximum over the whole domain, \(M_2 = \max |f''(x)|\).

This work is licensed under Creative Commons Attribution-ShareAlike 4.0 International