below code is calculate basis of kernel and kernel

i guess basis of image is 

remove(has, Ga, [r,u,v,w]); if this correct, i eliminate this, i can get the image

however it include variable 'a'

is it correct? if not, how to calculate? 

my final goal is to make unexact sequence into exact sequence

after union ideal I and J, how to remove the intersection of I and J in order to do primedecomposition?

I have a Matrix 'A' in maple with symbolic entries and I need to use that Matrix in matlab M file. The symbols with in 'A' are already initialized in M file.

How is this possible?

For Matrices 'A' of small dimension, I can use the codegeneration package to convert 'A' to Matlab Matrix and then copy paste.

But for matrices of 1000x1000, lets say, does not seem as a option.

r-x^4
u-(x^3)*y
v-x*y^3
w-y^4

Step 1
with(Groebner):
K := {r-x^4,u-(x^3)*y,v-x*y^3,w-y^4};
G := Basis(K, 'tord', degrevlex(r,u,v,w));

Step 2
G intersect k[r,u,v,w]

G2 := Basis({w*G[1],w*G[2],w*G[3],w*G[4],w*G[5],w*G[6],w*G[7],w*G[8],w*G[9],w*G[10],w*G[11],w*G[12],w*G[13],w*G[14], (1-w)*K[1], (1-w)*K[2], (1-w)*K[3], (1-w)*K[4]}, 'tord', degrevlex(r,u,v,w));

G2 has too much though include the correct solution

correct solution...

3*rho1 - 2*rho2 + rho3 - rho4 = -1

4*rho1 +   rho2 - rho3        = 5

original without cost function:

with(Groebner):
K := {y1-(x1^3)*(x2^4),y2-(x2^(1+2))*(w^2),y3-(x1^(1+1))*(w^1),y4-(x2^1)*w,(y1^1000)*(y2^1)*(y3^1)*(y4^100)- x1*x2*w + 1};
G := Basis(K, plex(x1, x2, w, y1, y2, y3, y4));
Reduce((x2^(5+1))*(w^1), G, plex(x1, x2, w, y1, y2, y3, y4));

after have cost function 1000*rho1 + rho2...

Here is my sheet. non_linear_P2_last_q.mw

In this problem I have achieved every thing what I aimed, thnaks to the wonderful people here!!!

I am looking for a way to do it in a more structured way meaning the calculation of Jacobian in the attached sheet is somewhat manuel, though I wonder does maple has some other way?

Hi all I have the following ODE

ODE_1:=diff(w(r),r)+R*(diff(w(r), r))^3=K/r;

ODE_T_1:=collect(algsubs(w(r)=u(r)+(r-1)*(U-0)/(delta-1), ODE_1),diff(u(r), r)) ;

 and when I try to do the following integration,

eq1:=int(phi[i](r)*ODE_T_1,r=1..delta) assuming delta > 1;

it gives the following error

"

Error, (in assuming) when calling 'int'. Received: 'wrong number (or type) of arguments:

i am doing a Q Laplace and finally summation it

however, i find an AccurateQSummation which is not like Summation

Should i use it, if not, use SumTools' summation how to simplify it?

restart;
with(QDifferenceEquations):
qexp := QPochhammer(-(-p*t), q, infinity);
f:= qexp*t;
b := subs(t=q^n,f);
QSimplify((1-q)*AccurateQSummation(b*q^n,n=-infinity..infinity));

with(SumTools):
QSimplify((1-q)*Summation(b*q^n,n=-infinity..infinity));

Hi

i know to make an asymptotic expansion one uses asympt(1+x,x); how do you make it go to -infity rather than plus infinity?

I have a huge PDE system included reaction-diffusion system with 4 independent and 12 independent variables. I read on the maple help for pdsolve/numeric/method. I found it is only for single partial differential equations in two independent variables. Is there anyone knows the ability of Maple for such a system?

1.

qRacah := qhyperterm([q^(-x), alpha*q^(-x)/(gamma*delta)], [alpha*q], q, gamma*delta*q^(x+1)*t, k)*qhyperterm([beta*delta*q^(x+1), gamma*q^(x+1)], [beta*q], q, q^(-x)*t, k);

i use inverse laplace to transform ordinary generating function into exponential generating function

can not further evaluated

2.

i do not know whether x is main variable or q is main variable or both are.

ff := eval(subs(x=0, exponential_genfun));

I want to solve 4 nonlinear equation using maple. I want to find many roots of this 4 nonlinear equation.

I have no idea about initial condition so I use 4 for initial condition. my program is as follow:

f1:=nonlinear equation1(include variable q1,q2,p1,p2);

f2:=nonlinear equation2(include variable q1,q2,p1,p2);

f3:=nonlinear equation3(include variable q1,q2,p1,p2);

f4:=nonlinear equation4(include variable q1,q2,p1,p2);

Hi,

     So I'm trying to animate a ball moving around in a moving circle. I can do a sequence of points, and a sequence of static circles which works okay but I'd like a continuous animation. Here is the points where the ball hits the circle (x,y) position and the times (t).  and the animation of the circle

restart;
with(plots);

x1 := [.9, -0.6953537244e-1, .5084436548, .5084436548, -.5253004431, -.4186356935,
     -.8180728424, -.8180728424,...

Here is , seemingly simple task:
In the Euclidean plane are given two sets, each with 4 points. It is known that all possible pairwise distances between the points of the first set coincide with all possible pairwise distances between the points of the second set, ie we obtain two sets of numbers, in each of which six numbers. Of course, the numbers in each numeric set can be repeated (such sets are called multisets).  Can we say that there is an isometry of...

Having read the above I decided to try it on a substitution problem I had last year on a set of equations. Work sheet containe an example. I successifuly applied algsubs to the problem. It can be slow and their is no easy way I see to know when the substitution is complete. so what I did go round the loop 2, 3, 4, 5 times. Crude!

Decided to try "side relations" with simplify here but it comes out with a totally different answer (not correct).

Could somebody explain why?