Ad argvmentvm transi
Topos Uranos

Svmmarivm

Theorema Bolzani praestat fvnctionem continvam qvae signvm mvtat radicem habere, et bisectio eam inclvdit, in singvlis bisectionibvs digitvm binarivm lvcrans. Haec lectio rationem mvlto celeriorem tractat, cvm svccedit: methodvm Newtoni et Raphsoni, qvae delineationem recta sva tangente svbstitvit et pro nova approximatione pvnctvm svmit in qvo tangens axem secat. Approximationes sic obtentae altera post alteram pro nvmeris integris n≥0n \geq 0 definivntvr, et earvm limes per definitionem limitis cvm variabilis ad infinitvm tendit intellegitvr, sine doctrina seqventiarvm. Lectio demonstrat, ope convexitatis, si derivata non evanescit et fvnctio convexa vel concava est, iterata qvae a latere recto proficiscvntvr ad radicem accedere neqve eam praeterire et ad eam convergere; et, ope theorematis valoris medii, valorem fvnctionis, qvi compvtatvr, distantiam a radice, qvae ignoratvr, circvmscribere. Deinde exemplis nvmericis ostendit nvmervm digitorvm rectorvm in singvlis iterationibvs dvplicari, et modos qvibvs methodvs deficit: derivatam nvllam, cyclvm, divergentiam. Problemata radices cvbicas et inversa sine divisione compvtant, cyclvm frangvnt, radicem dvplicem examinant et pro arcv tangente terminvm exactvm inter convergentiam et divergentiam invenivnt.

Proposita discendi

  1. Iterata Newtoni et Raphsoni fvnctionis derivabilis compvtare et in eis concvrsvm rectae tangentis cvm axe agnoscere.
  2. Convergentiam monotonam iteratorvm demonstrare cvm derivata non evanescit et fvnctio convexa vel concava est, et pvnctvm initiale in latere recto eligere.
  3. Distantiam approximationis a radice valore fvnctionis et margine inferiore derivatae eivs circvmscribere.
  4. Modos agnoscere qvibvs methodvs deficit, eamqve cvm bisectione comparare, celeritate et secvritate.

Iteratio

Sit ff fvnctio derivabilis cvivs radix rr qvaeritvr, et sit x0x_0 approximatio prima. Prope x0x_0, delineatio fvnctionis ff rectae svae tangenti similis est, y=f(x0)+f′(x0)(x−x0)y = f(x_0) + f'(x_0)(x - x_0), secvndvm definitionem rectae tangentis in lectione de derivata vt limite; differentiali lectionis de derivatis svccessivis et differentiali dictvm, incrementvm f(x0+Δx)−f(x0)f(x_0 + \Delta x) - f(x_0) simile est qvantitati f′(x0)Δxf'(x_0) \Delta x. Tangens axem in vno tantvm pvncto secat si f′(x0)≠0f'(x_0) \neq 0, et natvrale est id pro nova approximatione svmere: obtinetvr aeqvationem tangentis nihilo aeqvando. Rationem a pvncto obtento iterare est methodvs Newtoni et Raphsoni.

DefinitioIterata Newtoni et Raphsoni

Sint ff fvnctio in intervallo II derivabilis et x0x_0 pvnctvm ipsivs II. Iterata Newtoni et Raphsoni a x0x_0 incipientia svnt nvmeri, alter post altervm, definiti per

xn+1=xn−f(xn)f′(xn)x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)}

dvm xnx_n in II est et f′(xn)≠0f'(x_n) \neq 0. Si hae condiciones pro omni nvmero integro n≥0n \geq 0 valent, iterata fvnctionem n↦xnn \mapsto x_n efficivnt in copia nvmerorvm integrorvm non negativorvm definitam, qvae svpra circvmscripta non est, et definitio limitis cvm variabilis ad infinitvm tendit, ex lectione de limitibvs cvm variabilis ad infinitvm tendit, ad eam adhibetvr. Iterata dicvntvr ad rr convergere si lim⁡n→∞xn=r\lim_{n \to \infty} x_n = r, id est, si

(∀ε>0)(∃M)(∀n≥0)(n>M→∣xn−r∣<ε)(\forall \varepsilon > 0)(\exists M)(\forall n \geq 0)\left(n > M \rightarrow \abs{x_n - r} < \varepsilon\right)

Qvodqve iteratvm est pvnctvm in qvo tangens in (xn,f(xn))(x_n, f(x_n)) axem secat: positis y=0y = 0 et x=xn+1x = x_{n+1} in aeqvatione y=f(xn)+f′(xn)(x−xn)y = f(x_n) + f'(x_n)(x - x_n) et incognita explicata, formvla definitionis obtinetvr. Methodvs non postvlat vt fvnctio in intervallo dato signvm mvtet, sicvt bisectio, sed vt derivabilis sit et derivata eivs in pvnctis per qvae transit non evanescat; contra, nihil antea praestat iterata ad radicem accedere. Infra condiciones dantvr qvae id praestant.

ExemplvmRadix qvadrata nvmeri 2

Methodvm Newtoni et Raphsoni ad f(x)=x2−2f(x) = x^2 - 2 a x0=2x_0 = 2 adhibere. Calcvlvs infra tres primas tangentes earvmqve cvm axe concvrsvs ostendit.

Demonstratio

  1. xn+1=xn−xn2−22xn=12(xn+2xn),x1=32x_{n+1} = x_n - \frac{x_n^2 - 2}{2x_n} = \frac{1}{2}\left(x_n + \frac{2}{x_n}\right), \qquad \resaltar{x_1 = \frac{3}{2}}

    Derivata est f′(x)=2xf'(x) = 2x, qvae non evanescit si x>0x > 0. Iteratio hanc formam indvit: qvaeqve approximatio est medivm arithmeticvm antecedentis et nvmeri 22 per eam divisi. A x0=2x_0 = 2, tangens y=2+4(x−2)y = 2 + 4(x - 2) axem in 32\frac{3}{2} secat.

  2. x2=12(32+43)=1712≈1,416667x_2 = \frac{1}{2}\left(\frac{3}{2} + \frac{4}{3}\right) = \resaltar{\frac{17}{12}} \approx 1{,}416667

    Tangens in (32,14)\left(\frac{3}{2}, \frac{1}{4}\right) axem mvlto propivs radici secat.

  3. x3=12(1712+2417)=577408≈1,4142157,2≈1,4142136x_3 = \frac{1}{2}\left(\frac{17}{12} + \frac{24}{17}\right) = \resaltar{\frac{577}{408}} \approx 1{,}4142157, \qquad \sqrt{2} \approx 1{,}4142136

    Tertivm iteratvm iam qvinqve digitos decimales rectos habet. Errores, xn−2x_n - \sqrt{2}, svnt circiter 0,590{,}59, 0,0860{,}086, 0,00250{,}0025 et 0,00000210{,}0000021: qvisqve ordinis qvadrati antecedentis est.

Error hvivs exempli exacte ad qvadratvm elevatvr. Ex formvla iterationis obtinetvr, pro omni xn>0x_n > 0, haec identitas:

xn+1−2=xn2−22 xn+22xn=(xn−2)22xnx_{n+1} - \sqrt{2} = \frac{x_n^2 - 2\sqrt{2}\,x_n + 2}{2x_n} = \frac{\left(x_n - \sqrt{2}\right)^2}{2x_n}

Itaqve omnia iterata a primo maiora vel aeqvalia svnt qvam 2\sqrt{2}, et si xn≥1x_n \geq 1, error novvs svmmvm dimidivm qvadrati erroris praesentis est: qvartvm iteratvm, x4=665 857470 832x_4 = \frac{665\,857}{470\,832}, vndecim digitos decimales rectos habet. Nvmero 22 per qvemlibet nvmervm positivvm svbstitvto, eadem ratio radices qvadratas compvtat; iam in Metricis Heronis Alexandrini apparet, saecvlo primo, et ideo methodvs Heronis qvoqve appellatvr.

Isaac Newtonvs methodvm svam pro aeqvationibvs polynomialibvs anno 1669 descripsit, in scripto qvod manv exaratvm circvmferebatvr et anno 1711 editvm est; Iosephvs Raphson anno 1690 expositionem simpliciorem edidit, et Thomas Simpson eam anno 1740 vt methodvm iterativam pro aeqvationibvs generalibvs proposvit.