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 am trying to solve a set of equations

Why are the results not the same as the following results?

Is there any other way to get the correct answer?

Download

Hi all, assume data::list, I want check data is not empty, which one is faster ?

Greetings,

I need to numerically solve a set of about 95 simultaneous algebraic transcendental equations, with each having about 25 terms that are expressions of three independent variables and other parameters of the problem (some 2500 total terms).  I've had much difficulty solving this set on Engineering Equations Solver (EES, from fchart software), and I'm now suspecting bugs in that program.

I'm not able to find a spec sheet or user's manual that explains Maple's capabilities.  I haven't found a place to read about such things as, "maximum number of algebraic equations," or "maximum number of characters in an equation", or other kinds of guides that would give me a direct indication on the software's capabilities.

Is there a stand-alone desk top version than can crunch numbers without resource to the cloud?

Can anyone please direct me to a complete manual for the user explaining such details?  

Thanks,

Tom

I had expected that applying the power rule for exponents would lead to an answer of zero. Maple refuses to give the desired answer, but using a procedure it works as expected.

Did I miss something?
 

Download mapleprimes.mw

Hi, 

Here is an example where evalf ( Int(....) ) fails to compute an in integral.
The function to integrate is very smooth and, except method=_Gquad, all the others seem to fail (even method=_MonteCarlo fails, which is probably the most surprising thing!)

Is it a weakness of evalf+Int or a misusse of my own ?

Download evalf_Int.mw

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!

Dear Friends

I want to know that how can I plot a 2D curve in 3D? 

I need to plot the curve for example z=y^2, in a 3D space and exactly in the plane x=0. The ranges are -1<y<1, -1<x<1, 0<z<1

(I want to copy and paste this curve in another 3D figure.) 

Thanks a lot

alternatingseries.mw
I have a double about this alternating series.
According to maple this series converges:

evalf(sum((-1)^(n+1)*(ln(n)/n+1),n=1..infinity))
                          0.3401310963

However limit ln(n)/n + 1 does not equal to zero, it equals 1. Therefore the series should diverge.

Also while I am on the subject of series and limits, why is limit (-1)^n  as n goes to infinity a range between -1-I and 1 + I.

limit((-1)^(n), n=infinity)
                        -1 - I .. 1 + I

Hello, I am having a bit of difficulty simplifying some calculations in Maple 2019. In short, in order to verify that the tensors that I am trying to use are indeed inverses of each other, I am simply trying to multiply component wise, for example the tensor component e[2,~2] with the tensor component f[~2,2], since they are essentially inverses of each other, i.e. the matrix defining f is actually the inverse of the matrix e, i.e. f=e^(-1), should give back 1 as an answer. Nonetheless, when I attempt to take this simple multiplication Maple does not reduce it, but rather just gives multiplies the terms with no simplification. Is there anything I can do so that Maple may simplify its calculations? I have already tried the "eval" calling sequence but that didn't do the trick, and I fear that when escalating the calculations I will get a bunch of long expressions rather than concise solutions. Thank you for your help in advance,
 

Christoffel_symbols_of_de_Sitter_metric_research.mw

Lets say you have this simple list here 

L := [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];

Which command would you use to partion into intervals? 

L_g := [1..2,3..4,5..6,7..8,9..10]

Hello

Although I am (remotely) running the following piece of code in a linux machine with 256 GB of ram, the error msg "Execution stopped: Stack limit reached" comes out 

kernelopts(stacklimit);
NestList:= proc(f, x, n::nonnegint)
local R:= rtable(0..n, [x]), k;
   for k to n do R[k]:= simplify(f(R[k-1])) od:
   [seq(R)]
end proc:
n:=34;
yreal:=NestList(y-> 4*y*(1-y),1/8,n):

I have tried to increase stacklimit issuing the command "kernelopts(stacklimit=256000)" but to no avail.  Is there anything else I can do?  A similar code run successfully in a mac with Mathematica. 

Many thanks 

Ed

PS. The default kernelopts(stacklimit) shows 8192 on the linux machine and  but 32736 on the mac pro.  I was expecting a higher number on the linux machine.  

restart;
with(LinearAlgebra);
G := Matrix([[beta1^2, 0, -beta2^2, 0], [0, beta1*(b^2 - beta1^2), 0, beta2*(b^2 + beta2^2)], [beta1^2*cosh(beta1*l), beta1^2*sinh(beta1*l), -beta2^2*cos(beta2*l), -beta2^2*sin(beta2*l)], [beta1*sinh(beta1*l)*(b^2 - beta1^2), beta1*cosh(beta1*l)*(b^2 - beta1^2), -beta2*sin(beta2*l)*(b^2 - beta2^2), beta2*cos(beta2*l)*(b^2 + beta2^2)]]);
NULL;
NULL;
S := Determinant(G);
S := simplify(S);
S1 := S/(beta1^2*beta2^2);
F := Pi*d^2/4;
Q := F*d^2/8;
u := E/(2*(1 + v));
lambda := sqrt(w^2/c^2);
j := v*d*lambda/sqrt(8);
y1 := 1 - j^2 + sqrt((j^2 - 1)^2 + 4*j^2*u/(c^2*p))/(2*j^2*u/(c^2*lambda^2*p));
y2 := 1 - j^2 - sqrt((j^2 - 1)^2 + 4*j^2*u/(c^2*p))/(2*j^2*u/(c^2*lambda^2*p));
b := 2*(1 + v)*(8/(v^2*d^2) - w^2/c^2);
beta1 := sqrt(y1);
beta2 := sqrt(-y2);
S;
d := 24.8;
c := 5100;
v := 0.34;
l := 2000;
E := 2.1*10^5;
p := 7700;
S;
plot(S, w = 0*2*Pi .. 100000*2*Pi);

# Here I get an error

Error, (in plot) incorrect first argument (-HFloat(2.757556062608314e294)-HFloat(2.757556062608314e294)*I)*(HFloat(2.757556062608314e294)-HFloat(2.757556062608314e294)*I+(HFloat(2.918216722364015e-174)+HFloat(7.045198389075166e-174)*I)*(HFloat(1.2899139595562734e220)+HFloat(1.2899139595562734e220)*I+(HFloat(2.345679734289597e162)+HFloat(9.71612358926469e161)*I)*(.3015529528-0.1030372934e-6*w^2)^2)+(HFloat(2.739493386336394e-116)+HFloat(2.739493386336394e-116)*I)*(HFloat(1.5009648027561687e-231)-HFloat(2.757556062608314e294)*I+(-HFloat(5.478986772672788e-116)+HFloat(5.478986772672788e-116)*I)*(.3015529528-0.103 ... HFloat(2.739493386336394e-116)*I)*(.3015529528-0.1030372934e-6*w^2)^4)

w1 := fsolve(S, w = 0*2*Pi .. 100000*2*Pi);

# Here I get an error 

Error, (in fsolve) Digits cannot exceed 38654705646
 

I want to substitute the solution back into the original equation.  I get caught up in RootOf and have to manually do the substitutions.

F := [x^2+y+z-1, y^2+x+z-1, z^2+x+y-1];

soln1 := solve(F);

for s in soln1 do

subs(s,F)

end do;

The 4th soln has RootOf.

soln2 := solve(_Z^2 + 2*_Z - 1);

for s in soln2 do

evala(subs({x=s,y=s,z=s},F))

end do;

How do I do this all in one step?