20.07.2013 Views

Culegere de probleme de Analiz˘a numeric˘a

Culegere de probleme de Analiz˘a numeric˘a

Culegere de probleme de Analiz˘a numeric˘a

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

(restul în forma lui Cauchy)<br />

(Rnf)(x) =<br />

b<br />

a<br />

(x−t) n<br />

f<br />

n!<br />

(n+1) (t)dt<br />

(restul în formă integrală.<br />

Dacă în formula lui Taylor se iaa = 0, se obt¸ine formula lui MacLaurin<br />

un<strong>de</strong><br />

f(x) = f(0)+xf ′ (0)+···+ xn<br />

n! f(n) (0)+(Rnf)(x),<br />

(Rnf)(x) = xn+1<br />

(n+1)! f(n+1) (θx), θ ∈ (0,1).<br />

Dăm formulele lui Taylor (MacLaurin) pentru câteva funct¸ii uzuale<br />

e x = 1+x+ x2<br />

2!<br />

sinx = x− x3<br />

3!<br />

cosx = 1− x2<br />

2!<br />

+···+ xn<br />

n! +Rn(x); (1.1)<br />

+ x5<br />

5!<br />

+ x4<br />

4!<br />

+···+(−1)n x2n+1<br />

(2n+1)! +R2n+1(x); (1.2)<br />

+···+(−1)n x2n<br />

(2n)! +R2n(x); (1.3)<br />

x3 xn<br />

+ +···+(−1)n<br />

ln(1+x) = x− x2<br />

2 3 n+1 +Rn+1(x); (1.4)<br />

(1+x) k <br />

k k<br />

= 1+ x+ x<br />

1 2<br />

2 <br />

k<br />

+···+ x<br />

n<br />

n +Rn(x), (1.5)<br />

un<strong>de</strong> <br />

k<br />

=<br />

n<br />

k(k −1)...(k −n+1)<br />

Aplicat¸ii<br />

.<br />

n!<br />

I. La <strong>de</strong>terminarea punctelor <strong>de</strong> extrem s¸i inflexiune ale unor funct¸ii.<br />

Teorema 1.0.1 Fief : I → R s¸i a ∈ I. Dacă f admite <strong>de</strong>rivată <strong>de</strong> ordinul<br />

n peI, continuă peI, s¸i dacă<br />

atunci<br />

f ′ (a) = f ′′ (a) = ··· = f (n−1) (a) = 0 s¸i f (n) (a) = 0<br />

• dacăn = 2k s¸i f (n) (a) < 0, atunciaeste un punct <strong>de</strong> maxim relativ;<br />

• dacăn = 2k s¸i f (n) (a) > 0, atunciaeste un punct <strong>de</strong> minim relativ;<br />

3

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!