cuiknewton.c File Reference

## Detailed Description Find a solution of a cuiksystem set of equations using the Newton-Rhapson method. It is based on an iterative process starting from a random point sampled in the initial box.
If the system is undetermined, i.e. number of variables higher than number of equations, the method is based on the Moor-Penrose generalised inverse.
In all cases the matrices inverses are not computed. Instead, a linear system baed on a LU decomposition is solved. These computation use the GSL library.
The method can diverge if the initial point is far from the solutions of the system.

cuiknewtonworld.c cuikplan.c

Definition in file cuiknewton.c.

## Functions

int main (int argc, char **arg)
Main body of the cuiknewton application. More...

## Function Documentation

 int main ( int argc, char ** arg )

Main body of the cuiknewton application.

Use:

• cuiknewton num_samples problem_name.cuik

where

• problem_name contains the kinematic equations.
• num_samples is the number of times we want to apply the Newton process.

In this case we sample points at random in the initial box and try to converge to the manifold. If the Newton process succeeds, we print the solution point, a tiny box around it, and the error in the solution point.

The program can also be used as:

• cuiknewton problem_name.cuik

where

• problem_name contains the kinematic equations.

In this case we search for a solution file and we try to converge to a point for each one of the boxes in the solution file. If the solution file does not exists an error is triggered.

In any cases .cuik extension is optional.

Parameters
 argc Number of elements in the command line that starts the application (i.e., the cuiknewton command itself and its arguments). arg Strings with the arguments.
Returns
EXIT_SUCCESS (0) if the execution worked out fine and EXIT_FAILURE if not.

Definition at line 82 of file cuiknewton.c.