On Sat, Mar 29, 2008 at 7:33 PM, John Randall <[EMAIL PROTECTED]> wrote: > Does anyone have a generalization of > > ppr=: +//.@(*/) > > for polynomials of several variables, with coefficients represented by > arrays? > > I would be happy with a solution to the simpler problem of 2 variables, > coefficients represented by matrices of fixed size, and multiplication in > the truncated polynomial ring.
For the latter, could you not use almost the same thing as for one variables, but replace * in its definition with multiplication of single variable polynomials, and + with addition of single variable polynomials? The result would probably be assembled in the right way by the normal fill rules. I'm not completely sure that would work, but it's worth a try. For multivariate polynomials, I've written a library in perl once that calculates with a sparse representation of them. It's at "http://www.perlmonks.com/?node_id=297829";. (My coding style was rather immature back then.) Ambrus ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
