Tarea (No Lineales)
Tarea (No Lineales)
Tarea (No Lineales)
ECUACIONES NO LINEALES
MÉTODO DEL PUNTO FIJO
𝑓(𝑥) = 𝑥 3 − 2 ∗ 𝑥 − 2 = 0 3
𝑔(𝑥) = √2 ∗ 𝑥 + 2
Hallando punto inicial:
xi f(xi)
1 -3 f(xi)
1,1 -2,869
2,1 3,061 1008.101
3,1 21,591
4,1 58,721 733.371
5,1 120,451
513.241
6,1 212,781
341.711
7,1 341,711 212.781
8,1 513,241 120.451
58.721
-3 -2.8693.06121.591
9,1 733,371
1 2 3 4 5 6 7 8 9 10 11
10,1 1008,101
Factorizando x:
Para:
1 2 3 4 5 6 7
xi g(x)
𝑓(𝑥)′ = 3 ∗ 𝑥 2 − 2 = 0
2.860122699 2.860122699
2.164657223 2.164657223
1.848356486 1.848356486
1.77343439 1.7693046211.7692923541.769292354
1.77343439 1.7693046211.769292354
1.1
1 2 3 4 5 6 7
xi g(xi+1)
Método Newton-Raphson
En Matlab:
De la siguiente ecucación:
ingrese la Funcion
F=1357*(1.00011+(0.034221*cos(360/365*(x-
1)))+(0.00128*sin(360/365*(x-
1)))+(0.000719*cos(2*(360/365*(x-
1))))+(0.000077*sin(2*(360/365*(x-1)))))
ingrese el valor x0=17
ingrese la tol=0.0001
Newton-Raphson
++++++++++++++++++++++++++++++++++++++++++++++++
i x0 x1 abs(f(x))
++++++++++++++++++++++++++++++++++++++++++++++++
0 17.0000 -829.2771 1.5500
***********************
La Raiz es -829.277
MÉTODO DE LA SECANTE
𝑓(𝑥) = 𝑥 3 − 2 ∗ 𝑥 − 2 = 0
1.933813797
1.933813797
1.769408406
1.765112369
1.731489678 1.769408406
1.769292005
1.765112369
1.731489678 1.769292005
1.769292354
1.469808528
1.469808528
1.310126404
1.310126404
1 1.1
1 2 3 4 5 6 7 8 9 10
xi g(xi+1)
1.1
1 2 3 4 5 6
Xi Xd xm
MÉTODO DE LA BISECCIÓN
𝑓(𝑥) = 𝑥 3 − 2 ∗ 𝑥 − 2 = 0 𝑥𝑑 = 2,1 𝑥𝑖 = 1,1
i xi xd xm f(m) condición d condición
1 2
0 1,1 2,1 1,6 -1,104 xi=xm
1 1,6 2,1 1,85 0,631625 xd=xm 0,25 no se encuentra la
raíz
2 1,6 1,85 1,725 -0,31704687 xi=xm 0,125 no se encuentra la
raíz
3 1,725 1,85 1,7875 0,136341797 xd=xm 0,0625 no se encuentra la
raíz
4 1,725 1,7875 1,75625 -0,0954978 xi=xm 0,03125 no se encuentra la
raíz
5 1,75625 1,7875 1,771875 0,019124237 xd=xm 0,015625 no se encuentra la
raíz
6 1,75625 1,771875 1,7640625 -0,03850979 xi=xm 0,0078125 no se encuentra la
raíz
7 1,7640625 1,771875 1,76796875 -0,00977371 xi=xm 0,00390625 no se encuentra la
raíz
8 1,76796875 1,771875 1,76992188 0,004655009 xd=xm 0,00195313 no se encuentra la
raíz
9 1,76796875 1,76992188 1,76894531 -0,00256441 xi=xm 0,00097656 se encontró la raíz
METODO DE LA BISECCION
2.1 2.1
1.85 1.85 1.7875
1.85 1.7875 1.78751.771875
1.725 11.756251.75625
.771875 1.771875
1.7640625 1.771875
1.769921875
1.76796875 1.769921875
1.768945313
1.76796875
1.7640625 1.76796875
1.6 1.6 1.6 1.725 1.75625
1.725
1.1
1 2 3 4 5 6 7 8 9 10
xi xd xm
ACELERACION DE COVERGENCIA
f(x)=2*X^3-11.7*X^2+17.7*X-5
Funcion: E=0.0002
X inicial 0
variacion 0.5
X f(X)
0 -1
0.5 0.8125
1 1
1.5 -0.0625
2 -2
2.5 -4.4375
3 -7
3.5 -9.3125
4 -11
4.5 -11.6875
5 -11
5.5 -8.5625
6 -4
6.5 3.0625
7 13
7.5 26.1875
8 43
8.5 63.8125
9 89
9.5 118.9375
g(x)=(5+11.7*x^2-2*x^3)/(17.7)
AIKTEN
i Xi g(X) Xo d=lXi+1-Xil
0 3 4.18327713 0.00244719
1 3.18079096 3.70699839 0.00112289
2 3.33395917 3.59715565 0.00022726
3 3.44254325 3.57039878 2.6155E-05
4 3.50632999 3.56454453 3.56422922 2.2997E-06
5 3.53829371 3.56340669 3.56178204 1.7534E-07
6 3.55270719 3.56320283 3.56290492
7 3.55884812 3.56316787 3.56313218
8 3.56139603 3.563162 3.56315834
9 3.56244111 3.56244116 3.56316064
10 3.56286773 0 3.56316081
STEFFENSEN
AIKTEN STEFFENSEN
Columna1 Columna2 Columna3 Columna4 Columna5 distancia Columna7 Columna1 Columna2
i Xi g(X) f(aikten) d f(steffensen) i Xi
0 3 2.94915254 4.11237413 4.18327713 2.27921253 0 3
1 3.18079096 3.12687925 3.64416791 3.70699839 0.47627875 -0.22790293 1 3.18079096
2 3.33395917 3.27745139 3.53618691 3.59715565 0.10984274 -0.10543011 2 3.33395917
3 3.44254325 3.38419506 3.50988355 3.57039878 0.02675687 -0.02712302 3 3.44254325
4 3.50632999 3.44690066 3.50412853 3.56454453 0.00585425 -0.00559413 4 3.50632999
5 3.53829371 3.47832263 3.50300997 3.56340669 0.00113784 -0.00102643 5 3.53829371
6 3.55270719 3.49249182 3.50280956 3.56320283 0.00020386 -0.00017775 6 3.55270719
7 3.55884812 3.49852866 3.5027752 3.56316787 3.496E-05 -2.9987E-05 7 3.55884812
8 3.56139603 3.50103339 3.50276942 3.563162 5.8743E-06 -5.0027E-06 8 3.56139603
9 3.56244111 3.50206076 3.50276846 3.56316102 9.7843E-07 -8.3076E-07 9 3.56244111
10 3.56286773 3.50248014 3.5027683 3.56316086 1.6237E-07 -1.3769E-07 10 3.56286773
11 3.56304153 3.502651 3.50276827 3.56316083 2.6905E-08 -2.2804E-08 11 3.56304153
12 3.56311228 3.50272055 3.50276827 3.56316083 4.4554E-09 -3.7756E-09 12 3.56311228
13 3.56314107 3.50274885 3.50276827 3.56316083 7.3763E-10 -6.2501E-10 13 3.56314107
14 3.56315279 3.50276037 3.50276827 3.56316082 1.221E-10 -1.0348E-10 14 3.56315279
15 3.56315756 3.50276505 3.50276827 3.56316082 2.0213E-11 -2.3545E-05 15 3.56315756
16 3.56315949 3.50276696 3.50276696 3.56315949 1.3302E-06 -63.067937 16 3.56315949
17 3.56316028 3.50276774 0 0 3.56315949 -5 17 3.56316028
METODO DE ILLINOIS
x f(x)
0 -3 6
0.1 -2.90497 5
0.2 -2.79904 4
0.3 -2.64771 3
0.4 -2.40928
2
0.5 -2.03125
1 Series1
0.6 -1.44672
0
0.7 -0.57079 0 0.2 0.4 0.6 0.8 1 1.2
-1
0.8 0.70304
-2
0.9 2.50647
-3
1 5 -4
METODO DE ILLINOIS
F(x)=3*x^5+5*x^3-7*x^2+x -3
VALORES INICIALES: xi= 1
xd= 1.1
I).fd*fm>0 xd=xi
(+)(+) xi=xm
II).fd*fm<0 xi=xd
(-)(+) fi=fd
fd=fd/2
+ - 10^-4
jk xi xd xm fd fi fm d=|xm(i+1)-xm(i)|
0 1 1.1 1.05000 1.1165 -1 -0.0505
1 1.05 1 1.02500 -1 -0.05053 -0.5507 0.025
2 1.025 1 1.01250 -0.5 -0.5507 -0.7815 0.0125
3 1.0125 1 1.00625 -0.25 -0.78149 -0.8923 0.00625
4 1.00625 1 1.00313 -0.125 -0.89226 -0.9465 0.003125
5 1.003125 1 1.00156 -0.063 -0.9465 -0.9733 0.0015625
6
7
8
HALLANDO
9 LAS RAÍCES COMPLEJAS DE:
10
𝑥2 + 4 = 0
POR EL MEDIO DEL MÉTODO DE:
MULLER
x0=1i;x1=1.1i;x2=1.2i;
for i=1:10;
f0=x0^2+4;
f1=x1^2+4;
f2=x2^2+4;
h0=x1-x0;
h1=x2-x1;
d0=(f1-f0)/(x1-x0);
d1=(f2-f1)/(x2-x1);
a=(d1-d0)/(h1-h0);
b=a*h1+d1;
c=f2;
x3=x2+(-2*c)/(b+(b^2-4*a*c)^(1/2));
dist=abs(x1-x0);
disp([x1,dist])
x0=x1;x1=x2;x2=x3;
end
CORRIENDO EL PROGRAMA
ans =
0.0000 + 2.0000i
0.0000 - 2.0000i
Método de Lin:
F(x)= 3x^4+2x^3-5x+2
f'(x)= 12x^3+6x^2-5
3 2 0 -5 2
2.2 6.6 18.92 41.624 80.5728 t1 -0.054609
3 8.6 18.92 36.624 82.5728
3 2 0 -5 2
-
-0.054609 -0.163827 0.00547573 0.27274597 t2 0.40043854
0.10027157
- -
3 1.836173 2.27274597
0.10027157 4.99452427
3 2 0 2-5
-
0.40043854 1.20131562 1.28193015 0.51333423 t3 0.44576532
1.79663388
-
3 3.20131562 1.28193015 0.20336612
4.48666577
3 2 0 -5 2
-
0.44576532 1.33729596 1.4876508 0.66314314 t4 0.46116348
1.93322039
-
3 3.33729596 1.4876508 0.06677961
4.33685686
3 2 0 2-5
-
0.46116348 1.38349044 1.56034222 0.71957285 t5 0.46724309
1.97397668
-
3 3.38349044 1.56034222 0.02602332
4.28042715
Estabilizando se obtiene:
t0 2.2
f(0) 2
f(t0) 151.816
landa -0.00598811
t1 2.21350085
Eliminación de Gauss:
A=
2X – Y + Z + 2W = 6
1 3 2 -1 -1
5X + 3Y + 2Z -3W = 4
2 1 -1 -4 -1
3X + 2Y + 3Z + W = 5
2 -1 1 2 6
4X + 2Y + 5Z – 2W = 3
4 2 5 -2 3
A=[2 -1 1 2 6;5 3 2 -3 4;3 2 3 1 5;4 2 5 -2 3]
>> A(4,:)=A(4,:)-A(1,:)
A=
A=
2 -1 1 2 6
1 3 2 -1 -1
5 3 2 -3 4
2 1 -1 -4 -1
3 2 3 1 5
2 -1 1 2 6
4 2 5 -2 3
3 -1 3 -1 4
>> A(1,:)=A(1,:)- A(3,:)
>> A(4,:)=A(4,:)-A(3,:)
A=
A=
-1 -3 -2 1 1
1 3 2 -1 -1
5 3 2 -3 4
2 1 -1 -4 -1
3 2 3 1 5
2 -1 1 2 6
4 2 5 -2 3
1 0 2 -3 -2
>> A(1,:)=-A(1,:)
>> A(2,:)=A(2,:)-A(3,:)
A=
A=
1 3 2 -1 -1
1 3 2 -1 -1
5 3 2 -3 4
0 2 -2 -6 -7
3 2 3 1 5
2 -1 1 2 6
4 2 5 -2 3
1 0 2 -3 -2
>> A(2,:)=A(2,:)-A(3,:)
>> A(2,:)=A(2,:)-A(1,:)
A=
A=
1 3 2 -1 -1
1 3 2 -1 -1
2 1 -1 -4 -1
-1 -1 -4 -5 -6
3 2 3 1 5
2 -1 1 2 6
4 2 5 -2 3
1 0 2 -3 -2
>> A(3,:)=A(3,:)-A(1,:)
>> A(3,:)=A(3,:)-A(2,:)
A= A=
1 3 2 -1 -1 1 3 2 -1 -1
-1 -1 -4 -5 -6 0 1 2 8 8
3 0 5 7 12 1 0 1 13 16
1 0 2 -3 -2 0 0 1 -16 -18
A= A=
1 3 2 -1 -1 1 3 2 -1 -1
0 -1 -2 -8 -8 0 1 2 8 8
3 0 5 7 12 1 0 1 13 16
1 0 2 -3 -2 1 0 2 -3 -2
A= A=
1 3 2 -1 -1 1 3 2 -1 -1
0 1 2 8 8 0 1 2 8 8
3 0 5 7 12 0 0 -1 16 18
1 0 2 -3 -2 1 0 2 -3 -2
A= A=
1 3 2 -1 -1 1 3 2 -1 -1
0 1 2 8 8 0 1 2 8 8
2 0 3 10 14 0 0 1 -16 -18
1 0 2 -3 -2 1 0 2 -3 -2
A= A=
1 3 2 -1 -1 1 3 2 -1 -1
0 1 2 8 8 0 1 1 24 26
1 0 1 13 16 0 0 1 -16 -18
1 0 2 -3 -2 1 0 2 -3 -2
0 1 1 24 26
0 0 1 -16 -18
0 0 0 52 59
>> A(4,:)=A(4,:)/52
A=