I thought the easiest way to show the world map, a projected flat map into 3d was to use the builtin one and just transform it.  You can zoom into it and rotate it no problem but unforunately it's not as clean as I thought.  Is it possible to have cleaner shading manipulating the Builtin map to 3d?

with(plots):
with(plottools):
with(DataSets):
with(Builtin):
m := WorldMap():
m1 := Display(m)
                                

to3d := transform((x, y) -> [x, y, 0]):
m2 := to3d(m1)
                               

display(m2)

If a maple command or function are not available on the target language  of the code generation of maple, is it possible to set myself the expected output for such cases so that the Csharp(...)  recognizes the cases and generates the expect code?

for example 

h := proc(x::Array(1 .. 3, 1 .. 3), y::Array(1 .. 3, 1 .. 3)) local z; z := evalm(x &* y); return z[1, 1] + z[2, 2]; end proc;
CSharp(h);

The function names {`&*`, evalm} can not be recognized in the target language

but for the &* it shoud be easy to add a template with the desired C# output. 

Is it possible to add templates in existing languages but not new language definitions?

I'm using variable names that have subscripts, not as a table index but literal i.e. R__1 as a unique variable name.  It seems whenever I make assumptions on variables that have subscripts, when I use them the variables that have subscripts are printed twice:

Can anyone explain why this happens and how to get around it?

Thanks in advance.

My problem in package error, does anyone had a solution ping this!

For some reason machine thinks that I am trying to add a matrix to an equal sign.

Is it italic when copied and pasted?  Is it bold when copied from maple 8?  I just ahve not been able to work it out.

The only way that I can think of doing it is by multiplying by a tetrad.  Even then it does not work well see my worksheet:  The Dirac Equation in Robertson-Walker spacetime.

Download SC-plots.mw

I am having difficulty getting solutions to a pair of PDEs.  Would anyone like to cast an eye over the attached file, incase I am missing something.

Thanks

Melvin

Please I found out that the MatrixInverse on the assignment statement P3 does not run for about three days now. Please kindly help to simplify the code. Thank you and kind regards.

restart; omega := v/h;
r := a[0]+a[1]*x+a[2]*sinh(omega*x)+a[3]*cosh(omega*x)+a[4]*cos(omega*x)+a[5]*sin(omega*x);
b := diff(r, x);

c := eval(b, x = q) = f[n];
d := eval(r, x = q+3*h) = y[n+3]; e := eval(b, x = q+3*h) = f[n+3];
g := eval(b, x = q+2*h) = f[n+2];
i := eval(b, x = q+h) = f[n+1];
j := eval(b, x = q+4*h) = f[n+4];
k := solve({c, d, e, g, i, j}, {a[0], a[1], a[2], a[3], a[4], a[5]});
Warning,  computation interrupted
assign(k);
cf := r;
s4 := y[n+4] = simplify(eval(cf, x = q+4*h));
s3 := y[n+2] = simplify(eval(cf, x = q+2*h));
s2 := y[n+1] = simplify(eval(cf, x = q+h));
s1 := y[n] = simplify(eval(cf, x = q));

with(LinearAlgebra);
with(plots);
h := 1;
YN_1 := seq(y[n+k], k = 1 .. 4);
A1, a0 := GenerateMatrix([s1, s2, s3, s4], [YN_1]);
eval(A1);
YN := seq(y[n-k], k = 3 .. 0, -1);
A0, b1 := GenerateMatrix([s1, s2, s3, s4], [YN]);
eval(A0);
FN_1 := seq(f[n+k], k = 1 .. 4);
B1, b2 := GenerateMatrix([s1, s2, s3, s4], [FN_1]);
eval(B1);
FN := seq(f[n-k], k = 3 .. 0, -1);
B0, b3 := GenerateMatrix([s1, s2, s3, s4], [FN]);
eval(B0);
ScalarMultiply(R, A1)-A0;
det := Determinant(ScalarMultiply(R, A1)-A0);
P1 := A1-ScalarMultiply(B1, z);
P2 := combine(simplify(P1, size), trig);
P3 := MatrixInverse(P2);
P4 := A0-ScalarMultiply(B0, z);
P5 := MatrixMatrixMultiply(P3, P4);
P6 := Eigenvalues(P5);
f := P6[4];
T := unapply(f, z);
implicitplot(f, z = -5 .. 5, v = -5 .. 5, filled = true, grid = [5, 5], gridrefine = 8, labels = [z, v], coloring = [blue, white]);

Why the performance of Maple GUI is bad. It is really hard to type anything in thew gui. 

HI

I am using a simple piece of code to generate Lie derivatives, and I am interested in adapting it so that I can use it with vector Fields where that include RootOf expressions. 

LieDer_with_rootof.mw

The above includes an example where it works, and an example where RootOf appears in the vector field and it does not work. 

Could anyone help me with the following task?

The simplest case is, for example, 

    If y=y(x). Denote y'(x)=D_x(y). Then we make a change of veriables :

    x=φ(z,w), y=ψ(z,w), where z independent and w=w(z),

    Now the ODE: y'(x)=1 turns to:

    D_z(y)/D_z(x)=1,  i.e. ψ_z+w'(z)ψ_w=φ_z+w'(z)φ_w.

    So we have the relation: D_z=(φ_z+w'(z)φ_w)D_x.

    The task is how to define the operators (D_x, D_z) to transform more complecated ODE of (x,y) (e.g. (D_x+F(x,y))⁵(y)=0,   

     F arbitrary) to its counterpart of (z,w)?

Thank you in advance!

Help me to solve this problem with pdsolve

I am trying to recreate an example,  See attached worksheet below.  I can't figure out what I am doing wrong here.  I have tried using the command StepProperties on other discrete transfer functions, without any problems.  Having a function that plots the Step Response of a system, Continuous or Discrete, should be built in.

Download DiscreteStepResponseError.mw

Regards,

Georgios

Hello,

I am Seonhwa Kim, a mathematical researcher in Korea. Recently, I have extensively used Maple to compute character varieties of 3-manifolds. Several months ago, I obtained some strange results in Maple which implies a contradiction in theory.  I have been struggling with these issues since it is usually about enormous polynomial systems.  Eventually, I could figure out that the issues are caused by a defect in Maple and were able to construct a minimal working example to produce wrong computations in Maple.  I am writing this post to report them.

This is mainly about the PolynomialIdeal package.  Along with the documentation in Maple, If an ideal J is radical, PrimeDecomposition and PrimaryDecomposition should have the same result.  But, as we see the following, the result of PrimeDecomposition and PrimaryDecomposition are different although J is a radical ideal.

The problem seems to be that the PrimaryDecomposition command in Maple sometimes produces incorrect results.

We can compute the primary decomposition of J by hand.  It should be <x> and  <y, x-1>.

I double-checked this by the other software;Macauley2, Singular, and Magma, for example, you can see it as follows.

Secondly, not only for PrimaryDecomposition but also PrimeDecomposition may produce an incorrect result.

Here is a minimal working example.

Maple tells us a compatible result of prime and primary decomposition of a radical ideal J.

But the first component of J,  < b-1, c-a+1 >, contains the third component < a, b-1, c+1 >.

It contradicts with the definition of Primary decomposition. So the correct answer should be  < b - 1, c - a +1 >, <a,b,c>.

I also checked that  Macaluey2, Singular and Magma. They all say that my hand computation is correct. as follows.

I have used Maple 2017 by the license of my institute (Korea Institute for Advanced Study).

When I noticed these defects, I thought it would be fixed in the newest Maple version.

So, I have tried my examples by Maple2019  free trial, but It also has the same problem. 

I guess this problem is not reported or recognized yet. 

I hope this problem will be fixed as soon as possible.

Thank you for attention.

Sincerely,

Seonhwa