Slow Python - what can be done?

[Jason Sewall]

It's affine for the one-line-pair case, but the full algorithm actually 
uses n line pairs to describe a nonlinear transformation. Since the 
transformations are weighted for each pair, the matrix solution doesn't 
cut it for the general case.

Of course, since I didn't mention it, you wouldn't have known that - sorry.

It should be obvious now why I want the speed tho - doing that 
transformation n times and then adding in some extra sums and a division 
  will only make things slower.

Jason