Abstract:
An approach to the computation of singular solutions to systems of nonlinear equations is proposed. It consists in the construction of an (overdetermined) defining system to which the Gauss–Newton method is applied. This approach leads to completely implementable local algorithms without nondeterministic elements. Under fairly weak conditions, these algorithms have locally superlinear convergence.