0% found this document useful (0 votes)
61 views16 pages

Examenes 201

The document contains several examples of numerical methods for solving equations including bisection, false position, Newton's method, and secant method. For each example it provides the function, table of x and f(x) values, calculations showing the iterations, and error analysis. It demonstrates applying these root-finding algorithms to solve different types of equations both graphically and numerically.

Uploaded by

leo rfgr
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
Download as xlsx, pdf, or txt
0% found this document useful (0 votes)
61 views16 pages

Examenes 201

The document contains several examples of numerical methods for solving equations including bisection, false position, Newton's method, and secant method. For each example it provides the function, table of x and f(x) values, calculations showing the iterations, and error analysis. It demonstrates applying these root-finding algorithms to solve different types of equations both graphically and numerically.

Uploaded by

leo rfgr
Copyright
© © All Rights Reserved
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
Download as xlsx, pdf, or txt
Download as xlsx, pdf, or txt
You are on page 1/ 16

MÉTODO BISECCIÓN

PROBLEMA 1
f(x) Chart Title
0 1
1.5
0.1 0.86905887
0.2 0.71763386 1
0.3 0.54817287
0.4 0.36355644 0.5
0.5 0.1670464
0.6 -0.0377747 0
0 0.2 0.4 0.6 0.8 1 1.2
0.7 -0.24707207
0.8 -0.45683381 -0.5
0.9 -0.66295112
1 -0.86130188 -1

1.1 -1.04783599
-1.5
1.2 -1.21866044

ERROR RELATIVO
a b x f(a) f(b) f(x) abs
0 0.5 0.6 0.55 0.1670463955 -0.0377747 0.06544011 0.06544011
1 0.55 0.6 0.575 0.0654401137 -0.0377747 0.01400364 0.01400364
2 0.575 0.6 0.5875 0.0140036426 -0.0377747 -0.01184661 0.01184661
3 0.575 0.5875 0.58125 0.0140036426 -0.01184661 0.00108873 0.00108873
4 0.58125 0.5875 0.584375 0.0010887273 -0.01184661 -0.00537645 0.00537645
5 0.58125 0.584375 0.5828125 0.0010887273 -0.00537645 -0.00214323 0.00214323
6 0.58125 0.5828125 0.58203125 0.0010887273 -0.00214323 -0.00052709 0.00052709

MÉTODO DE LA FALSA POSICIÓN


PROBLEMA 3
Chart Title
f(x)
0.15
0 0.1
0.1
0.1 0.00998334
0.2 -0.06026613 0.05

0.3 -0.11134394 0
0 0.1 0.2 0.3 0.4 0.5 0.6 0.7
0.4 -0.14423266 -0.05

0.5 -0.16028723 -0.1

0.6 -0.16121452 -0.15


-0.2

ERROR RELATIVO
x f(x) abs 1.00E-04
0 0.1 0.00998334 0.00998334 0
1 0.2 -0.06026613 0.06026613 0
2 0.11421127 -0.00119539 0.00119539 0
3 0.11247519 0.00014882 0.00014882 0
4 0.1126674 -2.9295E-07 2.9295E-07 1

MÉTODO DE NEWTON
PROBLEMA 2
f(x) Chart Title
0 1 1.5
0.1 0.96013316
1
0.2 0.84212199
0.3 0.65067123 0.5
0.4 0.39341342 0
0.5 0.08060461 0 0.2 0.4 0.6 0.8 1 1.2
0.6 -0.27528449 -0.5

0.7 -0.66006571 -1
0.8 -1.05839904
-1.5
0.9 -1.45440419
1 -1.83229367 -2

ERROR RELATIVO
x f(x) f'(x) abs 1.00E-04
0 0.5 0.08060461 -3.36588394 0.0806046117 0
1 0.52394753 -0.00120837 -3.4654958 0.0012083691 0
2 0.52359885 -2.4297E-07 -3.4641019 2.429677E-07 1
1 1.2 1.4

ERROR RELATIVO
1.00E-03
0
0
0
0
0
0
1

0.6 0.7
1 1.2
MÉTODO BISECCIÓN
PROBLEMA 1
f(t) = cos(1.5t)+sen(1.2t)-0.74 Chart Title
0.1 0.368483285224962 1
0.3 0.512721335627767
0.5 0.556331342268856 0.5
0.7 0.502214167862586
0.9 0.360964493977989 0
0 0.5 1 1.5
1.1 0.149594211311531
1.3 -0.110239111121321 -0.5
1.5 -0.394325991844544
1.7 -0.678124884281843 -1
1.9 -0.938906529372168
2.1 -1.15763400894726 -1.5

Column C Column D

ERROR RELATIVO
a b x f(a) f(b) f(x) abs
0 1.1 1.3 1.2 0.149594211 -0.110239111 0.02425625 0.02425625
1 1.2 1.3 1.25 0.024256253 -0.110239111 -0.04203852 0.04203852
2 1.2 1.25 1.225 0.024256253 -0.04203852 -0.00862874 0.00862874
3 1.2 1.225 1.2125 0.024256253 -0.00862874 0.00788236 0.00788236
4 1.2125 1.225 1.21875 0.007882362 -0.00862874 -0.00035641 0.00035641

MÉTODO DE NEWTON
PROBLEMA 2
f(t) = 1.2*cos(1.2t)
Chart Title
0.1 1.191370 1.500000
0.3 1.123076
1.000000
0.5 0.990403
0.7 0.800955 0.500000
0.9 0.565594
0.000000
1.1 0.297811 0 0.5 1 1.5 2
1.3 0.012955 -0.500000
1.5 -0.27264251
-1.000000
1.7 -0.542611
1.9 -0.781476 -1.500000
2.1 -0.975542

ERROR RELATIVO
x f(x) f'(x) abs 1.00E-03
0 1.3 0.01295534 -1.43991608 0.01295534 0
1 1.308997289 -5.03394E-07 -1.44 5.033943E-07 1

MÉTODO DE LA SECANTE
PROBLEMA 3
f(x) =ln(x)+x-0.25
0.1 -2.45258509
0.2 -1.65943791
0.3 -1.1539728
0.4 -0.76629073
0.5 -0.44314718
0.6 -0.16082562
0.7 0.093325056
0.8 0.326856449
0.9 0.544639484
1 0.75

ERROR RELATIVO
x f(x) abs 1.00E-04
0 0.6 -0.16082562 0.16082562 0
1 0.7 0.093325056 0.09332506 0
2 0.663279635 0.002721031 0.00272103 0
3 0.662176845 -4.57758E-05 4.57758E-05 1
Chart Title

1 1.5 2 2.5

Column C Column D

ERROR RELATIVO
1.00E-03
0
0
0
0
1

1.5 2 2.5
Chart Title
1
0.5
0
0 0.2 0.4 0.6 0.8 1 1.2
-0.5
-1
-1.5
-2
-2.5
-3
MÉTODO NEWTON-2V
PROBLEMA 1

A B
X F(X) (J.F)(X) [(J.F)(X)]-1
X1 7 0.3502311 0.02699746 0.9553364891 1.14386733 -1.47509628
0
X2 -0.3 0.29472048 -0.6569866 0.7408182207 1.01442633 0.04168569

X1 7.03412316 0.03311324 0.02680125 0.7853287935 0.93332732 -1.42891749


1
X2 -0.66756928 0.04400318 -0.68232467 0.5129539123 1.24149995 0.04876528

X3 7.06609459 0.00575332 0.02661956 0.7578237303 0.89706999 -1.38389133


2
X4 -0.71082519 0.00010316 -0.70534469 0.4912386643 1.28805731 0.04861101

X1 7.06107621 -0.00079253 0.02664794 0.7529645428 0.90063171 -1.39075229


3
X2 -0.71824082 4.53278E-06 -0.70177847 0.4876092953 1.2962098 0.04921969

MÉTODO DE LA SECANTE
PROBLEMA 3
f(x)
x f(x)
0.5 0.59030231 0.8

0.6 0.46235775 0.6


0.7 0.31996714
0.8 0.17080048 0.4
0.9 0.02279791
0.2
1 -0.11614684
1.1 -0.23850112 0
0.4 0.6 0.8 1 1.2
1.2 -0.33739372
1.3 -0.40688875 -0.2

1.4 -0.44222234 -0.4


1.5 -0.4399925
-0.6

ERROR RELATIVO
x f(x) abs 1.00E-03
0 0.9 0.02279791 0.02279791 0
1 1 -0.11614684 0.11614684 0
2 0.91640789 -0.00082767 0.00082767 1
B*A ERROR RESIDUAL
PRODUCTO ABS 1.00E-03
#NAME? 0.3502311 0
#NAME? 0.29472048 0

#NAME? 0.03311324 0
#NAME? 0.04400318 0

#NAME? 0.00575332 0
#NAME? 0.00010316 1

#NAME? 0.00079253 1
#NAME? 4.53278E-06 1

f(x)

8 1 1.2 1.4 1.6


MÉTODO DE NEWTON
PROBLEMA 1
t f(t) f(t)
0.1 0.6537867163
0.8
0.2 0.504538675
0.6
0.3 0.3543413 0.4
0.4 0.2052533238 0.2
0.5 0.0592778271 0
0.6 -0.0816656681 0 0.2 0.4 0.6 0.8 1 1.2
-0.2
0.7 -0.2157676552 -0.4
0.8 -0.3413532757 -0.6
0.9 -0.4569047849 -0.8
1 -0.5610815357
ERROR ABSOLUTO
t f(t) f'(t) abs 1.00E-04
0 0.5 0.0592778271 -1.43771102 0.0592778271 0 RPTA:
1 0.541230697 0.0004502141 -1.41534879 0.0588276131 0
2 0.541548791 2.936781E-08 -1.41516411 0.0004501847 0
3 0.541548811 2.0866298E-09 -1.4151641 2.728118E-08 1

MÉTODO NEWTON-2V
PROBLEMA 4

A B
X F(X) (J.F)(X) [(J.F)(X)]-1
X1 1 -1 1.5 2 -0.22006528 -1.05763285
0
X2 1 0.64959973 -1.257617821 -0.416146837 0.66504896 0.79322464

X1 1.4669727357 0.09874966 1.8167797487 2.299540897 -0.31993299 -0.85012657


1
X2 1.1497704483 -0.19528009 -1.86001455 -0.86539938 0.6876363 0.67165265

X1 #NAME? #NAME? #NAME? #NAME? #NAME? #NAME?


2
X2 #NAME? #NAME? #NAME? #NAME? #NAME? #NAME?

X1 #NAME? #NAME? #NAME? #NAME? #NAME? #NAME?


3
X2 #NAME? #NAME? #NAME? #NAME? #NAME? #NAME?
.8 1 1.2

t V(t)max
0.54154881 1.21598218

B*A ERROR RESIDUAL


PRODUCTO ABS 1.00E-03
#NAME? 1 0
#NAME? 0.64959973 0

#NAME? 0.09874966 0
#NAME? 0.19528009 0

#NAME? #NAME? #NAME?


#NAME? #NAME? #NAME?

#NAME? #NAME? #NAME?


#NAME? #NAME? #NAME?
CROUT

A 1 2 1 1
1 4 1 3
2 5 5 3
1 4 1 5

L 1 0 0 0
1 2 0 0
2 1 3 0
1 2 0 2

U 1 2 1 1
0 1 0 1
0 0 1 0
0 0 0 1

LU A 1 2 1 1 LLt
1 4 1 3
2 5 5 3
1 4 1 5
CHOLESKY

1. BUSCAMOS LA COVERGENCIA
A
A 4 2 4 2 15 1
2 2 3 3 2 12
4 3 6 6 0 2
2 3 6 13 3 1

L 2 0 0 0 2. FORMULAS
1 1 0 0 JACOBI
2 1 1 0 X1(i+1)=(40-0*X2(i)-2*X3(i)-X4(i))/30
1 2 2 2 X2(i+1)=(55-X1(i)-2*X3(i)-X4(i))/22
X3(i+1)=(44-2*X1(i)-X2(i)-X4(i))/12
L 2 1 2 1 Y4(i+1)=(69-2*X1(i)-2*X2(i)-X3(i))/15
0 1 1 2
0 0 1 2 3. APLICAR JACOBI
0 0 0 2 X1
3.266666667
2.883333333
3.019537037
A 4 2 4 2
2 2 3 3
4 3 6 6
2 3 6 13
3
0.019537037
0.1 1
JACOBI GAUS

A COVERGENCIA Fila 2 = Fila 2 - Fila 1 1. BUSCAMOS LA COVERGENCIA


A X B A
0 1 0 49 15 1
1 0 0 43 2 12
15 2 0 23 0 2
2 12 0 26 3 1

2. FORMULAS
JACOBI
*X2(i)-2*X3(i)-X4(i))/30 Y1(i+1)=(22-Y2(i)-2*Y3(i)-Y4(i))/15
X1(i)-2*X3(i)-X4(i))/22 Y2(i+1)=(15-Y1(i)-Y3(i)-2*Y4(i))/8
2*X1(i)-X2(i)-X4(i))/12 Y3(i+1)=(29-2*Y1(i)-Y2(i)-Y4(i))/12
*X1(i)-2*X2(i)-X3(i))/15 Y4(i+1)=(26-Y1(i)-Y2(i)-2*Y3(i))/10

3. APLICAR SEIDEL
X2 X3 X4
3.5833333333 1.5333333333 2.1666666667 Y1
2.9111111111 0.7666666667 0.7958333333 3.1333333333
3.0388888889 1.0390740741 1.075462963 3.0036131687

3 1 1
0.0388888889 0.0390740741 0.075462963 3
1 1 1 0.0036131687
0.01 1
GAUSS SEIDEL

COVERGENCIA Se intercambio el orden de las filas


A Y B
0 1 1 49
1 0 1 43
15 2 1 23
2 12 1 26

SEIDEL
Y2(i)-2*Y3(i)-Y4(i))/15 Y1(i+1)=(22-Y2(i)-2*Y3(i)-Y4(i))/15
-Y1(i)-Y3(i)-2*Y4(i))/8 Y2(i+1)=(15-Y1(i+1)-Y3(i)-2*Y4(i))/8
2*Y1(i)-Y2(i)-Y4(i))/12 Y3(i+1)=(29-2*Y1(i+1)-Y2(i+1)-Y4(i))/12
Y1(i)-Y2(i)-2*Y3(i))/10 Y4(i+1)=(26-Y1(i+1)-Y2(i+1)-2*Y3(i+1))/10

Y2 Y3 Y4
2.9777777778 1.002962963 0.9680246914
2.9991508916 1.0043765889 0.9984380354

3 1 1
0.0008491084 0.0043765889 0.0015619646
1 1 1

You might also like