metodo de biseccion

𝑠𝑒𝑎 𝑓 𝑥 = 𝑓𝑢𝑛𝑐𝑖𝑜𝑛 𝑝𝑎𝑟𝑡𝑖𝑒𝑛𝑑𝑜 𝑑𝑒 𝑎, 𝑏 𝒇 𝒙𝒊 ∗ 𝒇 𝒙𝒓 < 0 → 𝒙𝒖 = 𝒙𝒓

ℎ𝑎𝑐𝑒𝑚𝑜𝑠: − <𝟎 𝒙𝒊 = 𝒙𝒊

𝑥𝑖 = 𝑎 → 𝑓 𝑥𝑖 = (±𝑣𝑎𝑙𝑜𝑟1) 𝑥𝑟 𝑛𝑢𝑒 − 𝑥𝑟 (𝑎𝑛𝑡)

𝒇 𝒙𝒊 ∗ 𝒇 𝒙𝒓 > 0 → 𝒙𝒊 = 𝒙𝒓 𝜀𝑎 = ∗ 100
𝑥𝑢 = 𝑏 → 𝑓 𝑥𝑢 = ±𝑣𝑎𝑙𝑜𝑟1 + > 𝟎 𝒙𝒖 = 𝒙𝒖 𝑥𝑟 𝑛𝑢𝑒
ℎ𝑎𝑙𝑙𝑎𝑚𝑜𝑠 𝑠𝑒𝑚𝑖𝑠𝑢𝑚𝑎:
𝒇 𝒙𝒊 ∗ 𝒇 𝒙𝒓 = 0 → 𝐅𝐈𝐍
𝑎+𝑏 0 =0
𝑥𝑟 = → 𝑓 𝑥𝑟 = (𝑠𝑖𝑔𝑛𝑜)
2

metodo de la falsa posicion

𝒇 𝒙𝒊 ∗ 𝒇 𝒙𝒓 < 0 → 𝒙𝒖 = 𝒙𝒓
ℎ𝑎𝑙𝑙𝑎𝑟 𝑙𝑎 𝑎𝑝𝑟𝑜𝑥. 𝑎 𝑙𝑎 𝑠𝑜𝑙𝑢𝑐𝑖𝑜𝑛 𝑑𝑒 − <𝟎 𝒙𝒊 = 𝒙𝒊
𝑓 𝑥 = 𝑓𝑢𝑛𝑐𝑖𝑜𝑛 𝑝𝑎𝑟𝑡𝑖𝑒𝑛𝑑𝑜 𝑒𝑛 𝑎, 𝑏
𝑥𝑟 𝑛𝑢𝑒 − 𝑥𝑟 (𝑎𝑛𝑡)
ℎ𝑎𝑐𝑒𝑚𝑜𝑠: 𝒇 𝒙𝒊 ∗ 𝒇 𝒙𝒓 > 0 → 𝒙𝒊 = 𝒙𝒓
𝜀𝑎 = ∗ 100
+ > 𝟎 𝒙𝒖 = 𝒙𝒖 𝑥𝑟 𝑛𝑢𝑒
𝒙𝒊 = 𝑎 → 𝒇 𝒙𝒊 = (±𝑣𝑎𝑙𝑜𝑟1)
𝒙𝒖 = 𝑏 → 𝒇 𝒙𝒖 = ±𝑣𝑎𝑙𝑜𝑟1 𝒇 𝒙𝒊 ∗ 𝒇 𝒙𝒓 = 0 → 𝐅𝐈𝐍
𝑎𝑝𝑙𝑖𝑐𝑎𝑚𝑜𝑠 𝑒𝑙 𝑚𝑒𝑡𝑜𝑑𝑜 0 =0
𝒇(𝒙𝒖 )(𝒙𝒊 − 𝒙𝒖 )
𝑥𝑟 = 𝒙𝒖 − → 𝑓 𝑥𝑟 = (𝑠𝑖𝑔𝑛𝑜)
𝒇 𝒙𝒊 − 𝒇(𝒙𝒖 )

metodo del punto fijo

ℎ𝑎𝑙𝑙𝑎𝑟 𝑙𝑎 𝑎𝑝𝑟𝑜𝑥. 𝑎 𝑙𝑎 𝑠𝑜𝑙𝑢𝑐𝑖𝑜𝑛 𝑑𝑒 𝑓 𝑥 = 𝑓𝑢𝑛𝑐𝑖𝑜𝑛 𝑝𝑎𝑟𝑡𝑖𝑒𝑛𝑑𝑜 𝑒𝑛 𝑎, 𝑏

𝟏. 𝑑𝑒𝑠𝑝𝑒𝑗𝑎𝑚𝑜𝑠 𝑥, 𝑑𝑒 𝑙𝑎 𝑓𝑢𝑛𝑐𝑖𝑜𝑛 𝑠𝑒 𝑜𝑏𝑡𝑖𝑒𝑛𝑒 𝑔 𝑥
𝟐. 𝑑𝑒𝑟𝑖𝑣𝑎𝑚𝑜𝑠 → 𝑔´ 𝑥 𝑡𝑖𝑒𝑛𝑒 𝑞𝑢𝑒 𝑠𝑒𝑟 𝑐𝑜𝑛𝑡𝑖𝑛𝑢𝑎 𝑒𝑛 𝑎, 𝑏 𝑥𝑖+1 𝑛𝑢𝑒 − 𝑥𝑖 (𝑎𝑛𝑡)
𝜀𝑎 = ∗ 100
𝟑. 𝑑𝑒𝑏𝑒 𝑠𝑎𝑡𝑖𝑠𝑓𝑎𝑐𝑒𝑟 𝑔´ 𝑥 < 1, 𝑥 ∈ (𝑐; 𝑑) 𝑥𝑖+1 𝑛𝑢𝑒
𝑙𝑢𝑒𝑔𝑜:
𝑠𝑖 𝑝𝑎𝑟𝑡𝑖𝑚𝑜𝑠 𝑑𝑒 𝑥𝑖 = ±𝑎 𝑖 = 0 𝑜 𝑥𝑖 = 0
𝒙𝒊+𝟏 = 𝒈 𝒙𝒊 = ±𝑣𝑎𝑙𝑜𝑟1 → 𝒙𝒊+𝟏 = 𝒈 𝒙𝒊 = (±𝑣𝑎𝑙𝑜𝑟1)

metodo de newton−raphson

ℎ𝑎𝑙𝑙𝑎𝑟 𝑟𝑎𝑖𝑧 𝑑𝑒 𝑓 𝑥 = 𝑓𝑢𝑛𝑐𝑖𝑜𝑛 𝑣𝑎𝑙𝑜𝑟 𝑖𝑛𝑖𝑐𝑖𝑎𝑙 𝑥𝑖 = 𝑥0 = (±𝑣𝑎𝑙𝑜𝑟)

𝟏. 𝑑𝑒𝑟𝑖𝑣𝑎𝑚𝑜𝑠 𝑦 𝑡𝑒𝑛𝑒𝑚𝑜𝑠 𝑓´(𝑥)
𝑒𝑚𝑝𝑒𝑧𝑎𝑚𝑜𝑠
𝑓 𝑥𝑖 𝑓 0
𝑥𝑖+1 = 𝑥𝑖 − 𝑜 𝑥1 = 𝑥0 − = (±𝑣𝑎𝑙𝑜𝑟) 𝑠𝑢𝑐𝑒𝑠𝑖𝑣𝑎𝑚𝑒𝑛𝑡𝑒
𝑓´(𝑥𝑖 ) 𝑓´ 0

metodo de la secante

ℎ𝑎𝑙𝑙𝑎𝑟 𝑟𝑎𝑖𝑧 𝑑𝑒 𝑓 𝑥 = 𝑓𝑢𝑛𝑐𝑖𝑜𝑛 𝑣𝑎𝑙𝑜𝑟 𝑖𝑛𝑖𝑐𝑖𝑎𝑙 𝑥𝑖−1 = 𝑎 𝑦 𝑥𝑖 = 𝑏

𝒙𝒊−𝟏 = 𝑎 → 𝒇 𝒙𝒊−𝟏 = (±𝑣𝑎𝑙𝑜𝑟1)
𝒙𝒊 = 𝑏 → 𝒇 𝒙𝒊 = ±𝑣𝑎𝑙𝑜𝑟1
𝑎𝑝𝑙𝑖𝑐𝑎𝑚𝑜𝑠 𝑒𝑙 𝑚𝑒𝑡𝑜𝑑𝑜
𝒇(𝒙𝒊 )(𝒙𝒊−𝟏 − 𝒙𝒊 )
𝒙𝒊+𝟏 = 𝒙𝒊 −
𝒇 𝒙𝒊−𝟏 − 𝒇 𝒙𝒊
𝒙𝒊+𝟐 = 𝒙𝒊+𝟏 − ⋯
 𝑓𝑎𝑐𝑡𝑜𝑟𝑖𝑧𝑎𝑐𝑖𝑜𝑛 𝐿. 𝑈 → 𝑠𝑒 𝑠𝑎𝑏𝑒 𝑞𝑢𝑒 Ax=b → LUx=b → Lz=b
𝑟𝑒𝑑𝑢𝑐𝑖𝑚𝑜𝑠 A 𝑎 𝑠𝑢 𝑓𝑜𝑟𝑚𝑎 𝑒𝑠𝑐𝑎𝑙𝑜𝑛𝑎𝑑𝑎. 𝑑𝑒 𝑑𝑜𝑛𝑑𝑒 𝑠𝑎𝑐𝑎𝑟𝑒𝑚𝑜𝑠 𝑳. 𝑼
𝒂𝟏𝟏 𝒂𝟏𝟐 𝒂𝟏𝟑 𝟏 𝟎 𝟎 𝑼𝟏𝟏 𝑼𝟏𝟐 𝑼𝟏𝟑
si tenemos: A= 𝒂𝟐𝟏 𝒂𝟐𝟐 𝒂𝟐𝟑 = 𝒍𝟐𝟏 𝟏 𝟎 ∗ 𝟎 𝑼𝟐𝟐 𝑼𝟐𝟑
𝒂𝟑𝟏 𝒂𝟑𝟏 𝒂𝟑𝟑 𝒍𝟑𝟏 𝒍𝟑𝟐 𝟏 𝟎 𝟎 𝑼𝟑𝟑

𝐿 𝑈
𝑓𝑎𝑐𝑡𝑜𝑟𝑖𝑧𝑎𝑐𝑖𝑜𝑛 𝑑𝑒 doolitle → 𝑠𝑒 𝑠𝑎𝑏𝑒 𝑞𝑢𝑒 Ax=b → LUx=b → Lz=b
𝟏 𝟎 𝟎 𝑼𝟏𝟏 𝑼𝟏𝟐 𝑼𝟏𝟑 𝑼𝟏𝟏 𝑼𝟏𝟐 𝑼𝟏𝟑 𝒂𝟏𝟏 𝒂𝟏𝟐 𝒂𝟏𝟑
𝒍𝟐𝟏 𝟏 𝟎 ∗ 𝟎 𝑼𝟐𝟐 𝑼𝟐𝟑 = 𝑼𝟏𝟏 𝒍𝟐𝟏 𝑼𝟏𝟐 𝒍𝟐𝟏 + 𝑼𝟐𝟐 𝑼𝟏𝟑𝒍𝟐𝟏 + 𝑼𝟐𝟑 = 𝒂𝟐𝟏 𝒂𝟐𝟐 𝒂𝟐𝟑
𝒍𝟑𝟏 𝒍𝟑𝟐 𝟏 𝟎 𝟎 𝑼𝟑𝟑 𝑼𝟏𝟏 𝒍𝟑𝟏 𝑼𝟏𝟐𝒍𝟑𝟏 + 𝑼𝟐𝟐 𝒍𝟑𝟐 𝑼𝟏𝟑𝒍𝟑𝟏 + 𝑼𝟐𝟑 𝒍𝟑𝟐 + 𝑼𝟑𝟑 𝒂𝟑𝟏 𝒂𝟑𝟏 𝒂𝟑𝟑

𝐿 𝑈
𝑓𝑎𝑐𝑡𝑜𝑟𝑖𝑧𝑎𝑐𝑖𝑜𝑛 𝑑𝑒 crout → 𝑠𝑒 𝑠𝑎𝑏𝑒 𝑞𝑢𝑒 Ax=b → LUx=b → Lz=b
𝒍𝟏𝟏 𝟎 𝟎 𝟏 𝑼𝟏𝟐 𝑼𝟏𝟑 𝒍𝟏𝟏 𝑼𝟏𝟐 𝒍𝟏𝟏 𝑼𝟏𝟑 𝒍𝟏𝟏 𝒂𝟏𝟏 𝒂𝟏𝟐 𝒂𝟏𝟑
𝒍𝟐𝟏 𝒍𝟐𝟐 𝟎 ∗ 𝟎 𝟏 𝑼𝟐𝟑 = 𝒍𝟐𝟏 𝑼𝟏𝟐𝒍𝟐𝟏 + 𝒍𝟐𝟐 𝑼𝟏𝟑 𝒍𝟐𝟏 + 𝑼𝟐𝟑𝒍𝟐𝟐 = 𝒂𝟐𝟏 𝒂𝟐𝟐 𝒂𝟐𝟑
𝒍𝟑𝟏 𝒍𝟑𝟐 𝒍𝟑𝟑 𝟎 𝟎 𝟏 𝒍𝟑𝟏 𝑼𝟏𝟐𝒍𝟑𝟏 + 𝒍𝟑𝟐 𝑼𝟏𝟑 𝒍𝟑𝟏 + 𝑼𝟐𝟑 𝒍𝟑𝟐 + 𝒍𝟑𝟑 𝒂𝟑𝟏 𝒂𝟑𝟏 𝒂𝟑𝟑

𝐿 𝑈
𝑓𝑎𝑐𝑡𝑜𝑟𝑖𝑧𝑎𝑐𝑖𝑜𝑛 𝑑𝑒 cholesky → 𝑠𝑒 𝑠𝑎𝑏𝑒 𝑞𝑢𝑒 Ax=b → LUx=b → Lz=b
𝟐
𝒍𝟏𝟏 𝟎 𝟎 𝒍𝟏𝟏 𝒍𝟐𝟏 𝒍𝟑𝟏 𝒍𝟏𝟏 𝒍𝟐𝟏 𝒍𝟏𝟏 𝒍𝟐𝟑𝟏𝒍𝟏𝟏 𝒂𝟏𝟏 𝒂𝟏𝟐 𝒂𝟏𝟑
𝒍𝟐𝟏 𝒍𝟐𝟐 𝟎 ∗ 𝟎 𝒍𝟐𝟐 𝒍𝟑𝟐 = 𝒍𝟏𝟏 𝒍𝟐𝟏 𝒍𝟐𝟐𝟏 + 𝒍𝟐𝟐𝟐 𝒍𝟐𝟑𝟏𝒍𝟐𝟏 + 𝒍𝟑𝟐 𝒍𝟐𝟐 = 𝒂𝟐𝟏 𝒂𝟐𝟐 𝒂𝟐𝟑
𝒍𝟑𝟏 𝒍𝟑𝟐 𝒍𝟑𝟑 𝟎 𝟎 𝒍𝟑𝟑 𝒍𝟏𝟏 𝒍𝟑𝟏 𝒍𝟐𝟏𝒍𝟑𝟏 + 𝒍𝟐𝟐 𝒍𝟑𝟐 𝒍𝟐𝟑𝟏 + 𝒍𝟐𝟑𝟐 + 𝒍𝟐𝟑𝟑 𝒂𝟑𝟏 𝒂𝟑𝟏 𝒂𝟑𝟑

𝐿 𝑈
𝑓𝑎𝑐𝑡𝑜𝑚𝑒𝑡𝑜𝑑𝑜𝑠 𝑖𝑡𝑒𝑟𝑎𝑡𝑖𝑣𝑜𝑠:
𝒎𝒆𝒕𝒐𝒅𝒐 𝒅𝒆 𝑮𝒂𝒖𝒔𝒔 − 𝑺𝒆𝒊𝒅𝒆𝒍 𝒔𝒊𝒏 𝒓𝒆𝒍𝒂𝒋𝒂𝒄𝒊𝒐𝒏 :

𝑠𝑖 𝑡𝑒𝑛𝑒𝑚𝑜𝑠: 𝑑𝑒𝑠𝑝𝑒𝑗𝑎𝑚𝑜𝑠 𝑑𝑒𝑏𝑒 𝑐𝑜𝑛𝑣𝑒𝑟𝑔𝑒𝑟 : 𝑖𝑛𝑖𝑐𝑖𝑎𝑚𝑜𝑠 𝑐𝑜𝑛 𝑥1 = 𝑥2 = 𝑥3 = 0 𝑝𝑎𝑟𝑎 𝑙𝑜 𝑞𝑢𝑒 𝑓𝑎𝑙𝑡𝑎

𝒃𝟏 − 𝒂𝟏𝟐 𝒙𝟐 − 𝒂𝟏𝟑 𝒙𝟑 𝒃𝟏 − 𝒂𝟏𝟐 (0) − 𝒂𝟏𝟑(𝟎)
1ª 𝑖𝑡𝑒𝑟𝑎𝑐𝑖𝑜𝑛

𝒂𝟏𝟏𝒙𝟏 + 𝒂𝟏𝟐 𝒙𝟐 + 𝒂𝟏𝟑𝒙𝟑 = 𝒃𝟏 ⟹ 𝒙𝟏 = 𝒙𝟏 = = 𝒗𝒂𝒍𝒐𝒓𝟏

𝒂𝟏𝟏 𝒂𝟏𝟏
𝒃𝟐 − 𝒂𝟐𝟏 𝒙𝟏 − 𝒂𝟐𝟑 𝒙𝟑 𝒃𝟐 − 𝒂𝟐𝟏 𝒗𝒂𝒍𝒐𝒓𝟏 − 𝒂𝟐𝟑 𝟎
𝒂𝟐𝟏𝒙𝟏 + 𝒂𝟐𝟐 𝒙𝟐 + 𝒂𝟐𝟑𝒙𝟑 = 𝒃𝟐 ⟹ 𝒙𝟐 = 𝒙𝟐 = = 𝒗𝒂𝒍𝒐𝒓𝟐
𝒂𝟐𝟐 𝒂𝟐𝟐
𝒃𝟑 − 𝒂𝟑𝟏𝒙𝟏 − 𝒂𝟑𝟐 𝒙𝟐 𝒃𝟑 − 𝒂𝟑𝟏 𝒗𝒂𝒍𝒐𝒓𝟏 − 𝒂𝟑𝟐 𝒗𝒂𝒍𝒐𝒓𝟐
𝒂𝟑𝟏𝑥1 + 𝒂𝟑𝟐𝒙𝟐 + 𝒂𝟑𝟑𝒙𝟑 = 𝒃𝟑 ⟹ 𝒙𝟑 = 𝒙𝟑 = = 𝒗𝒂𝒍𝒐𝒓𝟑
𝒂𝟑𝟑 𝒂𝟑𝟑
𝑐𝑜𝑛 𝑙𝑜𝑠 𝑑𝑎𝑡𝑜𝑠 𝑞𝑢𝑒 𝑠𝑒 𝑡𝑖𝑒𝑛𝑒
𝑟𝑒𝑒𝑚𝑝𝑙𝑎𝑧𝑎𝑟 𝑠𝑢𝑐𝑒𝑐𝑖𝑣𝑎𝑚𝑒𝑛𝑡𝑒

𝒎𝒆𝒕𝒐𝒅𝒐 𝒅𝒆 𝑮𝒂𝒖𝒔𝒔 − 𝑺𝒆𝒊𝒅𝒆𝒍 𝒄𝒐𝒏 𝒓𝒆𝒍𝒂𝒋𝒂𝒄𝒊𝒐𝒏 : "𝝀 = ℕ"

𝑑𝑒 𝑙𝑜 𝑦𝑎 𝑑𝑒𝑠𝑝𝑒𝑗𝑎𝑑𝑜 𝑖𝑛𝑖𝑐𝑖𝑎𝑚𝑜𝑠 𝑐𝑜𝑛 𝑥1 = 𝑥2 = 𝑥3 = 0 𝑒𝑛 𝑒𝑠𝑡𝑒 𝑐𝑎𝑠𝑜 𝑎ñ𝑎𝑑𝑖𝑚𝑜𝑠:

𝒃𝟏 − 𝒂𝟏𝟐(0) − 𝒂𝟏𝟑 (𝟎)
1ª 𝑖𝑡𝑒𝑟𝑎𝑐𝑖𝑜𝑛

𝒙𝟏 = = 𝒗𝒂𝒍𝒐𝒓𝟏 ∗ 𝝀 𝒗𝒂𝒍𝒐𝒓𝟏 + 𝟏 − 𝝀 𝒗𝒂𝒍𝒐𝒓 𝒊𝒏𝒊𝒄𝒊𝒂𝒍 = 𝒗𝒂𝒍𝒐𝒓𝟏 ∗

𝒂𝟏𝟏
𝒃𝟐 − 𝒂𝟐𝟏 𝒗𝒂𝒍𝒐𝒓𝟏 ∗ − 𝒂𝟐𝟑 𝟎
𝒙𝟐 = = 𝒗𝒂𝒍𝒐𝒓𝟐 ∗ 𝝀 𝒗𝒂𝒍𝒐𝒓𝟐 + 𝟏 − 𝝀 𝒗𝒂𝒍𝒐𝒓 𝒊𝒏𝒊𝒄𝒊𝒂𝒍 = 𝒗𝒂𝒍𝒐𝒓𝟐 ∗
𝒂𝟐𝟐
𝒃𝟑 − 𝒂𝟑𝟏 𝒗𝒂𝒍𝒐𝒓𝟏 ∗ − 𝒂𝟑𝟐 𝒗𝒂𝒍𝒐𝒓𝟐 ∗
𝒙𝟑 = = 𝒗𝒂𝒍𝒐𝒓𝟑 ∗ 𝝀 𝒗𝒂𝒍𝒐𝒓𝟑 + 𝟏 − 𝝀 𝒗𝒂𝒍𝒐𝒓 𝒊𝒏𝒊𝒄𝒊𝒂𝒍 = 𝒗𝒂𝒍𝒐𝒓𝟑 ∗
𝒂𝟑𝟑
𝑐𝑜𝑛 𝑙𝑜𝑠 𝑑𝑎𝑡𝑜𝑠 𝑞𝑢𝑒 𝑠𝑒 𝑡𝑖𝑒𝑛𝑒 𝑒𝑛 𝑙𝑜 𝑑𝑒𝑠𝑝𝑒𝑗𝑎𝑑𝑜 𝑟𝑒𝑒𝑚𝑝𝑙𝑎𝑧𝑎𝑟 𝑠𝑢𝑐𝑒𝑐𝑖𝑣𝑎𝑚𝑒𝑛𝑡𝑒

𝒎𝒆𝒕𝒐𝒅𝒐 𝒅𝒆 𝑱𝒂𝒄𝒐𝒃𝒊:

𝑠𝑖 𝑡𝑒𝑛𝑒𝑚𝑜𝑠: 𝑑𝑒𝑠𝑝𝑒𝑗𝑎𝑚𝑜𝑠 𝑑𝑒𝑏𝑒 𝑐𝑜𝑛𝑣𝑒𝑟𝑔𝑒𝑟 : 𝑖𝑛𝑖𝑐𝑖𝑎𝑚𝑜𝑠 𝑐𝑜𝑛 𝑥1 = 𝑥2 = 𝑥3 = 0 𝑝𝑎𝑟𝑎 𝑡𝑜𝑑𝑜 𝑒𝑙 𝑝𝑟𝑖𝑛𝑐𝑖𝑝𝑖𝑜

𝒃𝟏 − 𝒂𝟏𝟐 𝒙𝟐 − 𝒂𝟏𝟑 𝒙𝟑 𝒃𝟏 − 𝒂𝟏𝟐 (0) − 𝒂𝟏𝟑(𝟎)
𝒂𝟏𝟏𝒙𝟏 + 𝒂𝟏𝟐 𝒙𝟐 + 𝒂𝟏𝟑𝒙𝟑 = 𝒃𝟏 ⟹ 𝒙𝟏 = 𝒙𝟏 = = 𝒗𝒂𝒍𝒐𝒓𝟏
𝒂𝟏𝟏 𝒂𝟏𝟏
𝒃𝟐 − 𝒂𝟐𝟏 𝒙𝟏 − 𝒂𝟐𝟑 𝒙𝟑 𝒃𝟐 − 𝒂𝟐𝟏 0 − 𝒂𝟐𝟑 𝟎
𝒂𝟐𝟏𝒙𝟏 + 𝒂𝟐𝟐 𝒙𝟐 + 𝒂𝟐𝟑𝒙𝟑 = 𝒃𝟐 ⟹ 𝒙𝟐 = 𝒙𝟐 = = 𝒗𝒂𝒍𝒐𝒓𝟐
𝒂𝟐𝟐 𝒂𝟐𝟐
𝒃𝟑 − 𝒂𝟑𝟏𝒙𝟏 − 𝒂𝟑𝟐 𝒙𝟐 𝒃𝟑 −𝒂𝟑𝟏 𝟎 − 𝒂𝟑𝟐 𝟎
𝒂𝟑𝟏𝑥1 + 𝒂𝟑𝟐𝒙𝟐 + 𝒂𝟑𝟑𝒙𝟑 = 𝒃𝟑 ⟹ 𝒙𝟑 = 𝒙𝟑 = = 𝒗𝒂𝒍𝒐𝒓𝟑
𝒂𝟑𝟑 𝒂𝟑𝟑
𝑐𝑜𝑛 𝑙𝑜𝑠 𝑑𝑎𝑡𝑜𝑠 𝑞𝑢𝑒 𝑠𝑒 𝑡𝑖𝑒𝑛𝑒
𝑟𝑒𝑒𝑚𝑝𝑙𝑎𝑧𝑎𝑟 𝑠𝑢𝑐𝑒𝑐𝑖𝑣𝑎𝑚𝑒𝑛𝑡𝑒
iteracion de punto fijo: 𝑐𝑟𝑖𝑡𝑒𝑟𝑖𝑜 𝑑𝑒 𝑐𝑜𝑛𝑣𝑒𝑟𝑔𝑒𝑛𝑐𝑖𝑎
𝑟𝑒𝑠𝑜𝑙𝑣𝑒𝑟 𝑑𝑒𝑠𝑝𝑒𝑗𝑎𝑚𝑜𝑠
𝑔1 𝜕𝑔1 𝜕𝑔1 𝜕𝑔1
𝑥2 ∗ 𝑥3 − 𝑥1 = 𝑏 𝑥1 = 𝑥2 ∗ 𝑥3 − 𝑏 =𝑣𝑜𝑓 =𝑣𝑜𝑓 =𝑣𝑜𝑓
𝑔2 𝜕𝒙𝟏 𝜕𝒙𝟐 𝜕𝒙𝟑
𝑥1 ∗ 𝑥3 − 𝑥2 = 0 𝑥2 = 𝑥1 ∗ 𝑥3 𝜕𝑔2 𝜕𝑔2 𝜕𝑔2
𝑥2 ∗ 𝑥1 − 𝑥3 = 0 𝑥3 = 𝑥2 ∗ 𝑥1 𝑔3 =𝑣𝑜𝑓 =𝑣𝑜𝑓 =𝑣𝑜𝑓
𝜕𝒙𝟏 𝜕𝒙𝟐 𝜕𝒙𝟑
𝜕𝑔3 𝜕𝑔3 𝜕𝑔3
=𝑣𝑜𝑓 =𝑣𝑜𝑓 =𝑣𝑜𝑓
𝜕𝒙𝟏 𝜕𝒙𝟐 𝜕𝒙𝟑

𝑝𝑟𝑖𝑚𝑒𝑟𝑎 𝑖𝑡𝑒𝑟𝑎𝑐𝑖𝑜𝑛:
𝑎 ℎ𝑎𝑙𝑙𝑎𝑚𝑜𝑠:
𝑥1 (1)
0
𝑣𝑒𝑟𝑖𝑓𝑖𝑐𝑎𝑟 𝑒𝑛 𝑥 = 𝑐 𝑥2 𝑥1 = 𝑟𝑒𝑒𝑚𝑝𝑙𝑎𝑧𝑎𝑚𝑜𝑠 𝑣𝑎𝑙𝑜𝑟𝑒𝑠 𝑒𝑛 𝑙𝑜 𝑑𝑒𝑠𝑝𝑒𝑗𝑎𝑑𝑜 = 𝑎1
(1)
𝑑 𝑥3 𝑥2 = 𝑟𝑒𝑒𝑚𝑝𝑙𝑎𝑧𝑎𝑚𝑜𝑠 𝑣𝑎𝑙𝑜𝑟𝑒𝑠 𝑒𝑛 𝑙𝑜 𝑑𝑒𝑠𝑝𝑒𝑗𝑎𝑑𝑜 = 𝑏1
(1)
𝑥3 = 𝑟𝑒𝑒𝑚𝑝𝑙𝑎𝑧𝑎𝑚𝑜𝑠 𝑣𝑎𝑙𝑜𝑟𝑒𝑠 𝑒𝑛 𝑙𝑜 𝑑𝑒𝑠𝑝𝑒𝑗𝑎𝑑𝑜 = 𝑐1

𝜕𝑔1 𝜕𝑔2 𝜕𝑔3 𝑐𝑜𝑛𝑡𝑖𝑛𝑢𝑎𝑟 𝑠𝑢𝑐𝑒𝑠𝑖𝑣𝑎𝑚𝑒𝑛𝑡𝑒 (𝑐𝑟𝑖𝑡𝑒𝑟𝑖𝑜 𝑑𝑒 𝑐𝑜𝑛𝑣𝑒𝑟𝑔𝑒𝑛𝑐𝑖𝑎 𝑦 𝑣𝑎𝑟𝑖𝑎𝑏𝑙𝑒𝑠)

+ + = 𝒗𝒂𝒍𝒐𝒓 < 𝟏
𝜕𝒙𝟏 𝜕𝒙𝟏 𝜕𝒙𝟏

𝜕𝑔1 𝜕𝑔2 𝜕𝑔3

+ + = 𝒗𝒂𝒍𝒐𝒓 < 𝟏
𝜕𝒙𝟐 𝜕𝒙𝟐 𝜕𝒙𝟐
2 2 2
1 0 1 0 1 0
𝑒𝑟𝑟𝑜𝑟 = 𝑥1 − 𝑥1 + 𝑥2 − 𝑥2 + 𝑥3 − 𝑥3
𝜕𝑔1 𝜕𝑔2 𝜕𝑔3
+ + = 𝒗𝒂𝒍𝒐𝒓 < 𝟏
𝜕𝒙𝟑 𝜕𝒙𝟑 𝜕𝒙𝟑

iteracion de punto newton raphson:

𝑟𝑒𝑠𝑜𝑙𝑣𝑒𝑟 𝑐𝑜𝑛 𝑥 0 = 𝑎 𝑏 𝑐 𝑡 𝑝𝑎𝑠𝑎𝑚𝑜𝑠 𝑡𝑜𝑑𝑜 𝑎 𝑢𝑛 𝑠𝑜𝑙𝑜 𝑙𝑎𝑑𝑜 𝑑𝑒𝑙 𝑠𝑖𝑔𝑛𝑜 " = “

𝑥2 ∗ 𝑥3 − 𝑥1 = 𝑏 𝑓1 = 𝑏 − 𝑥2 ∗ 𝑥3 + 𝑥1
𝑥1 ∗ 𝑥3 − 𝑥2 = 0 𝑓2 = −𝑥1 ∗ 𝑥3 + 𝑥2
𝑥2 ∗ 𝑥1 − 𝑥3 = 0 𝑓3 = −𝑥2 ∗ 𝑥1 + 𝑥3

𝑑𝑒𝑟𝑖𝑣𝑎𝑚𝑜𝑠 𝑙𝑎𝑠 𝑓𝑢𝑛𝑐𝑖𝑜𝑛𝑒𝑠

𝑝𝑟𝑖𝑚𝑒𝑟𝑎 𝑖𝑡𝑒𝑟𝑎𝑐𝑖𝑜𝑛:
𝑎 𝑥1 𝜕𝑓1 𝜕𝑓1 𝜕𝑓1 𝑝𝑙𝑎𝑛𝑡𝑒𝑎𝑚𝑜𝑠 𝑙𝑎
0 = 𝑣11 = 𝑣12 = 𝑣13 𝑚𝑎𝑡𝑟𝑖𝑧 𝑗𝑎𝑐𝑜𝑏𝑖𝑎𝑛𝑎
𝑐𝑜𝑛 𝑥 = 𝑐 𝑥2 𝜕𝒙𝟏 𝜕𝒙𝟐 𝜕𝒙𝟑
𝑑 𝑥3 𝜕𝑓2 𝜕𝑓2 𝜕𝑓2 𝑣11 𝑣12 𝑣13
= 𝑣21 = 𝑣22 = 𝑣23
𝜕𝒙𝟏 𝜕𝒙𝟐 𝜕𝒙𝟑 𝐽 = 21 𝑣22 𝑣23
𝑣
𝑟𝑒𝑒𝑚𝑝𝑙𝑧𝑎𝑚𝑜𝑠 𝑣𝑎𝑙𝑜𝑟𝑒𝑠 𝑑𝑒 "𝑥 0 " 𝜕𝑓3 𝜕𝑓3 𝜕𝑓3 𝑣31 𝑣32 𝑣33
= 𝑣31 = 𝑣32 = 𝑣33
𝑒𝑛 𝑙𝑎𝑠 𝑓𝑢𝑛𝑐𝑖𝑜𝑛𝑒𝑠 𝑦 𝑟𝑒𝑠𝑜𝑙𝑣𝑒𝑚𝑜𝑠 𝜕𝒙𝟏 𝜕𝒙𝟐 𝜕𝒙𝟑
𝒇𝟏 = 𝑣𝑎𝑙𝑜𝑟
𝒇𝟐 = 𝑣𝑎𝑙𝑜𝑟
𝒇𝟑 = 𝑣𝑎𝑙𝑜𝑟
𝑗11 𝑗12 𝑗13 𝑎𝑑𝑗 𝐽𝑡
𝐽 𝑥10 , 𝑥20 , 𝑥30 = 𝑗21 𝑗22 𝑗23 → ℎ𝑎𝑙𝑙𝑎𝑚𝑜𝑠 𝑙𝑎 𝑖𝑛𝑣𝑒𝑟𝑠𝑎 𝑠𝑖 𝐽−1 =
𝑗31 𝑗32 𝑗33 𝐽

𝑙𝑢𝑒𝑔𝑜 𝑡𝑒𝑛𝑒𝑚𝑜𝑠 𝑞𝑢𝑒:

𝑥11 𝑥10 𝒇𝟏
𝑥21 = 𝑥20 − 𝐽 𝑥10 , 𝑥20 , 𝑥30 −1
∗ 𝒇𝟐
𝑥31 𝑥30 𝒇𝟑