Using the procedure described in The Deflection Curve we can calculate a sequence of curves. Each curve is defined by its curveture K and results in a new value of x(tip). Assigning an index to each curve we have:
K0 = 0 is the smallest curvature and x0(tip) is the largest x-value for the tip.
The curvature K3 calculated using x2(tip
) must be larger than K2 which was calculated using the smaller smaller x1(tip). That places the curve3 above curve2 making x3 lager than x2.
Which leads to the conclusion:
So after a certain number of iterations the curvature will approach a definite value Ktrue, which will never be reached, but we can get as close as we want to.
This page was modified May 11, 2003 |