Você está na página 1de 2

# METODOS NUMERICOS

## TALLER REGLA DE SIMPSON

Jair Stick Acosta Cedeno

1.
f (x) = c3 x3 + c2 x2 + c1 x + c0 (1)
Z b Z b
f (x)dx = c3 x3 + c2 x2 + c1 x + c0 dx (2)
a a
hc c2 3 c1 2 ib
3
= x4 + x + x + c0 x (3)
4 3 2 a

c3 4 c2 3 c1 2 c3 c2 c1
b + b + b + c0 b a4 a3 a2 c0 a (4)
4 3 2 4 3 2
Z b    
ba a+b
f (x)dx = f (a) + 4f + f (b) (5)
a 6 2
h  i
ba a+b 3 a+b 2 a+b
3 2
  
= 6 (c3 a + c2 a + c1 a + c0 ) + 4 c3 2 + c2 2 + c1 2 + c0

+ [(c3 b3 + c2 b2 + c1 b + c0 )]
h i
ba c3 a3 3 2 3 3
= 6
c 3 a3 + c 2 a2 + c 1 a + c 0 + 2
+ 2
a bc3 + 2
ab2 c3 + c3 b2

## + [a2 c2 + abc2 + b2 c2 + 2ac1 + 2bc1 + 4c0 + c3 b3 + c2 b2 +c1 b + c0 ]

 
ba 3 3 2 3 3 2 3 2 3 2
= a c3 + 2a c2 + 3ac1 + 6c0 + b c3 + 2b c2 + 3bc1 + a bc3 + ab c3 + abc3 (6)
6 2 2 2 2

a4 c 3 a3 c 2 a2 c 1 b4 c 3 b3 c 2 b2 c 1
= ac0 + + + + bc0 (7)
4 3 2 4 3 2
c 3 b4 c 2 b3 c 1 b2 c 3 a4 c 2 a3 c 1 a2
= + + + c0 b + c0 a (8)
4 3 2 4 3 2
2.
41
A= [f (1) + 4f (1,5) + 2f (2) + 4f (2,5) + 2f (3,0) + 4f (3,5) + f (4)] (9)
6
1
A= [1,3 + 4(1,5) + 2(3) + 4(3,3) + 2(2,2) + 4(2,4) + 1,9] (10)
2
1
A= [42,4] = 21,2 u2 (11)
2
3. 1
Z
ex
5 dx (12)
1 x2

1
Z 1
1
t 2 et dt (13)
0
Z 1 Z b
ex 5 1
5 dx = lm x 2 e x dx (14)
1 x 2 b 0

t= 1
x
; dt = x2 dx

Z b Z b Z 1
25 1 1
t 1
x e dx =
x t e dt =
2 t 2 et dt (15)
1 1 b

hacemos b = 0 y obtenemos :

Z 0 Z 1
52 1 1
x e dx =
x t 2 et d (16)
1 0

1+0 1
n=4 , h= 2
= 2

Z 1        
1
t 1 1 1 3
t e dt =
2 f (1) + 4f + 2f + 4f + f (1) (17)
0 6 4 2 4
1
= [2,7183 + 2,5681 + 2,3316 + 7,3335 + 2,7183] = 2,945 u2 (18)
6
4. a) Z x
1
Li(x) = dt (19)
2 ln t
1
Li(x) ln x
lm = lm lnx1
(20)
x x lnx x
ln2 x
1
ln x x
lm = lm 1 =1 (21)
x lnx 1 x x

b)
x 100
= 21,7147 ; n=4 (22)
ln x ln 100
Z 100
1 49
Li(100) = dt = [f (2) + 4f (49) + f (100)] = 27,11 (23)
2 ln t 3
La integral proporciona una buena aproximacion, pues el numero real de numeros primos menores
a 100 es 25.