vide = G

,
i= 1 , 3
, ...,
In
I(f)
= ) Fuldu =
Wifi in o

I
=
1 In 2
12
0 ,
-

= ...,
,

f(U) ~
Hn(x)

) 'Hn(u)dx =) 'f
for F = 1 1 2
, ..., h
The In unknowns Mi ,
Wi
In CH him t
the

can be determined by solving

In equations as
= ,

I'm f, File
O i 2n-1

=
'nidu
1, 3
,

Will=
= ...,

2 In-2
&
i = 0 ,
2
, ....

In (f) Aifi Bit o

treeiee
= +

S "ide
i

flu) = xi ,
= Wy
, e

Phil)dn ) hilu)
-
I
here
, du
Ai Bi
= ,
=
the Hermite interpolation polynomial
·
Approximate flul by
Un
degree (2n-1) ming n
interpolation pts .
2
, U2
, ...,

f(x) ~Hp(u) of degree 20-1 latmost

of
In (f) is 2n -
degree of

EN fihi(u) I f!
Thus , the of precision
f(n) ~Ha(k) = + Tie e
We select the nodes His sit .

[1-2 li (i) (n xi)] [li()]

BitS'illde Gi en
where,
h , (m)
-

=
=
e
:

Fi(k) =
(x-xi) [li (2)] ↳e

s(n)
li(k) => 1(n) (n : is
=
-

with <
En(Pm)
m
( xi)l(ki)
-
= 0 ,
In -
 = ' Sec Chil di It can be proved that :

Bi =

&
nFh

S'Pn(n)
,

Pm(u) d =

Bi
=) a) Mi(u)dn
(el =

T i e n +,
n = m

.e
. Pn(n) are orthogonal in [1 1] /

I
Bi = 0
,
= 1 ,
2,
. . . ,
N

1(x)li(k)
Fi(x) =

l'(n ; )
·
Legendre polynomial is defined as :

Pn(n) = (x- x) .... (n-kn) 1(k) =

(U 2)-

... (U-xn)

the
where , 2 , H2 , ..., In are the zeros of Pn(n) if we choose x , 22 , ..., Un are zeros

of Pn(n). Then , 1(u) are orthogonal.

Pn(M) = 0 ,
U = Mc , H2
, . .
., Un
Then

, 'Mikuldn
= 0 i = 1 , 2
, .
i
,
with distinct
Pu(n) has degree n n zeros
.

1(U) has degree

jam (2 1)
In
Pn(n) =
-
as

1n-1
1i(n) has degree

Pn(1) =
1
,
fr The ,
Bi = 0
,
i= 1 ,
2 , . . .,
N