MaplePrimes Questions

Hey guys,

I have to solve a bunch of systems of polynomial equations und dome restrictions given by inequalitites. I have 8 variables, 8 equations and and 13 inequalitites. Since the simple solve or SemiAlgebraic command are not able to solve every system I tryd some other ways. Right now I try to bring the set of equations and ineqaulities in a better from or structure using RealTriangulize from the RegularChains library. Later on I want to take those results and use solve or SemiAlgebraic again, hoping, that Maple than finds the solutions and is not calculating for houres without a result. I already know, that you can have diffrent outputs for RealTriangularize (I know list, record, piecewise and zerodimensional, althought the last one is not really helpful). Since I want to go on wirking with the results I need to have them in a form, that I can read of the new equations and inequalities to put them into solve. Often that works totaly fine, but sometimes I get an output I dont understand. I understand what It means but I dont understand why Maple uses that type of output. If you have a look in the attached file you can see what I mean:

restart; with(RegularChains); eq_5334 := {y*(m*x-m-n+1)+(-x+1)*n-x = 0, (-p+t)*k+p*y-t = 0, (k-x-y)*t-k*p+y = 0, (-x-y+1)*t+(-k+y)*n+x*s = 0, (-x-y+1)*p+m*y^2+x-y = 0, (x^2-x)*m+y*(t-1)-n+1 = 0, -k*n+s*x = 0, m*x*y-p = 0, 0 < k, 0 < m, 0 < s, 0 < x, 0 < y, 0 < n+(t-1)*p, 0 < (m*y-1)*n+(1-p)*(m*x-m+1), 0 < (m*x-m-t+1)*p+m*y*(t-n), 1 < x+y, k < 1, m < 1, s < t, t < 1}; eq_5380 := {(-x-y+1)*p+m*x*y = 0, (-p+t)*k+p*y-t = 0, (k-x-y)*t-k*p+y = 0, (-x-y+1)*t+(-k+y)*n+x*s = 0, (m-1)*y^2+(-x+1)*y-p+x = 0, (x-1)*(m-1)*y-x^2-n+x = 0, m*x^2+(-m-n+1)*x+(-y+1)*n+t*y-1 = 0, -k*n+s*x = 0, 0 < k, 0 < m, 0 < s, 0 < x, 0 < y, 0 < n+(t-1)*p, 0 < (m*y-1)*n+(1-p)*(m*x-m+1), 0 < (m*x-m-t+1)*p+m*y*(t-n), 1 < x+y, k < 1, m < 1, s < t, t < 1}; eq_5382 := {(-x-y+1)*p+m*x*y = 0, y*(m*x-m-n+1)+(-x+1)*n-x = 0, (-p+t)*k+p*y-t = 0, (k-x-y)*t-k*p+y = 0, (-x-y+1)*t+(-k+y)*n+x*s = 0, (-x-y+1)*p+m*y^2+x-y = 0, m*x^2+(-m-n+1)*x+(-y+1)*n+t*y-1 = 0, -k*n+s*x = 0, 0 < k, 0 < m, 0 < s, 0 < x, 0 < y, 0 < n+(t-1)*p, 0 < (m*y-1)*n+(1-p)*(m*x-m+1), 0 < (m*x-m-t+1)*p+m*y*(t-n), 1 < x+y, k < 1, m < 1, s < t, t < 1}; sys := eq_5334; SuggestVariableOrder(sys); R := PolynomialRing(%); dec_5334 := RealTriangularize(sys, R, output = piecewise); sys := eq_5380; SuggestVariableOrder(sys); R := PolynomialRing(%); dec_5380 := RealTriangularize(sys, R, output = piecewise); sys := eq_5382; SuggestVariableOrder(sys); R := PolynomialRing(%); dec_5382 := RealTriangularize(sys, R, output = piecewise); sys := eq_5382; SuggestVariableOrder(sys); R := PolynomialRing(%); dec_5382_record := RealTriangularize(sys, R, output = record)

[AlgebraicGeometryTools, ChainTools, ConstructibleSetTools, Display, DisplayPolynomialRing, Equations, ExtendedRegularGcd, FastArithmeticTools, Inequations, Info, Initial, Intersect, Inverse, IsRegular, LazyRealTriangularize, MainDegree, MainVariable, MatrixCombine, MatrixTools, NormalForm, ParametricSystemTools, PolynomialRing, Rank, RealTriangularize, RegularGcd, RegularizeInitial, SamplePoints, SemiAlgebraicSetTools, Separant, SparsePseudoRemainder, SuggestVariableOrder, Tail, Triangularize]

 

[s, k, n, p, m, t, x, y]

 

R := polynomial_ring

 

dec_5334 := [[x*s+((-x^2+x)*m-t*y+y-1)*k = 0, (m*x*y-t)*k+(x+y)*t-y = 0, n+(-x^2+x)*m-t*y+y-1 = 0, -m*x*y+p = 0, (x^2*y+(y^2-y)*x-y^2)*m-x+y = 0, t*y^2-y^2+x = 0, (15*y^2+24*y+20)*x-6*y^2-13*y-10 = 0, y^3-y-2 = 0, 0 < k, 0 < m, 0 < s, 0 < x, 0 < y, 0 < 12891634966*y^2+19613071879*y+16947294542, 0 < 1256597*y^2+1911761*y+1651926, 0 < 6310892468*y^2+9601263717*y+8296275330, 0 < 1401*y^2+2130*y+1840, 0 < 1-k, 0 < 1-m, 0 < 72927541996846438*y^2+110950482461140595*y+95870270479707846, 0 < 1-t]]

 

[s, k, n, p, m, t, y, x]

 

R := polynomial_ring

 

dec_5380 := piecewise(`and`(`and`(`and`(0 < x^3-2*x^2+3*x-1, 0 < x^3+2*x^2+x-1), x^3+x^2+x < 1), 0 < 3*x-1), [[s*x+((1-x)*y*m+(x-1)*y+x^2-x)*k = 0, (m*y^2-y^2-t+(1-x)*y+x)*k+(y+x)*t-y = 0, n+(1-x)*y*m+(x-1)*y+x^2-x = 0, p-m*y^2+y^2+(x-1)*y-x = 0, m*y-x-y+1 = 0, t*y^2+(x-1)*y^2+(2*x^2-2*x)*y+x^3-2*x^2+x = 0, (3*x-1)*y^2+(3*x^2-3*x)*y+x^3-2*x^2+x = 0, 0 < k, 0 < m, 0 < s, 0 < y, 0 < -6*x^6-9*x^5*y+20*x^5+27*x^4*y-27*x^4-32*x^3*y+19*x^3+17*x^2*y-7*x^2-3*x*y+x, 0 < 3*x^6+3*x^5*y-14*x^5-10*x^4*y+26*x^4+11*x^3*y-24*x^3-3*x^2*y+11*x^2-2*x*y-2*x+y, 0 < 6*x^5+9*x^4*y-17*x^4-18*x^3*y+17*x^3+11*x^2*y-7*x^2-2*x*y+x, 0 < y+x-1, 0 < 1-k, 0 < -m+1, 0 < t-s, 0 < 1-t]], [])

 

[s, k, n, p, m, t, x, y]

 

R := polynomial_ring

 

dec_5382 := piecewise(`and`(`and`(y^3-2*y^2+y < 1, 0 < y-1), 23*y^3-37*y^2+13*y-3 <> 0), [[-k*n+s*x = 0, (p-t)*k+(y+x)*t-y = 0, (y+x-1)*n+(-x*y+y)*m+x-y = 0, (y+x-1)*p-m*y^2-x+y = 0, m*y-1 = 0, t*y^2+x^2+(y-1)*x-y^2 = 0, x^3+(3*y-2)*x^2+(2*y^2-3*y+1)*x-y^3+y^2 = 0, 0 < k, 0 < s, 0 < x, 0 < -2*x^2*y^2-2*x*y^3+2*y^4+x^2*y+3*x*y^2-3*y^3-x*y+y^2, 0 < x^2*y^2+2*x*y^3+y^4-x^2*y-4*x*y^2-3*y^3+2*x*y+3*y^2-y, 0 < -x^2*y-x*y^2+y^3+x*y-y^2, 0 < y+x-1, 0 < 1-k, 0 < t-s, 0 < 1-t]], 23*y^3-37*y^2+13*y-3 = 0, [[-k*n+s*x = 0, (p-t)*k+(y+x)*t-y = 0, (y+x-1)*n+(-x*y+y)*m+x-y = 0, (y+x-1)*p-m*y^2-x+y = 0, m*y-1 = 0, t*y^2+x^2+(y-1)*x-y^2 = 0, (2377326*y^2-1587000*y+302588)*x^2+(390793*y^2+497766*y+138115)*x-507805*y^2+152032*y-109047 = 0, 23*y^3-37*y^2+13*y-3 = 0, 0 < k, 0 < m, 0 < s, 0 < x, 0 < y, 0 < 700112222844255556263586865*x*y^2-260269572171898884295316974*x*y-93795749047261033657544191*y^2+73822886321394794237709987*x+34866975665513154551125606*y-9877974587657378842117575, 0 < -26166721441919*x*y^2+9412709182291*x*y+53422638514257*y^2-3387596446782*x-21180373503698*y+6484087812711, 0 < 21236600258115*x*y^2-8079468597142*x*y-3053799376681*y^2+2340822678357*x+1387037467490*y-370794765921, 0 < y+x-1, 0 < 1-k, 0 < -m+1, 0 < t-s, 0 < 1-t]], [])

 

[s, k, n, p, m, t, x, y]

 

R := polynomial_ring

 

`Non-fatal error while reading data from kernel.`

(1)

NULL

I would like to get results like in dec_5334. I can easily go on working with this kind of form. In dec_5380 you can see a diffrent output. I dont see the point of giving me this output. the second line i basically epmty. and in the first line the solution is broken into peaces. when a certain solution just works under some inequalitites, why dont they put those four inequalities inside of the list in front of it? Is there a workaround for the "normal" output? Or is there a way to read off the lines from this kind of structure, with the open { in front ?

The same problem appears in dec_5382. WHy dont give me a list with to lists of equations and inequalities to show me both solutions?
In the last example dec_5382_record you can see the output when you change the corresponding option in RealTrinagularize. But here I again have the problem that I dont know how to read of the equations and inequalities from the open curly bracket.

If anyone could help me, I would be very glad. Thank yu in advance.

Regards

Felix

Download Output_of_RegularChains.mw


Does any one have any idea to demonstrate, using Maple, that for any couple (a, b) of strictly positive integers

(a*b)! / (a! * (b!)^a) 

is an integer?

Hi

Can someone improve my AI code so I get to the final team's config directly, rather than a series of set iterations? thanks 

teams.mw

set 1: Michael K, Andy C
set 2: Michael G, Mitch
set 3: Jez, Dean B
set 4: Anthony B, Rik B
set 5: Ilya, Fariborz
set 6: Eugene, Tania
set 7: Bill, Stevs
set 8: Victor, Jane
set 9: Nash, Ben
 

Why doesnt this example work in my Maple 2021.1 from the user manual?

restart;
L := [seq(i, i = 2 .. 1000)];
divisor := 2;
while (numelems(L) > 0)  do  divisable,  L:=selectremove(i->(i mod divisor=0), L):
Error, unterminated loop

n:=numelems(divisable);  

if (n>0) then  printf("%d integers%s whose smallest prime divisor is %d\\n",n,  'if'(n>1, "s", ""), divisor):  end if;  

divisor :=nextprime(divisor);  

end do:
Error, unable to parse
 

Is there a way to put in intervals and get the output as inequality Notation? Something like this ->

I have a system of 4 nonlinear equations in 4 lambda variables. I cannot obtain a solution using solve():

4_nonlinear_equations.mw

I can sometimes simplify similar systems by rescaling equations to reduce parameters. With only 3 parameters (sigma_v, sigma_d, sigma_d3) in this case, complexity arises from the interactions of the 4 lambdas in the 4 equations. Upon examining the equations (highlighted in yellow), I suspect hidden symmetries. Is it possible to solve the system by rewriting the equations in terms of each other to find an equivalent system? I am exploring if a smarter and simpler reformulation could lead to a solution. Thank you.

I am very frustrated with the geometry package.
I wanted to draw a circle thru 3 points and so I opened the geometry package help pages.
> restart;
> with(geometry);
> with(plots);

Here is the example given there
> circle(c1, [point(A, 0, 0), point(B, 2, 0), point(C, 1, 2)], 'centername' = O1)

As you can see the command uses the point command from the geometry package which is

> point(C, 1, 2)

Maple consistently uses := as the assignment operator. Not with this command. One would expect the syntax to be

>C:=point([-1. 2]);

or some such but no, that is not how it works.Notice that I am not alone in my opinion about this being a violation of standard Maple syntax; the Maple parser AGREES with me

> type(point(C,1,-3),point);
                             false

Perhaps I am just being grouchy but pointplot works fine with
> pointplot([[1, 3],[1.7, 2],[-1, 7]])

But
> pointplot([P1,P2,P3]);
Error, (in plots:-pointplot) number of elements in list must be a multiple of 2

Oh well, let’s see what we get with our circle construction
>display(c1);

Error, (in plots:-display) expecting plot structure but received: c1

Bad guess on my part.

> radius (c1)
yields the correct number and
> center(c1)
yields the name of the circle but
>coordinates(center_c1);
yields what I want. Peculiar but OK , let's go on.
I can write the equation of the circle now that I have the center and radius but hopefully I try

>  equation(c1); and get an error message!!!

The commands center, radius work but equation does not! Here is what works
> Equation(c1)

If one really wants to CONFUSE the user why not eQuaTiOn? Who would guess that? (Sorry to be sarcastic but …) At least with the equation and implicit plot one can finally get a plot of the circle. Is that CLUMSY?

sometimes I need to check if an ode is missing y(x) or not. Since diff(y(x),x) has y(x) in it, then can not just check if the ode has y(x) or not as is, as this will always gives true if diffy(y(x),x) is there of any order.

Currently what I do, is change all y',y'',y''', etc... to Z,Z^2,Z^3,etc... and then after that it is safe to check if y(x) exist or not.

Is there a better way to do this? Below is what I currently do and it works. Just wondering if there could a more elgent way to do this.

restart;

interface(version);

`Standard Worksheet Interface, Maple 2024.2, Windows 10, October 29 2024 Build ID 1872373`

ode:=y(x)*diff(y(x),x$2)^2+diff(y(x),x$3)+y(x)*sqrt(diff(y(x),x))+3*x+3=1/(x*y(x)*diff(y(x),x$5));
ode_order := Student:-ODEs:-DifferentialOrder(ode,y(x)):
ode:=convert(ode,D):
for N from 1 to ode_order do
    ode:=eval(ode,[(D@@N)(y)(x)=Z^N]);
od:
ode

y(x)*(diff(diff(y(x), x), x))^2+diff(diff(diff(y(x), x), x), x)+y(x)*(diff(y(x), x))^(1/2)+3*x+3 = 1/(x*y(x)*(diff(diff(diff(diff(diff(y(x), x), x), x), x), x)))

y(x)*Z^4+Z^3+y(x)*Z^(1/2)+3*x+3 = 1/(x*y(x)*Z^5)

has(ode,y(x))

true

 

 

Download find_if_any_ode_has_yx_jan_6_2025.mw

I can do that for a cylinder (in green below) but not for a box geometry.

Box_geometry_and_pendulum.msim

 

intersections := proc(P, Q, T)
local R, W, w, t, a, b, sol, buff, v;
sol := []; if T = Y then W := X; else W := Y; end if;
R := resultant(P, Q, T);
print(`Résultant :`);
print(R);
w := fsolve(R, W); t := [];
for v in [w] do t := [op(t), fsolve(subs(W = v, P), T)]; end do;
for a in [w] do for b in [t] do if T = Y then buff := abs(subs(X = a, Y = b, P)) + abs(subs(X = a, Y = b, Q));
printf(`X=%a,   Y=%a   --->  %a\\n`, a, b, buff); if buff < 1/100000000 then sol := [op(sol), [a, b]]; end if;
else buff := abs(subs(X = b, Y = a, P)) + abs(subs(X = b, Y = a, Q));
printf(`X=%a,   Y=%a   --->  %a\\n`, b, a, buff); if buff < 1/100000000 then sol := [op(sol), [b, a]];
end if; end if; end do; end do;
printf(`Nombre de solutions :  %a\\n`, nops(sol)); print(sol); end proc;
Try with :
intersections(X^2 + Y^2 - 1, X - Y, X); Would you like to develop this procedure which does not give the number of solutions ?Thank you.

i want to factoring the (m+G'/G) in my long equation but i use some trick but still i can't get the exactly system and still G will remain in my system what should i factoring for remove this G(xi) from my system is all about factoring , my system of equation are wrong contain G(xi) How i can remove it by taking a factoring or any other technique,

not parameter is arbitrary except V and sigma''

restart

with(PDEtools)

with(LinearAlgebra)

with(Physics)

with(SolveTools)

undeclare(prime)

`There is no more prime differentiation variable; all derivatives will be displayed as indexed functions`

(1)

_local(gamma)

Warning, A new binding for the name `gamma` has been created. The global instance of this name is still accessible using the :- prefix, :-`gamma`.  See ?protect for details.

 

declare(Omega(x, t)); declare(U(xi)); declare(u(x, y, z, t)); declare(Q(xi)); declare(V(xi))

Omega(x, t)*`will now be displayed as`*Omega

 

U(xi)*`will now be displayed as`*U

 

u(x, y, z, t)*`will now be displayed as`*u

 

Q(xi)*`will now be displayed as`*Q

 

V(xi)*`will now be displayed as`*V

(2)

NULL

ode := (-V*a[2]+a[1])*(diff(diff(U(xi), xi), xi))+U(xi)*(((-gamma+sigma)*k+b)*U(xi)^2-a[1]*k^2+(w*a[2]-alpha)*k-w) = 0

(-V*a[2]+a[1])*(diff(diff(U(xi), xi), xi))+U(xi)*(((-gamma+sigma)*k+b)*U(xi)^2-a[1]*k^2+(w*a[2]-alpha)*k-w) = 0

(3)

F := sum(e[i]*(m+(diff(G(xi), xi))/G(xi))^i, i = -1 .. 1)

e[-1]/(m+(diff(G(xi), xi))/G(xi))+e[0]+e[1]*(m+(diff(G(xi), xi))/G(xi))

(4)

D1 := diff(F, xi)

-e[-1]*((diff(diff(G(xi), xi), xi))/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)/(m+(diff(G(xi), xi))/G(xi))^2+e[1]*((diff(diff(G(xi), xi), xi))/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)

(5)

NULL

S := diff(G(xi), `$`(xi, 2)) = -(2*m*mu+lambda)*(diff(G(xi), xi))-mu

diff(diff(G(xi), xi), xi) = -(2*m*mu+lambda)*(diff(G(xi), xi))-mu

(6)

E1 := subs(S, D1)

-e[-1]*((-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)/(m+(diff(G(xi), xi))/G(xi))^2+e[1]*((-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)

(7)

D2 := diff(E1, xi)

2*e[-1]*((-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)*((diff(diff(G(xi), xi), xi))/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)/(m+(diff(G(xi), xi))/G(xi))^3-e[-1]*(-(2*m*mu+lambda)*(diff(diff(G(xi), xi), xi))/G(xi)-(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))/G(xi)^2-2*(diff(G(xi), xi))*(diff(diff(G(xi), xi), xi))/G(xi)^2+2*(diff(G(xi), xi))^3/G(xi)^3)/(m+(diff(G(xi), xi))/G(xi))^2+e[1]*(-(2*m*mu+lambda)*(diff(diff(G(xi), xi), xi))/G(xi)-(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))/G(xi)^2-2*(diff(G(xi), xi))*(diff(diff(G(xi), xi), xi))/G(xi)^2+2*(diff(G(xi), xi))^3/G(xi)^3)

(8)

E2 := subs(S, D2)

2*e[-1]*((-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)^2/(m+(diff(G(xi), xi))/G(xi))^3-e[-1]*(-(2*m*mu+lambda)*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-3*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))/G(xi)^2+2*(diff(G(xi), xi))^3/G(xi)^3)/(m+(diff(G(xi), xi))/G(xi))^2+e[1]*(-(2*m*mu+lambda)*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-3*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))/G(xi)^2+2*(diff(G(xi), xi))^3/G(xi)^3)

(9)

D3 := diff(E2, xi)

-6*e[-1]*((-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)^2*((diff(diff(G(xi), xi), xi))/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)/(m+(diff(G(xi), xi))/G(xi))^4+4*e[-1]*((-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)*(-(2*m*mu+lambda)*(diff(diff(G(xi), xi), xi))/G(xi)-(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))/G(xi)^2-2*(diff(G(xi), xi))*(diff(diff(G(xi), xi), xi))/G(xi)^2+2*(diff(G(xi), xi))^3/G(xi)^3)/(m+(diff(G(xi), xi))/G(xi))^3+2*e[-1]*(-(2*m*mu+lambda)*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-3*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))/G(xi)^2+2*(diff(G(xi), xi))^3/G(xi)^3)*((diff(diff(G(xi), xi), xi))/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)/(m+(diff(G(xi), xi))/G(xi))^3-e[-1]*((2*m*mu+lambda)^2*(diff(diff(G(xi), xi), xi))/G(xi)+(2*m*mu+lambda)*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))/G(xi)^2+3*(2*m*mu+lambda)*(diff(diff(G(xi), xi), xi))*(diff(G(xi), xi))/G(xi)^2+6*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))^2/G(xi)^3-3*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(diff(G(xi), xi), xi))/G(xi)^2+6*(diff(G(xi), xi))^2*(diff(diff(G(xi), xi), xi))/G(xi)^3-6*(diff(G(xi), xi))^4/G(xi)^4)/(m+(diff(G(xi), xi))/G(xi))^2+e[1]*((2*m*mu+lambda)^2*(diff(diff(G(xi), xi), xi))/G(xi)+(2*m*mu+lambda)*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))/G(xi)^2+3*(2*m*mu+lambda)*(diff(diff(G(xi), xi), xi))*(diff(G(xi), xi))/G(xi)^2+6*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))^2/G(xi)^3-3*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(diff(G(xi), xi), xi))/G(xi)^2+6*(diff(G(xi), xi))^2*(diff(diff(G(xi), xi), xi))/G(xi)^3-6*(diff(G(xi), xi))^4/G(xi)^4)

(10)

E3 := subs(S, D3)

-6*e[-1]*((-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)^3/(m+(diff(G(xi), xi))/G(xi))^4+6*e[-1]*((-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)*(-(2*m*mu+lambda)*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-3*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))/G(xi)^2+2*(diff(G(xi), xi))^3/G(xi)^3)/(m+(diff(G(xi), xi))/G(xi))^3-e[-1]*((2*m*mu+lambda)^2*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)+4*(2*m*mu+lambda)*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))/G(xi)^2+12*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))^2/G(xi)^3-3*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)^2/G(xi)^2-6*(diff(G(xi), xi))^4/G(xi)^4)/(m+(diff(G(xi), xi))/G(xi))^2+e[1]*((2*m*mu+lambda)^2*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)+4*(2*m*mu+lambda)*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))/G(xi)^2+12*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))^2/G(xi)^3-3*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)^2/G(xi)^2-6*(diff(G(xi), xi))^4/G(xi)^4)

(11)

NULL

NULL

K := U(xi) = F

K1 := diff(U(xi), xi) = E1

K2 := diff(U(xi), `$`(xi, 2)) = E2

K3 := diff(U(xi), `$`(xi, 3)) = E3

NULL

L := eval(ode, {K, K1, K2, K3})

(-V*a[2]+a[1])*(2*e[-1]*((-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-(diff(G(xi), xi))^2/G(xi)^2)^2/(m+(diff(G(xi), xi))/G(xi))^3-e[-1]*(-(2*m*mu+lambda)*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-3*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))/G(xi)^2+2*(diff(G(xi), xi))^3/G(xi)^3)/(m+(diff(G(xi), xi))/G(xi))^2+e[1]*(-(2*m*mu+lambda)*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)/G(xi)-3*(-(2*m*mu+lambda)*(diff(G(xi), xi))-mu)*(diff(G(xi), xi))/G(xi)^2+2*(diff(G(xi), xi))^3/G(xi)^3))+(e[-1]/(m+(diff(G(xi), xi))/G(xi))+e[0]+e[1]*(m+(diff(G(xi), xi))/G(xi)))*(((-gamma+sigma)*k+b)*(e[-1]/(m+(diff(G(xi), xi))/G(xi))+e[0]+e[1]*(m+(diff(G(xi), xi))/G(xi)))^2-a[1]*k^2+(w*a[2]-alpha)*k-w) = 0

(12)

NULL

# rewritting rule

RR := isolate(m+diff(G(xi), xi)/(G(xi))=Phi, diff(G(xi), xi)/G(xi));

(diff(G(xi), xi))/G(xi) = Phi-m

(13)

# Apply RR and collect wrt Phi

subs(RR, L):
normal(%):
PhiN := collect(numer(lhs(%)), phi):
PhiD := denom(lhs(%%));

Phi^3*G(xi)^4

(14)



with(LargeExpressions):

LLE := collect(PhiN, Phi, Veil[phi] ):
LLE / PhiD = 0;

(Phi^6*phi[1]+3*Phi^5*phi[2]-Phi^4*phi[3]-Phi^3*phi[4]-Phi^2*phi[5]+Phi*phi[6]-phi[7])/(Phi^3*G(xi)^4) = 0

(15)

# phi[i] coefficients


phis := [ seq( phi[i] = simplify(Unveil[phi](phi[i]), size), i=1..LastUsed[phi] ) ]:

print~( phis ):

phi[1] = G(xi)^4*e[1]^3*((-gamma+sigma)*k+b)

 

phi[2] = e[1]^2*G(xi)^4*e[0]*((-gamma+sigma)*k+b)

 

phi[3] = -3*e[1]*G(xi)^4*(-(1/3)*a[1]*k^2+(-e[-1]*(gamma-sigma)*e[1]+(-gamma+sigma)*e[0]^2+(1/3)*w*a[2]-(1/3)*alpha)*k+b*e[-1]*e[1]+b*e[0]^2-(1/3)*w)

 

phi[4] = (2*e[1]*(V*a[2]-a[1])*(diff(G(xi), xi))^3+3*e[1]*G(xi)*(2*m*mu+lambda)*(V*a[2]-a[1])*(diff(G(xi), xi))^2+e[1]*(V*a[2]-a[1])*G(xi)*((2*m*mu+lambda)^2*G(xi)+3*mu)*(diff(G(xi), xi))+G(xi)^2*(-(6*e[-1]*((-gamma+sigma)*k+b)*e[1]-a[1]*k^2+k*w*a[2]+((-gamma+sigma)*k+b)*e[0]^2-k*alpha-w)*e[0]*G(xi)+e[1]*mu*(2*m*mu+lambda)*(V*a[2]-a[1])))*G(xi)

 

phi[5] = -3*e[-1]*G(xi)^4*(-(1/3)*a[1]*k^2+(-e[-1]*(gamma-sigma)*e[1]+(-gamma+sigma)*e[0]^2+(1/3)*w*a[2]-(1/3)*alpha)*k+b*e[-1]*e[1]+b*e[0]^2-(1/3)*w)

 

phi[6] = 4*((1/2)*(V*a[2]-a[1])*(diff(G(xi), xi))^3+(3/2)*(V*a[2]-a[1])*(m*mu+(1/2)*lambda)*G(xi)*(diff(G(xi), xi))^2+(V*a[2]-a[1])*((m*mu+(1/2)*lambda)^2*G(xi)+(3/4)*mu)*G(xi)*(diff(G(xi), xi))+(1/2)*((3/2)*e[0]*((-gamma+sigma)*k+b)*e[-1]*G(xi)+(V*a[2]-a[1])*(m*mu+(1/2)*lambda)*mu)*G(xi)^2)*e[-1]*G(xi)

 

phi[7] = 8*e[-1]*((1/4)*(V*a[2]-a[1])*(diff(G(xi), xi))^4+(V*a[2]-a[1])*(m*mu+(1/2)*lambda)*G(xi)*(diff(G(xi), xi))^3+(V*a[2]-a[1])*((m*mu+(1/2)*lambda)^2*G(xi)+(1/2)*mu)*G(xi)*(diff(G(xi), xi))^2+(V*a[2]-a[1])*(m*mu+(1/2)*lambda)*mu*G(xi)^2*(diff(G(xi), xi))+(1/4)*(-(1/2)*((-gamma+sigma)*k+b)*e[-1]^2*G(xi)^2+mu^2*(V*a[2]-a[1]))*G(xi)^2)

(16)

# WATCHOUT: you have 9 coefficients and so its desirable to have the same number of unknowns

unknowns := indets(rhs~(phis), {e[-1],e[0],e[1],'identical'(mu),'identical'(lambda),'identical'(a[1]),'identical'(alpha)});

COEFFS := solve(rhs~(phis), unknowns)

{alpha, lambda, mu, a[1], e[-1], e[0], e[1]}

 

{alpha = alpha, lambda = lambda, mu = mu, a[1] = a[1], e[-1] = 0, e[0] = 0, e[1] = 0}, {alpha = alpha, lambda = lambda, mu = mu, a[1] = -(gamma*k*e[0]^2-k*sigma*e[0]^2-b*e[0]^2-k*w*a[2]+alpha*k+w)/k^2, e[-1] = 0, e[0] = e[0], e[1] = 0}, {alpha = (1/2)*(-G(xi)^4*gamma*k^3*e[-1]^2+G(xi)^4*k^3*sigma*e[-1]^2-4*G(xi)^2*(diff(G(xi), xi))*V*k^2*m*mu^2*a[2]+4*G(xi)*(diff(G(xi), xi))^3*V*k^2*m*mu*a[2]+G(xi)^4*b*k^2*e[-1]^2+4*G(xi)^2*(diff(G(xi), xi))*k*m*mu^2*w*a[2]-4*G(xi)*(diff(G(xi), xi))^3*k*m*mu*w*a[2]-2*G(xi)^2*V*k^2*mu^2*a[2]+2*G(xi)*(diff(G(xi), xi))^2*V*k^2*mu*a[2]-2*G(xi)*(diff(G(xi), xi))*RootOf(4*m^2*mu^2*(diff(G(xi), xi))*G(xi)^2+2*m*mu^2*G(xi)^2+6*m*mu*(diff(G(xi), xi))^2*G(xi)+3*mu*(diff(G(xi), xi))*G(xi)+2*(diff(G(xi), xi))^3+(4*m*mu*(diff(G(xi), xi))*G(xi)+mu*G(xi)+3*(diff(G(xi), xi))^2)*_Z+(diff(G(xi), xi))*_Z^2)*V*k^2*mu*a[2]+2*(diff(G(xi), xi))^4*V*k^2*a[2]+2*(diff(G(xi), xi))^3*RootOf(4*m^2*mu^2*(diff(G(xi), xi))*G(xi)^2+2*m*mu^2*G(xi)^2+6*m*mu*(diff(G(xi), xi))^2*G(xi)+3*mu*(diff(G(xi), xi))*G(xi)+2*(diff(G(xi), xi))^3+(4*m*mu*(diff(G(xi), xi))*G(xi)+mu*G(xi)+3*(diff(G(xi), xi))^2)*_Z+(diff(G(xi), xi))*_Z^2)*V*k^2*a[2]-4*G(xi)^2*(diff(G(xi), xi))*m*mu^2*w+2*G(xi)^2*k*mu^2*w*a[2]+4*G(xi)*(diff(G(xi), xi))^3*m*mu*w-2*G(xi)*(diff(G(xi), xi))^2*k*mu*w*a[2]+2*G(xi)*(diff(G(xi), xi))*RootOf(4*m^2*mu^2*(diff(G(xi), xi))*G(xi)^2+2*m*mu^2*G(xi)^2+6*m*mu*(diff(G(xi), xi))^2*G(xi)+3*mu*(diff(G(xi), xi))*G(xi)+2*(diff(G(xi), xi))^3+(4*m*mu*(diff(G(xi), xi))*G(xi)+mu*G(xi)+3*(diff(G(xi), xi))^2)*_Z+(diff(G(xi), xi))*_Z^2)*k*mu*w*a[2]-2*(diff(G(xi), xi))^4*k*w*a[2]-2*(diff(G(xi), xi))^3*RootOf(4*m^2*mu^2*(diff(G(xi), xi))*G(xi)^2+2*m*mu^2*G(xi)^2+6*m*mu*(diff(G(xi), xi))^2*G(xi)+3*mu*(diff(G(xi), xi))*G(xi)+2*(diff(G(xi), xi))^3+(4*m*mu*(diff(G(xi), xi))*G(xi)+mu*G(xi)+3*(diff(G(xi), xi))^2)*_Z+(diff(G(xi), xi))*_Z^2)*k*w*a[2]-2*G(xi)^2*mu^2*w+2*G(xi)*(diff(G(xi), xi))^2*mu*w-2*G(xi)*(diff(G(xi), xi))*RootOf(4*m^2*mu^2*(diff(G(xi), xi))*G(xi)^2+2*m*mu^2*G(xi)^2+6*m*mu*(diff(G(xi), xi))^2*G(xi)+3*mu*(diff(G(xi), xi))*G(xi)+2*(diff(G(xi), xi))^3+(4*m*mu*(diff(G(xi), xi))*G(xi)+mu*G(xi)+3*(diff(G(xi), xi))^2)*_Z+(diff(G(xi), xi))*_Z^2)*mu*w+2*(diff(G(xi), xi))^4*w+2*(diff(G(xi), xi))^3*RootOf(4*m^2*mu^2*(diff(G(xi), xi))*G(xi)^2+2*m*mu^2*G(xi)^2+6*m*mu*(diff(G(xi), xi))^2*G(xi)+3*mu*(diff(G(xi), xi))*G(xi)+2*(diff(G(xi), xi))^3+(4*m*mu*(diff(G(xi), xi))*G(xi)+mu*G(xi)+3*(diff(G(xi), xi))^2)*_Z+(diff(G(xi), xi))*_Z^2)*w)/((2*m*mu^2*(diff(G(xi), xi))*G(xi)^2-2*m*mu*(diff(G(xi), xi))^3*G(xi)+mu*(diff(G(xi), xi))*G(xi)*RootOf(4*m^2*mu^2*(diff(G(xi), xi))*G(xi)^2+2*m*mu^2*G(xi)^2+6*m*mu*(diff(G(xi), xi))^2*G(xi)+3*mu*(diff(G(xi), xi))*G(xi)+2*(diff(G(xi), xi))^3+(4*m*mu*(diff(G(xi), xi))*G(xi)+mu*G(xi)+3*(diff(G(xi), xi))^2)*_Z+(diff(G(xi), xi))*_Z^2)-(diff(G(xi), xi))^3*RootOf(4*m^2*mu^2*(diff(G(xi), xi))*G(xi)^2+2*m*mu^2*G(xi)^2+6*m*mu*(diff(G(xi), xi))^2*G(xi)+3*mu*(diff(G(xi), xi))*G(xi)+2*(diff(G(xi), xi))^3+(4*m*mu*(diff(G(xi), xi))*G(xi)+mu*G(xi)+3*(diff(G(xi), xi))^2)*_Z+(diff(G(xi), xi))*_Z^2)+mu^2*G(xi)^2-mu*(diff(G(xi), xi))^2*G(xi)-(diff(G(xi), xi))^4)*k), lambda = RootOf(4*m^2*mu^2*(diff(G(xi), xi))*G(xi)^2+2*m*mu^2*G(xi)^2+6*m*mu*(diff(G(xi), xi))^2*G(xi)+3*mu*(diff(G(xi), xi))*G(xi)+2*(diff(G(xi), xi))^3+(4*m*mu*(diff(G(xi), xi))*G(xi)+mu*G(xi)+3*(diff(G(xi), xi))^2)*_Z+(diff(G(xi), xi))*_Z^2)/G(xi), mu = mu, a[1] = -(1/2)*(-G(xi)^4*gamma*k*e[-1]^2+G(xi)^4*k*sigma*e[-1]^2-4*G(xi)^2*(diff(G(xi), xi))*V*m*mu^2*a[2]+4*G(xi)*(diff(G(xi), xi))^3*V*m*mu*a[2]+G(xi)^4*b*e[-1]^2-2*G(xi)^2*V*mu^2*a[2]+2*G(xi)*(diff(G(xi), xi))^2*V*mu*a[2]-2*mu*G(xi)*(diff(G(xi), xi))*V*RootOf(4*m^2*mu^2*(diff(G(xi), xi))*G(xi)^2+2*m*mu^2*G(xi)^2+6*m*mu*(diff(G(xi), xi))^2*G(xi)+3*mu*(diff(G(xi), xi))*G(xi)+2*(diff(G(xi), xi))^3+(4*m*mu*(diff(G(xi), xi))*G(xi)+mu*G(xi)+3*(diff(G(xi), xi))^2)*_Z+(diff(G(xi), xi))*_Z^2)*a[2]+2*(diff(G(xi), xi))^4*V*a[2]+2*(diff(G(xi), xi))^3*V*RootOf(4*m^2*mu^2*(diff(G(xi), xi))*G(xi)^2+2*m*mu^2*G(xi)^2+6*m*mu*(diff(G(xi), xi))^2*G(xi)+3*mu*(diff(G(xi), xi))*G(xi)+2*(diff(G(xi), xi))^3+(4*m*mu*(diff(G(xi), xi))*G(xi)+mu*G(xi)+3*(diff(G(xi), xi))^2)*_Z+(diff(G(xi), xi))*_Z^2)*a[2])/(2*m*mu^2*(diff(G(xi), xi))*G(xi)^2-2*m*mu*(diff(G(xi), xi))^3*G(xi)+mu*(diff(G(xi), xi))*G(xi)*RootOf(4*m^2*mu^2*(diff(G(xi), xi))*G(xi)^2+2*m*mu^2*G(xi)^2+6*m*mu*(diff(G(xi), xi))^2*G(xi)+3*mu*(diff(G(xi), xi))*G(xi)+2*(diff(G(xi), xi))^3+(4*m*mu*(diff(G(xi), xi))*G(xi)+mu*G(xi)+3*(diff(G(xi), xi))^2)*_Z+(diff(G(xi), xi))*_Z^2)-(diff(G(xi), xi))^3*RootOf(4*m^2*mu^2*(diff(G(xi), xi))*G(xi)^2+2*m*mu^2*G(xi)^2+6*m*mu*(diff(G(xi), xi))^2*G(xi)+3*mu*(diff(G(xi), xi))*G(xi)+2*(diff(G(xi), xi))^3+(4*m*mu*(diff(G(xi), xi))*G(xi)+mu*G(xi)+3*(diff(G(xi), xi))^2)*_Z+(diff(G(xi), xi))*_Z^2)+mu^2*G(xi)^2-mu*(diff(G(xi), xi))^2*G(xi)-(diff(G(xi), xi))^4), e[-1] = e[-1], e[0] = 0, e[1] = 0}

(17)

case1 := COEFFS[2]

{alpha = alpha, lambda = lambda, mu = mu, a[1] = -(gamma*k*e[0]^2-k*sigma*e[0]^2-b*e[0]^2-k*w*a[2]+alpha*k+w)/k^2, e[-1] = 0, e[0] = e[0], e[1] = 0}

(18)

NULL

F1 := subs(case1, F)

e[0]

(19)

F2 := subs(case1, ode)

(-a[2]*V-(gamma*k*e[0]^2-k*sigma*e[0]^2-b*e[0]^2-k*w*a[2]+alpha*k+w)/k^2)*(diff(diff(U(xi), xi), xi))+U(xi)*(((-gamma+sigma)*k+b)*U(xi)^2+k*e[0]^2*gamma-k*e[0]^2*sigma-b*e[0]^2-k*w*a[2]+k*alpha+(w*a[2]-alpha)*k) = 0

(20)

W := U(xi) = F1

U(xi) = e[0]

(21)

NULL

E := diff(G(xi), xi) = -(-2*m*mu-lambda)*exp(-(2*m*mu+lambda)*xi)*c__1/(2*m*mu+lambda)-mu/(2*m*mu+lambda)

diff(G(xi), xi) = -(-2*m*mu-lambda)*exp(-(2*m*mu+lambda)*xi)*c__1/(2*m*mu+lambda)-mu/(2*m*mu+lambda)

(22)

W1 := subs(E, W)

U(xi) = e[0]

(23)

W2 := subs(case1, W1)

U(xi) = e[0]

(24)

W3 := rhs(U(xi) = e[0])

e[0]

(25)

W4 := convert(W3, trig)

e[0]

(26)

W5 := W4

e[0]

(27)

odetest(W2, F2)

0

(28)

Download G-factoring.mw

I see this question
https://mathematica.stackexchange.com/questions/309952/how-to-choose-6-numbers-from-the-following-set-so-that-they-represent-the-length
and tried

primes := [seq(ithprime(i), i = 1 .. 20)];
with(combinat);
all_combinations := choose(primes, 6);

I can not make next part.

I’m trying to solve a stiff system 1-D PDEs numerically in Maple but I’m getting the following error:

“Error, (in pdsolve/numeric/match_PDEs_BCs) cannot handle systems with multiple PDE describing the time dependence of the same dependent variable, or having no time dependence”

I included a picture of the PDEs and their BCs in the attached maple file. For easy reading, the attached file includes highlighted sections for parameters and variables. You can skip those to PDEs, BCs and ICs sections at the end of the document to reach the error I’m facing.

For reference, I used another software to solve the system and I was able to get the results in few seconds, so I think it is solvable. However, personally I prefer to use Maple so any inputs, insights, workarounds that I could use to handle the system in Maple would be of great help to me. Thank you.

question.mw

First 40 41 42 43 44 45 46 Last Page 42 of 2425