Method to Solve 2 unknowns 2 Equations

Hi All,

It has been a long time since I opened the cover of my numerical method
books. So this be a
re-starters questions. Please forgive beforehand :)

I am trying to understand an algorithm which uses some kind of
numerical method to solve an equation. There are two equations :

t = f( v ) and v = g( t,v )

The functions don't include any trigonometric functions or unreal
numbers but are quite crowded with many divisions, square roots.

The algorithm simply sets v = 0 and evaluates

for 10 steps:
t = f (v) and then
v = g(t,v)

I have observed depending on the constants in functions f and g, the
method can solve t and v properly. But sometimes v and t never
converge.

Can anybody tell me what kind of numerical method is lying behind this
algorithm ?

Thanks a lot !

MDE

.

Quantcast