double
G(int j, int k, int m, int n) {
return(
( a[j][0] * a[k][1] - a[k][0] * a[j][1] ) *
( a[m][2] * a[n][3] - a[n][2] * a[m][3] )
);
}
======================================
then observe that function overhead could be reduced by unrolling
the whole thing, instead of calling G six times...or in-lining G,
something such.
It would be good to know if the F- or G- scheme gives you the speed
you want, for there are yet more speedups possible...it all becomes,
as is typical, a tradeoff between research time and execution time,
i.e. quality-of-life vs. quality-of-machine-life!
Richard Crandall
Advanced Computation Group
_______________________________________________
Do not post admin requests to the list. They will be ignored.
Scitech mailing list (email@hidden)
Help/Unsubscribe/Update your Subscription:
http://lists.apple.com/mailman/options/scitech/email@hidden
