Documentos de Académico
Documentos de Profesional
Documentos de Cultura
GRUPO 03
DOCENTE:
GERMAN SOSA
VALLEDUPAR, CESAR
2021-2
EJERCICIOS
METODO PUNTO FIJO
2 −4
1. 𝑓(𝑥) = 𝑥 − 2𝑥 − 3, 𝑒𝑛 𝑥0 = 4; 𝑑𝑒𝑡𝑒𝑟𝑚𝑖𝑛𝑎𝑟 𝑐𝑢𝑎𝑡𝑟𝑜 𝑒𝑐𝑢𝑎𝑐𝑖𝑜𝑛𝑒𝑠 𝑑𝑒 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑖𝑎 𝑡𝑜𝑙 = 10
1 2 −5
2. 𝑓(𝑥) = 2
(𝑥 − 3); 𝑑𝑒𝑡𝑒𝑟𝑚𝑖𝑛𝑎𝑟 𝑐𝑢𝑎𝑡𝑟𝑜 𝑒𝑐𝑢𝑎𝑐𝑖𝑜𝑛𝑒𝑠 𝑑𝑒 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑖𝑎 𝑡𝑜𝑙 = 10
2 −𝑥 −4
3. 𝑓(𝑥) = 𝑥 − 𝑒 , 𝑒𝑛 𝑥0 = 0, 5; 𝑑𝑒𝑡𝑒𝑟𝑚𝑖𝑛𝑎𝑟 𝑐𝑢𝑎𝑡𝑟𝑜 𝑒𝑐𝑢𝑎𝑐𝑖𝑜𝑛𝑒𝑠 𝑑𝑒 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑖𝑎 𝑡𝑜𝑙 = 10
2 −4
4. 𝑓(𝑥) =− 0, 9𝑥 + 1, 7𝑥 + 2, 5; 𝑑𝑒𝑡𝑒𝑟𝑚𝑖𝑛𝑎𝑟 𝑐𝑖𝑛𝑐𝑜 𝑒𝑐𝑢𝑎𝑐𝑖𝑜𝑛𝑒𝑠 𝑑𝑒 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑖𝑎 𝑡𝑜𝑙 = 10
DESARROLLO
2
1. 𝑓(𝑥) = 𝑥 − 2𝑥 − 3, 𝑒𝑛 𝑥0 = 4; 𝑑𝑒𝑡𝑒𝑟𝑚𝑖𝑛𝑎𝑟 𝑐𝑢𝑎𝑡𝑟𝑜 𝑒𝑐𝑢𝑎𝑐𝑖𝑜𝑛𝑒𝑠 𝑑𝑒 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑖𝑎
−4
𝑡𝑜𝑙 = 10
Ecuaciones de recurrencia:
2 2
𝑥 − 2𝑥 − 3 = 0 → 𝑥 = 2𝑥 + 3 →𝑥 = 2𝑥 + 3 → ( )
𝑥1 = 𝑔 𝑥1 = 2𝑥 + 3
2 2
2 2
𝑥 − 2𝑥 − 3 = 0 →2𝑥 = 𝑥 − 3 → 𝑥 =
𝑥 −3
2
→ ( )
𝑥2 = 𝑔 𝑥2 =
𝑥 −3
2
2 3 2 3 2 3 2
𝑥 − 2𝑥 − 3 = 0 →𝑥 = 2𝑥 + 3𝑥 →𝑥 = 2𝑥 + 3𝑥 → ( )
𝑥3 = 𝑔 𝑥3 = 2𝑥 + 3𝑥
2
𝑥 − 2𝑥 − 3 = 0 →3 𝑥 ( 2) = 3(2𝑥) + 3(3)→𝑥 = 6𝑥+9
3
→ ( )
𝑥4 = 𝑔 𝑥4 =
6𝑥+9
3
' 1 ' 1
𝑔 (𝑥) = 𝑔 (4) = = 0. 30151134
2𝑥+3 2(4)+3
' '
𝑔 (𝑥) = 𝑥 𝑔 (4) = 4
' 4𝑥+3 ' 4(4)+3
𝑔 (𝑥) = 3 2
𝑔 (4) = 3 2
= 0. 5081561998
2 2
3 (2𝑥 +3𝑥) 3 (2(4) +3(4))
' 1 ' 1
𝑔 (𝑥) = 𝑔 (4) = = 0. 30151134
2𝑥+3 2(4)+3
'
La condición que se debe cumplir es − 1≤𝑔 𝑥0 ≤1 ( )
La ecuación candidata es:
𝑔(𝑥) = 2𝑥 + 3
Iteraciones:
𝑥0 = 4; 𝑥1 = 2(4) + 3 = 3. 3166247903554
n1:
n2:
n3:
n4:
n5:
n6:
n7:
n8:
n9:
n10:
Tabla de iteraciones:
𝑛 𝑥𝑖 𝑒𝑎
0 4 -
1 3. 3166247903554 0. 6833752096446
2 3.103747667048789 0.212877123306611
3 3.034385495301739 0.06936217174705
4 3.0114400194265 0.022945475875239
5 3.003810919291193 0.007629100135307
6 3.001270037597814 0.002540881693379
7 3.000423315999865 8.467215979486298e-04
8 3.000141102014992 2.822139848732697e-04
9 3.000047033636303 9.406837868874973e-05
10 3.000015677837802 3.135579850166437e-05
Ecuaciones de recurrencia:
3
2 2 2
1
2
(𝑥 − 3) = 0→ 𝑥 −
1
2
3
2
= 0→𝑥 = 2
1
2
→𝑥 = 3 → ( )
𝑥1 = 𝑔 𝑥1 = 3
3
2 3 3 𝑥
1
2
(𝑥 − 3) = 0→ 𝑥 −
1
2
3
2
𝑥 = 0→𝑥 = 2
1
2
→𝑥 = 3𝑥
3
→ ( )
𝑥1 = 𝑔 𝑥1 = 3𝑥
3
1 2 3
2 𝑥 2
1
2
(𝑥 − 3) = 0→ 2
𝑥
− 2
𝑥
= 0→𝑥 =
𝑥
2
−
3
2𝑥
→𝑥 =
𝑥
2
−
3
2𝑥 ( )
→ 𝑥1 = 𝑔 𝑥1 =
𝑥
2
−
3
2𝑥
1 3
2 3 𝑥 3 3
1
2
(𝑥 − 3) = 0→ 𝑥 −
1
2
3
2
𝑥 = 0→𝑥 = 2
3
2
→𝑥 =
𝑥
3
→ ( )
𝑥1 = 𝑔 𝑥1 =
𝑥
3
' '
𝑔 (𝑥) = 0 𝑔 (2) = 0
' 1 ' 1 1
𝑔 (𝑥) = 𝑔 (2) = = 3 = 0. 3028534321387
3 2 3 2 36
(3𝑥) (3*2)
1 3 1 3
' 4
+ 2 ' 4
+ 2
4𝑥 4(2)
𝑔 (𝑥) = 𝑥 3
𝑔 (2) = (2) 3
= 0. 875
2
− 2𝑥 2
− 2(2)
' 2 ' 2
𝑔 (𝑥) = 𝑥 𝑔 (2) = 2 = 4
'
( )
La condición que se debe cumplir es − 1≤𝑔 𝑥0 ≤1
3
𝑥1 = 1. 8171205928321; 𝑥2 = 3(1. 8171205928321) = 1. 7599554244152
3
𝑥2 = 1. 7599554244152 ; 𝑥3 = 3(1. 7599554244152) = 1. 7413028373061
3
𝑥3 = 1. 7413028373061 ; 𝑥4 = 3(1. 7413028373061) = 1. 7351293424732
n1:
n2:
n3:
n4:
n5:
n6:
n7:
n8:
n9:
n10:
Tabla de iteraciones:
𝑛 𝑥𝑖 𝑒𝑎
0 2 -
1 1.817120592832140 0.182879407167860
2 1.759955424415164 0.057165168416975
3 1.741302837306132 0.018652587109032
4 1.735129342473216 0.006173494832916
5 1.733076378495923 0.002052963977293
6 1.732392597094018 6.837814019047261e-04
7 1.732164729917401 2.278671766176021e-04
8 1.732088780852524 7.594906487695674e-05
9 1.732063465237591 2.531561493235301e-05
10 1.732055026781504 8.438456087445090e-06
2 −𝑥
3. 𝑓(𝑥) = 𝑥 − 𝑒 , 𝑒𝑛 𝑥0 = 0, 5; 𝑑𝑒𝑡𝑒𝑟𝑚𝑖𝑛𝑎𝑟 𝑐𝑢𝑎𝑡𝑟𝑜 𝑒𝑐𝑢𝑎𝑐𝑖𝑜𝑛𝑒𝑠 𝑑𝑒 𝑟𝑒𝑐𝑢𝑟𝑟𝑒𝑛𝑐𝑖𝑎
−4
𝑡𝑜𝑙 = 10
Ecuaciones de recurrencia:
2 −𝑥 2 −𝑥 −𝑥 −𝑥
𝑥 −𝑒 = 0 → 𝑥 = 𝑒 →𝑥 = 𝑒 → ( )
𝑥1 = 𝑔 𝑥1 = 𝑒
2 −𝑥 −𝑥 2 −𝑥 2 2 2
𝑥 −𝑒 = 0 →𝑒 = 𝑥 → 𝑙𝑛(𝑒 ) = 𝑙𝑛(𝑥 )→𝑥 =− 𝑙𝑛(𝑥 ) → ( )
𝑥2 = 𝑔 𝑥2 =− 𝑙𝑛(𝑥 )
2 −𝑥 3 −𝑥 3 −𝑥 3 −𝑥
𝑥 −𝑒 = 0 →𝑥 = 𝑥𝑒 →𝑥 = 𝑥𝑒 → ( )
𝑥3 = 𝑔 𝑥3 = 𝑥𝑒
2 −𝑥 −𝑥 𝑥 𝑥
2 −𝑥 −2 −2
𝑥 −𝑒 = 0→
𝑥
𝑥
=
𝑒
𝑥
→𝑥 =
𝑒
𝑥
𝑥 →𝑥 = 𝑒 → ( )
𝑥4 = 𝑔 𝑥4 = 𝑒
𝑔 (𝑥) =− 2
𝑔 (0. 5) =− 2
=− 0. 3894003915357
' 2 ' 2
𝑔 (𝑥) =− 𝑥
𝑔 (0. 5) =− 0.5
=− 4
𝑔 (𝑥) =− 2
𝑔 (0. 5) =− 2
=− 0. 3894003915357
'
La condición que se debe cumplir es − 1≤𝑔 𝑥0 ≤1 ( )
La ecuación candidata es:
𝑥
−2
𝑔(𝑥) = 𝑒
Iteraciones:
0.5
− 2
𝑥0 = 0. 5; 𝑥1 = 𝑒 = 0. 7788007830714
0.7788007830714
− 2
𝑥1 = 0. 7788007830714 ; 𝑥2 = 𝑒 = 0. 6774629652665