Documentos de Académico
Documentos de Profesional
Documentos de Cultura
Biseccion Corregido
Biseccion Corregido
PROBLEMA
g := 9.81 ∆ := 1.65 q := 5
METODO DE BISECCION
1. El método busca una raiz de una función del tipo f(x)=0.
2. Se escogen dos puntos, a y b, que definen un intervalo en el que se encuentra la raiz de la función
f(x) que se esta buscando
a = ao b = bo
b−a a+b
p = a+ =
2 2
[a,p] [p,b]
NOTA : El metodo no converge si al evaluar f(a) y f(b) tienen el mismo signo, se tendra que redefinir el intervalo a,b
Intervalo Inicial
DATOS DEL PROBLEMA
a := 0.5 b := 5
−6
D50 := 0.002 ν := 1 × 10 S := 0.0008
Numero máximo de Iteraciones
g := 9.81 ∆ := 1.65 q := 5
No := 100
Tolerancia Permitida
TOL := 0.01
FUNCIONES
Diagrama de shields:
bs
1, 1
g ⋅ p ⋅ S ⋅ D 50 g ⋅ p ⋅ S ⋅ D50
τof ( p) := τ o ← as ⋅ if < Rango_Re
1, 1 1, 2
ν ν
otherwise
bs
1, 2
g ⋅ p ⋅ S ⋅ D 50 g ⋅ p ⋅ S ⋅ D50
τ o ← as ⋅ if < Rango_Re
1, 2 1, 3
ν ν
otherwise
bs
1, 3
g ⋅ p ⋅ S ⋅ D 50 g ⋅ p ⋅ S ⋅ D50
τ o ← as ⋅ if < Rango_Re
1, 3 ν ν 1, 4
otherwise
bs
1, 4
g ⋅ p ⋅ S ⋅ D 50 g ⋅ p ⋅ S ⋅ D50
τ o ← as ⋅ if < Rango_Re
1, 4 1, 5
ν ν
otherwise
bs
1, 5
g ⋅ p ⋅ S ⋅ D 50 g ⋅ p ⋅ S ⋅ D50
τ o ← as ⋅ if < Rango_Re
1, 5
ν ν 1, 6
τ o ← 0.06 otherwise
(
α := g ⋅ ∆ ⋅ D50 ) 0.5 α = 0.179924984
g⋅ p⋅ S − τo ⋅ α g⋅ p⋅ S − τ o ⋅ α
⋅ log + 0.137 ⋅ log( S) − 0.163 ⋅ log
p
0.281 + 0.194 + 0.059 ⋅ log q
α D50 α p
Ff ( p , τo) := − log
g⋅ p⋅ S − τ o ⋅ α α
0.415 − 0.209 ⋅ log
α
hNo := i←0
n←0
FP ← 1
τ o ← τ of ( a)
(
FA ← F f a , τ o )
τ o ← τ of ( b)
(
FB ← F f b , τ o )
return "El intervalo [a-b] no contiene la raiz" if FA ⋅ FB > 0
while No > n
n←n+1
break if FP = 0
otherwise
( b − a)
break if < TOL
2
otherwise
i←i+1
( b − a)
p←a+
2
τ o ← τ of ( p)
(
FP ← F f p , τ o )
if FA ⋅ FP > 0
a←p
hi ← p
FA ← FP
otherwise
b←p
1
hi ← p
1 2.75
h
2 3.875
3 3.3125
4 3.03125
5 2.890625
6 2.8203125
7 2.78515625
hNo = 8 2.802734375
9 0
10 0
11 0
12 0
13 0
14 0
15 0
16 ...