I am struggling to understand the Hermite interpolation algorithm using divided differences. I am reading from Pg.23/24 here
In their notation, $m_j$ denotes the
"number of derivatives that we have to interpolate for each point $x_j$"
So, for example, $m_0$ is the number of derivatives that we have to interpolate for the point $x_0$.
Then they write We let $n$ denote the total number of points including their multiplicities
Okay, this I understand. However, their next line is what confuses me:
Why do they have $m_1, m_2, \cdots , m_{\ell}$ as underbraces there? Don't the $m_j$ variables denote the number of derivatives that we have to interpolate for the $x_j$ point? In the following example, you can see my confusion.
Then they say the interpolation polynomial is $p_{n-1}(x) = f[y_0] + \sum_{j=1}^{n-1}f[y_0, \cdots, y_j] \prod_{k=0}^{j-1}(x - y_k)$
I want to walk through their $2.18$ example of finding the interpolating polynomial that satisfies $p(x_0) = f(x_0), p(x_1) = f(x_1), \; p'(x_1) = f'(x_1)$.
So we have two nodes $x_0, x_1$. We have zero derivatives that we have to interpolate at $x_0$ so $m_1 = 0$. There is one derivative that we have to interpolate at $x_1$ so $m_2 = 1$. $n$ is suppose to be the total number of points including their multiplicities so $n = 3$, but from my logic it should be equal to only $1$ since $n = m_1 + m_2$.
What is going on?