  The Semi-Implicit Root solver (SIR) is an iterative method for globally
convergent solution of systems of nonlinear equations. Since publication, SIR
has proven robustness for a great variety of problems. We here present MATLAB
and MAPLE codes for SIR, that can be easily implemented in any application
where linear or nonlinear systems of equations need be solved efficiently. The
codes employ recently developed efficient sparse matrix algorithms and improved
numerical differentiation. SIR convergence is quasi-monotonous and approaches
second order in the proximity of the real roots. Global convergence is usually
superior to that of Newtons method, being a special case of the method.
Furthermore the algorithm cannot land on local minima, as may be the case for
Newtons method with linesearch.
