Asosiy tarkibga o'tish

4.13-bo'lim : Nyuton usuli

5. \({x^3} - {x^2} - 15x + 1 = 0\) ning barcha ildizlarini oltita kasrgacha aniq topish uchun Nyuton usulidan foydalaning.

Yechim

Birinchidan, Nyuton usuli tenglamani \(f\left( x \right) = 0\) ko'rinishida yechishini eslang va shuning uchun bizda (umid qilamanki) juda aniq:

\[f\left( x \right) = {x^3} - {x^2} - 15x + 1\]

Keyinchalik, bizga \({x_{\,0}}\) boshlang'ich qiymati berilmaydi va yuqoridagi 3 va 4-masalalardan farqli o'laroq, bizga \({x_{\,0}}\) ning yaxshi mumkin bo'lgan qiymatini aniqlash usuli sifatida foydalanish uchun interval ham berilmagan. Shuningdek, bizga qancha ildiz topishimiz kerakligi aytilmagan.

Albatta, agar biz eslash Bizning algebra ko'nikmalarimiz bizda kub ko'phadga ega ekanligini ko'rishimiz mumkin va shuning uchun tenglamaning ko'pi bilan uchta alohida ildizi bo'lishi kerak (ba'zilari takrorlanishi mumkin va shuning uchun bizda uchta alohida ildiz bo'lmasligi mumkin ...). Buni bilib, biz potentsial boshlang'ich qiymatlarni olish uchun qilishimiz kerak bo'lgan narsa - bu funktsiyaning tezkor eskizini qilishdir.

\(x\) qiymatlarining to'g'ri diapazonini aniqlashda cheksizlik chegaralari haqida bilganimizni yodda tuting. Bu holda \(x\) ning eng katta kuchi g'alati bo'lgani uchun biz \(x \to \infty \) sifatida grafik ham musbat cheksizlikka, \(x \to - \infty \) sifatida esa manfiy cheksizlikka yaqinlashishini bilamiz. Shunday qilib, biz \(x\)-ning katta diapazoni bilan boshlashimiz mumkin, bu biz kutgan xatti-harakatni grafikning o'ng/chap uchlarida beradi va keyin grafikda ko'rsatilgan haqiqiy ildizlarni ko'rmagunimizcha uni toraytiramiz.

Shunday qilib,

The graph of \({x^3} - {x^2} - 15x + 1\).  The graph comes up from the lower left, crosses the x-axis near \(x = - 3.4\), rises to a peak of about 19 near \(x = - 2\), then falls, crossing the x-axis just to the right of the origin, down to a valley of about -26 near \(x = 2.6\), and then rises again, crossing the x-axis near \(x = 4.3\).  Because the graph crosses the x-axis three times there are three roots.

Demak, biz bu yerda uchta ildizga ega bo'lamiz shekilli (i.e. grafik \(x\) o'qini uch marta kesib o'tadi va shuning uchun uchta ildiz ...).

Har bir ildiz uchun biz izlayotgan ildizga yaqin bo'lgan \({x_{\,0}}\) qiymatini tanlash uchun grafikdan foydalanamiz (muammo uchun chapdan o'ngga o'tamiz) va keyin Nyuton usulidan o'tamiz,

\[{x_{n + 1}} = {x_n} - \frac{{f\left( {{x_n}} \right)}}{{f'\left( {{x_n}} \right)}}\]

javoblar olti kasrga mos kelguncha.

Shuni ham yodda tutingki, 3 va 4-muammolardan farqli o'laroq, biz ushbu muammo uchun barcha funktsiyalarni baholashni kiritmaymiz. Har bir iteratsiya uchun yakuniy javoblarimizni tekshirish va tasdiqlashni sizga qoldiramiz.

2-qadam

Eng chap ildiz uchun \({x_{\,0}} = - 3.5\) dan boshlaylik. Mana bu ildiz uchun Nyuton usuli orqali takrorlash natijalari.

\[\begin{align*}{x_{\,1}} & = {x_{\,0}} - \frac{{f\left( {{x_{\,0}}} \right)}}{{f'\left( {{x_{\,0}}} \right)}} = - 3.443478261 & \hspace{0.5in} & {\mbox{No decimal places agree}}\\ {x_{\,2}} & = {x_{\,1}} - \frac{{f\left( {{x_{\,1}}} \right)}}{{f'\left( {{x_{\,1}}} \right)}} = - 3.442146902 & \hspace{0.5in} & {\mbox{Accurate to two decimal places}}\\ {x_{\,3}} & = {x_{\,2}} - \frac{{f\left( {{x_{\,2}}} \right)}}{{f'\left( {{x_{\,2}}} \right)}} = - 3.44214617 & \hspace{0.5in} & {\mbox{Accurate to six decimal places}}\end{align*}\]

Shunday qilib, eng chap ildizning taxminiy qiymati quyidagicha ko'rinadi: \(\require{bbox} \bbox[2pt,border:1px solid black]{{x \approx - 3.44214617}}\).

3-qadam

O'rta ildiz uchun \({x_{\,0}} = 0\) dan boshlaylik. Bu ildiz bilan ehtiyot bo'ling. Grafikdan biz shunchaki ildiz nolga teng deb aytishimiz mumkin. Biroq, biz ko'rib turganimizdek, ildiz nolga teng emas. Bu nolga yaqin, lekin aniq nolga teng emas!

Mana bu ildiz uchun Nyuton usuli orqali takrorlash natijalari.

\[\begin{align*}{x_{\,1}} & = {x_{\,0}} - \frac{{f\left( {{x_{\,0}}} \right)}}{{f'\left( {{x_{\,0}}} \right)}} = 0.06666666667 & \hspace{0.5in} & {\mbox{No decimal places agree}}\\ {x_{\,2}} & = {x_{\,1}} - \frac{{f\left( {{x_{\,1}}} \right)}}{{f'\left( {{x_{\,1}}} \right)}} = 0.06639231824 & \hspace{0.5in} & {\mbox{Accurate to three decimal places}}\\ {x_{\,3}} & = {x_{\,2}} - \frac{{f\left( {{x_{\,2}}} \right)}}{{f'\left( {{x_{\,2}}} \right)}} = 0.06639231426 & \hspace{0.5in} & {\mbox{Accurate to eight decimal places}}\end{align*}\]

Shunday qilib, o'rta ildizning taxminiy qiymati quyidagicha ko'rinadi: \(\require{bbox} \bbox[2pt,border:1px solid black]{{x \approx 0.06639231426}}\).

4-qadam

Eng to'g'ri ildiz uchun \({x_{\,0}} = 4.5\) dan boshlaylik. Mana bu ildiz uchun Nyuton usuli orqali takrorlash natijalari.

\[\begin{align*}{x_{\,1}} & = {x_{\,0}} - \frac{{f\left( {{x_{\,0}}} \right)}}{{f'\left( {{x_{\,0}}} \right)}} = 4.380952381 & \hspace{0.5in} & {\mbox{No decimal places agree}}\\ {x_{\,2}} & = {x_{\,1}} - \frac{{f\left( {{x_{\,1}}} \right)}}{{f'\left( {{x_{\,1}}} \right)}} = 4.375763556 & \hspace{0.5in} & {\mbox{Accurate to one decimal place}}\\ {x_{\,3}} & = {x_{\,2}} - \frac{{f\left( {{x_{\,2}}} \right)}}{{f'\left( {{x_{\,2}}} \right)}} = 4.375753856 & \hspace{0.5in} & {\mbox{Accurate to four decimal places}}\\ {x_{\,4}} & = {x_{\,3}} - \frac{{f\left( {{x_{\,3}}} \right)}}{{f'\left( {{x_{\,3}}} \right)}} = 4.375753856 & \hspace{0.5in} & {\mbox{Accurate to nine decimal places}}\end{align*}\]

Shunday qilib, eng to'g'ri ildizning taxmini quyidagicha ko'rinadi: \(\require{bbox} \bbox[2pt,border:1px solid black]{{x \approx 4.375753856}}\).

5-qadam

Hisoblash vositalaridan foydalanib, biz ushbu tenglamaning haqiqiy ildizlari ekanligini aniqladik,

\[x = - 3.44214616993\hspace{0.5in}x = 0.0663923142603\hspace{0.5in}x = 4.37575385567\]

E'tibor bering, ular aslida muammoda so'ralmagan va faqat taqqoslash uchun berilgan.

Nyuton usuli haqida so'nggi ogohlantirish sifatida, bir nechta takrorlash bilan oltita (yoki ba'zi hollarda yaxshiroq) o'nlik kasrni olasiz deb o'ylamang.

Ushbu muammolar usulning bir necha iteratsiyasini talab qilishini anglagan holda tanlangan. \({x_{\,0}}\) muammolari va/yoki tanlovlari mavjud bo'lib, ular uchun har qanday turdagi haqiqiy aniqlikni olish uchun sezilarli darajada ko'proq iteratsiyalar kerak bo'ladi, agar usul ushbu tenglama va/yoki \({x_{\,0}}\) tanlovi uchun ham ishlaydi. Eslatib o'tamiz, biz eslatmalarda usulning ajoyib tarzda muvaffaqiyatsizlikka uchragan misolini ko'rdik.