Conversion to exponentials...

I need some command that simplifies the exponentials (or a series of commands) so that there is no power over power.

What's happening (exp(k))^2

What do I need exp(2k)

What would be the most appropriate method? Below is a photo of my code

Need a Tutoring from 1 to 2 30 min session with...

Where can I find a tutor on Maples ??? I need a tutor on maple i am on graduate engineering  contat me anyone can help

How to plot the range of a complex function depend...

So I have a complex-valued function f that depends on two real variables x and y. I want to plot its range, i.e. the set of all values f(x,y), where x and y vary over their entire domain (which is a compact subset of R^2). Since I did not find of a direct way to do this, I decided to just compute the output f(x,y) at a finite set of points and plot these values in the complex plane. This gives me a rough idea of what the range should look like. However, this process is very slow (even though it should not be that slow, in my opinion). Here is the code I have used:

```f := x -> exp(2*I*Pi*x);
S1 := (x, y) -> Matrix(3, 3, [[f(x - y), 0, 0], [0, 1, 0], [0, 0, f(-y)]]);
S2 := (x, y) -> Matrix(3, 3, [[f(y), 0, 0], [0, f(y - x), 0], [0, 0, 1]]);
C := Typesetting[delayDotProduct](1/sqrt(3), Matrix(3, 3, [[1, 1, 1], [1, f(1/3), f(2/3)], [1, f(2/3), f(1/3)]]), true);
with(LinearAlgebra);
d := LinearAlgebra[Determinant](C . C);
V := (x, y) -> (((S1(x, y)/d^(1/3)) . C) . (S2(x, y))) . C;
tracevals := [];

for i from 0 to 100 do
for j from 0 to 100 do tracevals := [op(tracevals), Trace(V(0.01*i, 0.01*j))]; end do;
end do;
with(plots);
P2 := complexplot(tracevals, x = -2 .. 3, y = -3 .. 3);
```

Note that the specific example (i.e. plotting the trace of a unitary matrix V(x,y)) is not really important to this question. We could instead think of any complex-valued function f(x,y), it should not have any impact on the problem. Maple generates the following output:

Even though this output shows quite well the range that the function will take, it takes almost two minutes to generate. Is there a quicker or more elegant way to compute the range of a function?

Unsecure Open Source libraries in Maple...

We just switched to a new Antivirus program (Bitdefender), and we are getting a bunch of security warnings because of outdated software.

I do have  a couple of those for my PC, e.g. some regarding Apache. I don't have Apache installed on my PC, but I think Maple does use it.

So I wonder which policy Maple has regarding updating its open source libraries.

A quick review on Maple Help - copyright information shows a couple of Open Source licenses code which seems to be delivered in old versions.

Bitdefender classifies them with a high security risk.

How do I compute the continuous eigenvalues of a f...

I am working with a family of unitary matrices, that depend on two parameters x and y in a smooth way. Their eigenvalues are thus complex numbers of absolute value 1. My goal is to plot the bands (i.e. the argument of the eigenvalues). I know that there exists a parametrization of the eigenvalues such that the corresponding bands are continuous. In particular, I use the following code:

```f := x -> exp(2*I*Pi*x);
S1 := (x, y) -> Matrix(3, 3, [[f(x - y), 0, 0], [0, 1, 0], [0, 0, f(-y)]]);
S2 := (x, y) -> Matrix(3, 3, [[f(y), 0, 0], [0, f(y - x), 0], [0, 0, 1]]);
C := Typesetting[delayDotProduct](1/sqrt(3), Matrix(3, 3, [[1, 1, 1], [1, f(1/3), f(2/3)], [1, f(2/3), f(1/3)]]), true);
d := LinearAlgebra[Determinant](C . C);
V := (x, y) -> (((S1(x, y)/d^(1/3)) . C) . (S2(x, y))) . C;
with(LinearAlgebra);
bands := (x, y) -> -I*ln~(Eigenvalues(V(x, y)));

with(plots);
plot3d({bands(x, y)[1], bands(x, y)[2], bands(x, y)[3]}, x = 0 .. 1, y = 0 .. 1);
```

However, the output is the following plot:

One can see that the bands can technically be chosen in a way such that they are continuous and we dont have those weird vertical jumps. Is there a way to make Maple choose them like this? Or is there a way to at least surpress these vertical jumps in the plot, so that the plot is a bit more ordered? Ideally I would like a way that works for more examples than the one I gave above (I'd like to do these plots for different matrices C), but any help is appreciated!

Edit: Maybe an easier starting point is the following: If I choose the matrix C to be the identity matrix, the bands are of a nicer form:

We can see that Maple parametrizes the bands in a continuous way. The only problem is the vertical jumps that happen when the argument switches from pi to -pi. Is there a way to avoid plotting these jumps, so the plot does not include these vertical lines?

How do I add labels to plots?...

Is it possible to add a label to a plot output?

Using quotes and delayed evaluation: procedure rou...

Hello,

New user of Maple, new to this MaplePrimes.

I am working with the following code taken from this help file.

In particular, I am studying the section "Techniques for solving a non-linear two-point BVP" towards the end.

Here is the initial setup of the code that puts the code I am finding challenging into context:

```restart;
ode := diff(y(x),x,x) + (y(x))^2*diff(y(x),x) + cos(y(x)) = x;
bc1 := (1 + y(0))*D(y)(0) - 3*y(0) = 0;
bc2 := (1 + y(1))*D(y)(1) - 3*y(1) - (y(1))^2 + 0.5 = 0;
```

The code I am struggling with is as follows.

```h:=proc(a,b)
local F;
Digits := 10;
if type(a,numeric) and type(b,numeric) then
F:=dsolve({ode,y(0)=a,D(y)(0)=b},y(x),numeric);
[rhs(F(1)[2],rhs(F(1)[3])];
else 'h'(a,b);
end if;
end proc:```

Could someone please kindly explain to me what the underlying purpose is of the if.. then.. else conditions written into the procedure code? It is clearly necessary, because if I remove it then the code does not work. I can see that, were we to just run some instruction like h(1,3) then none of this woud be necessary. The value of a is set to 1, the value of b is set to 3, both of these values are numeric and the procedure can run the dsolve operation and spit out the list as determined by the contents of F(1).

But this procedure is being used to ultimately construct an implicit plot (see below), and without the extra conditional statements the code does not work. So, how does the way the code is structred get around  the problem?

I have difficulty understanding the Maple environment regarding using quotes to delay evaluation. I have read a lot of information, but at the moment I have confused myself more and more.

I guess the best explanation to help me would be if someone were to describe to me what I am getting/needing/expecting if I were actually the Maple software myself running the code. How does the absence of the conditional statements mess things up for me? How is it rescued by these statements?  The 'h'(a,b) really has me scratching my head. What does Maple do when a and b are not numeric? Do a and b start off not being numeric? When do they become numeric?

For clarity, following the help pages, th procedure is to be implemented as follows. First, two more procedures are created, one which involves h.

```BC1 := proc(a,b)
(1 + a)*b - 3*a
end proc;
BC2 := proc(a,b)
(1 + h(a,b)[1])*h(a,b)[2] - 3*h(a, b)[1] - h(a,b)[1]^2 + 0.5
end proc;
```

And then the set of points (a,b) is to be plotted which simultaneously satisfy BC1=0 and BC2=0.

```with(plots):
implicitplot([BC1(a,b)=0,BC2(a,b)=0], a=-5..1, b=-11..7, color=[black,red],
legend=["BC1(a,b)=0","BC2(a,b)=0"]);
```

Thanks for any help anyone can provide. The explanation needs to start off in simple terms - my head is spinning from all of the Maple descriptions in Maple terms and jargon.  I'm not getting a foot in the door that way.

Best wishes

Mikey

Does is(...) assume real?...

Here is an example without assumptions that should return false for complex numbers (IMO)

```prp := cos(z)/abs(cos(z)) - abs(cos(z))/cos(z) = 0:
is(prp);
true
```

For comparision: simplify requires restriction to the real domain

```simplify(prp);
(simplify(prp) assuming real);
2
-|cos(z)|  sec(z) + cos(z)
-------------------------- = 0
|cos(z)|

0 = 0

```

This only makes sense if is(...) assumes real or I am wrong with complex numbers and simplify should simplify this expression without assumptions.

How to solve a partial differential equation ...

Hello sir

I am new to here

I am not familear with maple can i solve the pde in maple software and get the plots and tabular values which are mentioned in the below given pdf

The final equation (12-19) of the pdf to solve and get the plots like below mentioned figure number

Figure 4,17 and 23 one sample graphs

With table 2 values. Basha-2023-Keller-box-computation-for-entropy

I heared about maple recently in reseach gate. It is friendly user.

Please tell me how to get the above mentiond values and plots.

Is there a `StringTools:-RegFilter` function that ...

There are two opposing commands `remove` and `select` in Maple. According to the main help page, `StringTools:-RegSplit` effectively implies the removal (i.e., capturing substrings that does not match the given pattern), but for extracting the matching parts of the input string (e.g., this example from MatLab), where is the command to carry out the selection?
At present I can do something like

```use StringTools in RegFilter := (p::string, s::string) -> select[2](RegMatch, sprintf("^%s\$", p), (op@NGrams)~(s, [`\$`](Length(s)))) end:
RegFilter("a.+b", "aabbbaaabb");
=
["aab", "abb", "aab", "abb", "aabb", "abbb", "aaab", "aabb",

"aabbb", "aaabb", "abbbaaab", "aabbbaaab", "abbbaaabb",

"aabbbaaabb"]

```

This is essentially equivalent to letting the matcher keeps starting at the same position until no more new matches are found, while sometimes we just need the matcher to continue the shortest-match testing at the character following the last matched substring after finding a match:

For instance, `RegFilter("a.+?b", "aabbbaaabb", 'overlapped'＝⁇);` should return:
⒈`["aab", "aaab"]`,
⒉`["aab", "abb", "aaab", "aab", "abb"]`, or
⒊`["aab", "aabb", "aabbb", "aabbbaaab", "aabbbaaabb", "abb", "abbb", "abbbaaab", "abbbaaabb", "aaab", "aaabb", "aab", "aabb", "abb"]`?

Another disadvantage of it is that it is too inefficient. Considering the following regular expression which matchs email-like strings

```sample := Import("https://github.com/mariomka/regex-benchmark/raw/optimized/input-text.txt"): # length：
time[real]((remnants := StringTools:-RegSplit("[a-zA-Z_0-9\\.+-]+@[a-zA-Z_0-9\\.-]+\\.[a-zA-Z_0-9\\.-]+", sample)));
=
3.157

```

while if I execute the analogous “timelimit(60, time(RegFilter("[a-zA-Z_0-9\\.+-]+@[a-zA-Z_0-9\\.-]+\\.[a-zA-Z_0-9\\.-]+", sample)));”, Maple will end up running out of memory.

So, where is the `StringTools:-RegFilter` functionality? Or can we construct those matched cases from remnants and the original text?

Broken maple document...

Hey my maple document will not open up! When I try to open it, it simply asks me if I want to open my document as maple text, plain text, maple input or simply cancel. No matter which of the options I select the document will just be blank. If anyone can fix it then please help me! I really really need the document since all my notes are in there. I have attached the document to this post.

regards chri69a9

Notes_to_Introduction_to_Probability_Theory.mw

It's all Greek to me...

I noticed that when I enter an equation into Maple, Greek symols change to English equivalents after a couple of days. E.g. Gamma becomes G , Pi becomes p, but not for all characters.

I haven't noticed any similar effects on mathematical characers or operators, or any other symbols.

RH

Animate a Line....

I am asking this beacuse I am rusty on using animate in plots. Just trying to show the line segment moving.

 (1)

How to solve this?...

I have solve this problem in Runge-Kutta Method but i'm getting error.Can you solve this in RK Method or How to give a code for Shooting Method.

Here is my code.

How to solve the difference scheme solve and plot...

Dear maple users,

i want to solve these 4 difference scheme equations to calculate the values of U,V,C,T and plot the graphs i verse U by fixing the values

i:=1,Sc:=2,Gr:=5,Gc:=10,DX:=0.02;DR:=0.2,Dt:=:=0.01:m:=7.44,7.88 where ,j=0..5;

eq1[i,j,m]:=(1/(4*DX))*(U[i, j-1,m+1]-U[i-1, j-1,m+1]+U[i,j,m+1]-U[i-1, j,m+1]- U[i-1, j-1,m]+U[i, j,m]-U[i-1, j,m])+(1/(2*DR))*(V[i, j,m+1]-V[i, j-1,m+1]+V[i, j,m]-V[i, j-1,m])+(1/(1+(j-1)*DR))*(V[i, j,m+1]):

eq2[i,j,m]:=(1/Dt)*(U[i, j,m+1]-U[i, j,m])+(U[i, j,m]/(2*DX))*(U[i, j,m+1]-U[i-1, j,m+1]+U[i, j,m]-U[i-1, j,m])+(V[i, j,m]/(4*DR))*(U[i, j+1,m+1]-U[i, j-1,m+1]+U[i, j+1,m]-U[i, j-1,m])=(Gr/2)*(T[i, j,m+1]+T[i, j,m])+(Gc/2)*(C[i, j,m+1]+C[i, j,m])+(1/(2*(DR)^2))*(U[i, j-1,m+1]-2*U[i, j,m+1]+U[i, j+1,m+1]+U[i, j-1,m]-2*U[i, j,m]+U[i, j+1,m])+(1/(4*DR*(1+(j-1)*DR)))*(U[i, j+1,m+1]-U[i, j-1,m+1]+U[i, j+1,m]-U[i, j-1,m]):

eq3[i,j,m]:=(1/Dt)*(T[i, j,m+1]-T[i, j,m])+(U[i, j,m]/(2*DX))*(T[i, j,m+1]-T[i-1, j,m+1]+T[i, j,m]-T[i-1, j,m])+(V[i, j,m]/(4*DR))*(T[i, j-1,m+1]-T[i, j-1,m+1]+T[i, j+1,m]-T[i, j-1,m])=(1/(2*Pr*(DR)^2))*(T[i, j-1,m+1]-2*T[i, j,m+1]+T[i, j+1,m+1]+T[i, j-1,m]-2*T[i, j,m]+T[i, j+1,m])+(1/(4*Pr*DR*(1+(j-1)*DR)))*(T[i, j+1,m+1]-T[i, j-1,m+1]+T[i, j+1,m]-T[i, j-1,m]):
eq4[i,j,m]:=(1/Dt)*(C[i, j,m+1]-C[i, j,m])+(U[i, j,m]/(2*DX))*(C[i, j,m+1]-C[i-1, j,m+1]+C[i, j,m]-C[i-1, j,m])+(V[i, j,m]/(4*DR))*(C[i, j+1,m+1]-C[i, j-1,m+1]+C[i, j+1,m]-C[i, j-1,m])=(1/(2*Sc*(DR)^2))*(C[i, j-1,m+1]-2*C[i, j,m+1]+C[i, j+1,m+1]+C[i, j-1,m]-2*C[i, j,m]+C[i, j+1,m])+(1/(4*Sc*DR*(1+(j-1)*DR)))*(C[i, j+1,m+1]-C[i, j-1,m+1]+C[i, j+1,m]-C[i, j-1,m]):

 First 9 10 11 12 13 14 15 Last Page 11 of 2072
﻿