continuation_test
continuation_test,
an Octave code which
calls continuation(), which
implements the continuation method for a simple 2D problem,
which involves finding a point on the unit circle, and then
finding a sequence of nearby points which trace out the full
curve, using only the information available in the implicit
definition of the curve from the function f(x,y)=x^2+y^2-1.
Licensing:
The computer code and data files made available on this web page
are distributed under
the MIT license
Related Data and Programs:
continuation,
an Octave code which
implements the continuation method for a simple 2D problem,
involving finding a point on the unit circle, and then
finding a sequence of nearby points that trace out the full
curve, using only the information available in the implicit
definition of the curve from the function f(x,y)=x^2+y^2-1.
Source Code:
-
circle_test.m,
demonstrates the continuation method for finding points on a circle.
-
circle_test.png,
a PNG image of the points computed on the circle.
-
f_circle.m,
evaluates the function that implicitly defines a circle.
-
fp_circle.m,
evaluates the jacobian of the function that implicitly defines a circle.
-
lotka_test.m,
demonstrates the continuation method for a Lotka function.
-
lotka_test.png,
a PNG image of the points computed on the Lotka curve.
-
f_lotka.m,
evaluates the function that implicitly defines a Lotka curve.
-
fp_lotka.m,
evaluates the jacobian of the function that implicitly defines a Lotka curve.
-
newton_test.m,
demonstrates the Newton code.
-
step_test.m,
demonstrates the continuation step code.
-
tangent_test.m,
demonstrates the tangent code.
Last modified on 27 June 2022.