I am trying to solve a square polynomial system (16 x 16, I was able to solve an 8 x 8 fine) using the package RegularChains (with Groebner bases the problem is the same) but I have a memory constraint of 4G in the Linux cluster and my batch job gets terminated after Maple grabs too much memory:

TERM_MEMLIMIT; (job*killed*after*reaching*LSF*memory*usage*limit.Exited, with, true)*(File*size*limit*exceeded.Resource, usage, true)*summary; CPU*time;(4509.00*sec.Max, Memory, true...

I need to use subscripts to define a system of equation and its respective variables. I do not encounter any problem when I use solve or Basis (with Groebner package) but when I tried to use RealRootCounting (with RegularChains and SemiAlgebraicSetTools packages), I got the following error message:

Error, (in RegularChains:-SemiAlgebraicSetTools:-RealRootCounting) invalid input: TRDnearsolve expects its 5th argument, vlist, to be of type list(symbol), but received [p[1], x[1], q[1], u[1]]...

Does the current implementation of Maple has any any command to characterize the solution of a linear PDE system with m unknows (functions) and n variables?

I need a command that receives as input the PDE system and tells the nature of the solutions: k0 constants, k1 functions of 1 variable, k2 functions of 2 variables, ... , kn functions of n variables. I think mathematicians call this the Cartan character of the system (I am an economist).

I was reading and...