Unanswered Questions

This page lists MaplePrimes questions that have not yet received an answer

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

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.

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.

There are two opposing commands remove and select in Maple. According to the main help page, StringTools:-RegSplit effectively implements the removal (i.e., capturing substrings that does not match the given pattern), but as regards 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"]


Nevertheless, there exist at least two disadvantages to it.

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

For instance, there should be three flags in “RegFilter("a.+?b", "aabbbaaabb", 'overlapped'=⁇);”: 
⒈“["aab", "aaab"]” (selection with no overlap), 
⒉“["aab", "abb", "aaab", "aab", "abb"]” ( with partial overlaps), and 
⒊“["aab", "aabb", "aabbb", "aabbbaaab", "aabbbaaabb", "abb", "abbb", "abbbaaab", "abbbaaabb", "aaab", "aaabb", "aab", "aabb", "abb"]” ( with full overlaps). 

Unfortunately, the  above can only handle the last mode.

Another disadvantage is its inefficiency. Considering the following regular expression which matchs email-like strings

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

So Maple is capable of completing this removal within 4 seconds, yet if I execute the analogous

timelimit(60, time[real](RegFilter(re, sample))); 

Maple will end up running out of memory.

In view of these, where is the generic StringTools:-RegFilter functionality? Or can we construct those matched cases from  and the original text?

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]):


For several hours I experience difficulties to upload a mw file (file LaneEmdenNumeric.mw to answer this question).

Given the error message I get

I thought it was a general technical problem.

But then I realized that this file ColumnSorting_4.mw , for instance, could be uploaded.

Nevertheless, as soon as I try to upload LaneEmdenNumeric.mw I get the error displayed above and it becomes impossible to upload any other file, even ColumnSorting_4.mw.

Does someone has any idea about what's going on?
TIA

For the record, LaneEmdenNumeric.mw contains nothing special that could prevent its uploading.
This file can be uploaded here  DropBox  (replace the txt extension by mw before opening it with Maple).

integral of sqrt(sin(x)) is known to be as given in few place such as in here and other places.

Maple gives a result which is much more complicated (but also in terms of EllipticE special function). 

Could someone find a way to simplify it to the above answer and also to the same answer given by Mathematica?

int(sqrt(sin(x)),x)

Compare to 

Maple's result seems to be correct, as I plotted it and compared the smaller known resut. But I was not able to simplify it to obtain the smaller antiderivative.

Any tricks to do that?

Hi all

I need your advice on Maple usage after a long break. I installed Maple on my laptop and first of all tried to launch my old program. Surprisingly, the old file opened. While the core Maple functionality remained familiar, the user interface had undergone some changes.

Yet, I soon encountered challenges when attempting to perform even the simplest operations, like file browsing or text selection; the Maple Standard GUI seemed uncharacteristically sluggish.  I switched to Maple Input mode but it didn't help much. Are there ways to improve my experience with Maple? Is it caused by the outdated hardware?

My system:
Ubuntu 22.04.3 LTS
Dell Inc. Latitude 5510 (1TB SSD, 32GB RAM).

Maybe it works much better on Windows?

Thank you for any suggestions.

Modal Analysis is a very usefull feature. Only the animation window is sometimes too tiny.

How to enlarge this view and to pause the animation?

This seems to be a Maple plot window (a "Rotate the view" cursor is visible and the animation can be rotated). Are there any short cuts or functions keys to toggle plot view options?

Edit: Looks to my like a Maplet. Maybe a Maplet programmer can tell if that (what I am asking) is possible

Hi, 

Some of my maple documents contain data tables. 

When I want to view these documents with the maple cloud viewer, the data tables are invisible (the table is completely grayed out) and it is therefore impossible to change the values in this table. 

The table properties are such that it is enabled, visible and editable. 
Does anyone have an idea how to solve this problem? 
Thanks in advance. 

Whats the best way to let a Maple-Code run in webspace.

The Maple-Procedure gets some parameters from a mobile-App. Then doing calculations and giving back data as a file to the mobile app.

I have alomost decided for Deno which accepts Javascript. This is develeoped by Ryan Dahl who has also created Node.

Deno is more compact and very fast. So I when I use a deno server code  then I need the Maple-Code in language Javascript.

I have tried to translate some maple-subprocedures of my code with CodeGeneration but this is very restricted I think.

Thanks for ideas :)

Both, Maple and MapleSim in Versions from 2021 to 2023 do not start. A logfile is saved which starts as

# A fatal error has been detected by the Java Runtime Environment:

#

#  EXCEPTION_ACCESS_VIOLATION (0xc0000005) at pc=0x0000000000000000, pid=17256, tid=10520

#

# JRE version: OpenJDK Runtime Environment Temurin-19.0.1+10 (19.0.1+10) (build 19.0.1+10)

# Java VM: OpenJDK 64-Bit Server VM Temurin-19.0.1+10 (19.0.1+10, mixed mode, tiered, compressed oops, compressed class ptrs, g1 gc, windows-amd64)

# Problematic frame:

# C  0x0000000000000000

#

This only occurs when the notebook (on which the error occurs) is connected to the domain network. If the notebook is not connected, Maple and MapleSim can be started and will continue to run when the network is reconnected.

Has anybody seen this before or any ideas what this could be?

Edit: This all happened under Windows 10 on a notebook that has been running Maple for 3 years and only recently displayed this error.

Edit2: Connection via an USB doc which also connects to an external monitor.

The worksheet below includes a sample use of the Mobius transformation which produces a hyperbolic reflection of a point in the Poincare disk, followed by my attempt to produce the same result from first principles in a procedure.

Do I misunderstand the Mobius transformation and its use and/or is my procedure incorrect? 

InversePoint.mw

Soit h : [1 ; + ∞[ℝ

1.a°) Complète le tableau ci-dessus et trace la courbe ( Ch) de h dans un repére orthonormé ( O,I,j )

 𝑥 1 2 3 4 5

h(𝑥 )

b°) Montre que h est une bijection

c°) Détermine la bijection réciproque h-¹ de h

d°) Calcule hoh-¹ et h-¹oh ( 𝑥 )

2.) Trace la courbe ( Ch-¹) dans le même repére que ( Ch)

Hello,
I recently discovered the "Physics" package wich provides tools for manipulating abstract vectors (non-component).
In the "Physics:-Vectors", an orthonormal basis (i,j,k) is available and my main concern is how to generate arbitrary other 3D orthonormal bases to be able to calculate results in "vectorial form" without manipulating vectors' components.

To better explain my needs I have setup a kind of minimal example in the attached file where some questions are asked.

Thanks in advance for any feedback.

orthonormal-triads.mw

NULL

restart

with(Physics)

with(Physics[Vectors])

Creation of 2 rotation matrices

dir1 := `<,>`(0, 0, 1)

dir2 := `<,>`(0, 1, 0)

seq(assign(cat(R, i), Student:-LinearAlgebra:-RotationMatrix(theta[i], eval(cat(dir, i)))), i = 1 .. 2)

print(R1, R2)

Matrix(%id = 36893490614987576012), Matrix(%id = 36893490614987577572)

(1)

whattype(R1)

Creation of  orthogonal unit "Physics:-Vectors" from previous matrices

x1_ := _i*R1[1, 1]+_j*R1[2, 1]+_k*R1[3, 1]``

y1_ := _i*R1[1, 2]+_j*R1[2, 2]+_k*R1[3, 2]

z1_ := _i*R1[1, 3]+_j*R1[2, 3]+_k*R1[3, 3]NULL

NULL

x2_ := _i*R2[1, 1]+_j*R2[2, 1]+_k*R2[3, 1]NULL

y2_ := _i*R2[1, 2]+_j*R2[2, 2]+_k*R2[3, 2]

z2_ := _i*R2[1, 3]+_j*R2[2, 3]+_k*R2[3, 3]

Q1: Is there a more elegant way of creating "Physics:-Vectors" from matrices ?

Now, suppose that we want to compute `&x`(`#mover(mi("x1"),mo("&rarr;"))`, `#mover(mi("y2"),mo("&rarr;"))`) : since `#mover(mi("y2"),mo("&rarr;"))` = `#mover(mi("j"),mo("&and;"))` we have `&x`(`#mover(mi("x1"),mo("&rarr;"))`, `#mover(mi("y2"),mo("&rarr;"))`) = sin(`#mover(mi("x1"),mo("&rarr;"))`, `#mover(mi("j"),mo("&and;"))`)*`#mover(mi("z1"),mo("&rarr;"))` and sin(`#mover(mi("x1"),mo("&rarr;"))`, `#mover(mi("j"),mo("&and;"))`)*`#mover(mi("z1"),mo("&rarr;"))` = sin((1/2)*Pi-`&theta;__1`)*`#mover(mi("z1"),mo("&rarr;"))` and sin((1/2)*Pi-`&theta;__1`)*`#mover(mi("z1"),mo("&rarr;"))` = cos(theta[1])*`#mover(mi("z1"),mo("&rarr;"))`

The cross product operator  `&x`(x1_, y2_) yields

cos(theta[1])*_k

(2)

(which is a correct answer) instead of cos(theta[1])*`#mover(mi("z1"),mo("&rarr;"))` because vector `#mover(mi("z1"),mo("&rarr;"))` has is not known as a unit basis vector.

Similarly, `&x`(z1_, x1_) yields -sin(theta[1])*`#mover(mi("i"),mo("&and;"))`+cos(theta[1])*`#mover(mi("j"),mo("&and;"))` instead of  `#mover(mi("y1"),mo("&rarr;"))` as it would be the case when computing `&x`(_k, _i) ?

Q2: Is there a way to declare new triads of "Physics:-Vectors" with properties similar to the provided triad _i, _j, _k ?

Q3: Is the code defining the canonical basis i, _j, _kavailable for inspection and inspiration to setup orthonormal triads ?

Q4: Is it possible to get a (column) matrix of the vector components ? The function Physics:-Vectors:-Component(y1_, n) can only get 1 component at a time and only in the canonical basis i, _j, _k.

NULL

restart

with(Physics)

with(Physics[Vectors])NULL

After a proper definition of 2 new vector bases `#mover(mi("x1"),mo("&rarr;"))`, `#mover(mi("y1"),mo("&rarr;"))`, `#mover(mi("z1"),mo("&rarr;"))` and `#mover(mi("x2"),mo("&rarr;"))`, `#mover(mi("y2"),mo("&rarr;"))`, `#mover(mi("z2"),mo("&rarr;"))`, the position vector OM_ := l__1*x1_+l__2*x2_NULLNULL

l__1*x1_+l__2*x2_

(3)

NULL

projected on `#mover(mi("x2"),mo("&rarr;"))` would yield directly Typesetting[delayDotProduct](l__1, `#mover(mi("x2"),mo("&rarr;"))`.`#mover(mi("x1"),mo("&rarr;"))`, true)+l__2 instead of expand(OM_.x2_)

l__1*Physics:-Vectors:-`.`(x1_, x2_)+l__2*Physics:-Vectors:-Norm(x2_)^2

(4)

because of the unit vectors.

Download orthonormal-triads.mw

First 35 36 37 38 39 40 41 Last Page 37 of 361