OK, this is really, really vague. Sorry. But this is for work and the boss man, justifiably or not, is really worried about intellectual property and ROI and blah blah blah. So I can't say much. But anyway: I have a mathematical expression that has a 0/0 problem. That is, at a set of discrete points, the straightforward evaluation of the expression collapses to 0/0. Now, limits can be taken to produce completely reasonable results at these points. But the catch is I have to program this, and 1) I don't want to put in an exception for these points and 2) even if the inputs don't land us exactly on these points, computational accuracy will suffer in their neighborhood.
So, are there any generic methods of wide applicablity for re-writing expressions to get rid of 0/0 problems? I know about l'Hopital's rule etc., but again, I want to be able to program this thing without putting in special exceptions. Sorry again to be so vague. Thanks for whatever you've got!