Let F be a definite function from a real Banach space X to a real Banach space Y and g a point belonging to Y. We describe an algorithm for calculating the solutions u of the equation F of u equal to g. Initially, the algorithm starts from a curve c in the domain, which is chosen so as to substantially intercept the critical set of F. We calculate through continuation methods a component of the inverse image of F of c and define this component in an abstract way: graph completely mirrored. Clearly, standard continuation methods have better chances of success at different starting points. We provide geometric arguments for the occasional abundance of solutions and a structured search for these. Three examples are considered in detail. The first is a function of the plan in the plan, in which we can validate the results with the help of software. The second set of examples is obtained from the discretization of a non-linear Sturm-Liouville problem with an unexpected number of solutions. Finally, we calculate the six approximate solutions of a problem studied by Solimini.