https://code.jsoftware.com/wiki/Essays/Polynomial+Division
Iverson's method for polynomial division is elegant, but it's a bit slow for large polynomials (order greater than 2000). Does anyone have a more efficient approach? Or is this one of those situations where it doesn't get any better? Thanks, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
