Good book to start studying maple for engineering.

Download Australopithecus_updated.mw

http://www.gatewaycoalition.org/includes/display_project.aspx?ID=279&maincatid=105&subcatid=1019&thirdcatid=0

Lenin Araujo Castillo

Ambassador of Maple

In this application you can visualize the impulse generated by a constant and variable force for the interaction of a particle with an object in a state of rest or movement. It is also the calculation of the momentum-momentum equation by entering the mass of the particle to solve initial and final velocities respectively according to the case study. Engineering students can quickly display the calculations and then their interpretation. In spanish.

Plot_of_equation_impulse-momentum.mw

Exercises_of_Momentum-Impulse_Linear.mw

Lenin Araujo Castillo

Ambassador of Maple

So I have recently finished up a project that took different sounds found in nature, and through the Spectrogram command, plotted the frequency of each sound over time with some really cool results!

https://www.maplesoft.com/applications/view.aspx?SID=154346 

The contrast between sounds produced by the weather such as tornadoes, thunder, and hail versus something as innocuous as a buzzing bee, a chorus of crickets, or a purring cat really shows the variance in the different sounds we hear in our day to day life, while also creating some very interesting imagery.

My personal favourite was the cricket chorus, producing a very ordered image with some really cool spikes through many different frequencies as the crickets chirped, as shown here:

Using this plot, we can do some interesting things, like count the number of chirps in 8 seconds, which turns out to be 18-18.5. Why Is this important? Well, there’s a law known as Dolbear’s Law(shown here: https://en.wikipedia.org/wiki/Dolbear%27s_law)  which uses the number of chirps in a minute for Fahrenheit, or 8 seconds for Celsius to calculate the temperature. Celsius is very simple, and just requires adding 5 to the number of chirps in 8 seconds, which gets us a temperature of 23C.

T_c= 5 + N₈

For Fahrenheit, it’s a bit more complicated, as we need the chirps in a minute. This is around 132 chirps in our case. Putting that into the formula:

T_F= 50 +((N₆₀ – 40)/4)

Which gets us 73F, or 22.7C, so you can see that it works pretty well! Pretty cool, huh?

There was also some really cool images that were produced, like the thunder plot:

Which I personally really like due to the contrasting black and yellow spike that occurs. Overall this was a very fun project to do, getting to tweak the different colours and scales of each spectrogram, creating a story out of a sound. Hope you all enjoy it!

 I accidentally stumbled on this problem in the list of tasks for mathematical olympiads. I quote its text in Russian-English translation:

"The floor in the drawing room of Baron Munchausen is paved with the identical square stone plates.
 Baron claims that his new carpet (made of one piece of a material ) covers exactly 24 plates and
 at the same time each vertical and each horizontal row of plates in the living room contains 
exactly 4 plates covered with carpet. Is not the Baron deceiving?"

At first glance this seems impossible, but in fact the Baron is right. Several examples can be obtained simply by hand, for example

                                        or        

The problem is to find all solutions. This post is dedicated to this problem.

We put in correspondence to each such carpet a matrix of zeros and ones, such that in each row and in each column there are exactly 2 zeros and 4 ones. The problem to generate all such the matrices was already discussed here and Carl found a very effective solution. I propose another solution (based on the method of branches and boundaries), it is less effective, but more universal. I've used this method several times, for example here and here.
There will be a lot of such matrices (total 67950), so we will impose natural limitations. We require that the carpet be a simply connected set that has as its boundary a simple polygon (non-self-intersecting).

Below we give a complete solution to the problem.

restart;
R:=combinat:-permute([0,0,1,1,1,1]); # All lists of two zeros and four units

# In the procedure OneStep, the matrices are presented as lists of lists. The procedure adds one row to each matrix so that in each column there are no more than 2 zeros and not more than 4 ones

OneStep:=proc(L::listlist)
local m, k, l, r, a, L1;
m:=nops(L[1]); k:=0;
for l in L do
for r in R do
a:=[op(l),r];
if `and`(seq(add(a[..,j])<=4, j=1..6)) and `and`(seq(m-add(a[..,j])<=2, j=1..6)) then k:=k+1; L1[k]:=a fi;
od; od;
convert(L1, list);
end proc:

# M is a list of all matrices, each of which has exactly 2 zeros and 4 units in each row and column

L:=map(t->[t], R):
M:=(OneStep@@5)(L):
nops(M);
                                            67950

M1:=map(Matrix, M):

# From the list of M1 we delete those matrices that contain <1,0;0,1> and <0,1;1,0> submatrices. This means that the boundaries of the corresponding carpets will be simple non-self-intersecting curves

k:=0:
for m in M1 do
s:=1;
for i from 2 to 6 do
for j from 2 to 6 do
if (m[i,j]=0 and m[i-1,j-1]=0 and m[i,j-1]=1 and m[i-1,j]=1) or (m[i,j]=1 and m[i-1,j-1]=1 and m[i,j-1]=0 and m[i-1,j]=0) then s:=0; break fi;
od: if s=0 then break fi; od:
if s=1 then k:=k+1; M2[k]:=m fi;
od:
M2:=convert(M2, list):
nops(M2);
                                             394

# We find the list T of all segments from which the boundary consists

T:='T':
n:=0:
for m in M2 do
k:=0: S:='S':
for i from 1 to 6 do
for j from 1 to 6 do
if m[i,j]=1 then
if j=1 or (j>1 and m[i,j-1]=0) then k:=k+1; S[k]:={[j-1/2,7-i-1/2],[j-1/2,7-i+1/2]} fi;
if i=1 or (i>1 and m[i-1,j]=0) then k:=k+1; S[k]:={[j-1/2,7-i+1/2],[j+1/2,7-i+1/2]} fi;
if j=6 or (j<6 and m[i,j+1]=0) then k:=k+1; S[k]:={[j+1/2,7-i+1/2],[j+1/2,7-i-1/2]} fi;
if i=6 or (i<6 and m[i+1,j]=0) then k:=k+1; S[k]:={[j+1/2,7-i-1/2],[j-1/2,7-i-1/2]} fi; 
fi;
od: od:
n:=n+1; T[n]:=[m,convert(S,set)];
od:
T:=convert(T, list):

# Choose carpets with a connected border

C:='C': k:=0:
for t in T do
a:=t[2]; v:=op~(a);
G:=GraphTheory:-Graph([$1..nops(v)], subs([seq(v[i]=i,i=1..nops(v))],a));
if GraphTheory:-IsConnected(G) then k:=k+1; C[k]:=t fi;
od:
C:=convert(C,list):
nops(C);
                                               208

# Sort the list of border segments so that they go one by one and form a polygon

k:=0: P:='P':
for c in C do
a:=c[2]: v:=op~(a);
G1:=GraphTheory:-Graph([$1..nops(v)], subs([seq(v[i]=i,i=1..nops(v))],a));
GraphTheory:-IsEulerian(G1,'U');
U; s:=[op(U)];
k:=k+1; P[k]:=[seq(v[i],i=s[1..-2])];
od:
P:=convert(P, list):

# We apply AreIsometric procedure from here to remove solutions that coincide under a rotation or reflection

P1:=[ListTools:-Categorize( AreIsometric, P)]:
nops(P1);
                                                 28

We get 28 unique solutions to this problem.

Visualization of all these solutions:

interface(rtablesize=100):
E1:=seq(plottools:-line([1/2,i],[13/2,i], color=red),i=1/2..13/2,1):
E2:=seq(plottools:-line([i,1/2],[i,13/2], color=red),i=1/2..13/2,1):
F:=plottools:-polygon([[1/2,1/2],[1/2,13/2],[13/2,13/2],[13/2,1/2]], color=yellow):
plots:-display(Matrix(4,7,[seq(plots:-display(plottools:-polygon(p,color=red),F, E1,E2), p=[seq(i[1],i=P1)])]), scaling=constrained, axes=none, size=[800,700]);
 

Carpet1.mw

The code was edited.

Using the syntax in Maple we develop the energy with conservation equations here we are applying the commands int, factor, solve among others. We also integrate vector functions through the scalar product and finally we calculate conservative fields applying the rotational to a field of force. Exclusive for engineering students. In spanish.

Work_of_a_Force.mw

Lenin Araujo castillo

Ambassafor of Maple

Download ImprovementsInPdsolve.mw

Edgardo S. Cheb-Terrab
Physics, Differential Equations and Mathematical Functions, Maplesoft

And the Nobel prize in physics 2017 went for work in General Relativity ! Actually, experimental work involving sophisticated detectors and Numerical Relativity, one of the branches of GR. The prize was awarded to Rainer Weiss (85 years old, 1/2 of the prize), Barry Barish (81 years old, 1/4 of the prize) and Kip Thorne (77 years old, 1/4 of the prize) who have "shaken the world again" with their work on Ligo experiment, which was able to detect ripples in the fabric of spacetime.

General Relativity continues to be at the center of work in theoretical and experimental physics. I take this opportunity to note that, in Maple 2017, among the several improvements in the Physics package regarding General Relativity, there is a new package, Physics:-ThreePlusOne, all dedicated to the symbolic manipulations necessary to formulate problems in Numerical Relativity.

The GR functionality implemented in Physics, Physics:-Tetrads and Physics:-ThreePlusOne is unique in computer algebra systems and reflects the Maplesoft intention, for several years now, to provide the very best possible computer algebra environment for Physics, regarding current research activity as well as related education in advanced mathematical-physics methods.

For what is going on in theoretical physics nowadays and its connection with General Relativity, in very short: the unification of gravity with the other forces, check for instance this map from Aug/2015 (by the way a very nice summary for whoever is interested):

It is also interesting the article behind this map of topics as well as this brilliant and accessible presentation by Nima Arkani-Hamed (Princeton):  Quantum Mechanics and Spacetime in the 21st Century, given in the Perimeter Institute for Theoretical Physics (Waterloo), November 2014. 

Edgardo S. Cheb-Terrab
Physics, Differential Equations and Mathematical Functions, Maplesoft

Group of exercises solved using Maple scientific software, with the necessary considerations of some basic commands: evalf and convert that will show the solutions with the user-defined digits and the angular measurement in sexagesimal degrees. Important use of the law of the triangle through of vector position applied to vectors in vector spaces, vector force and vector moment for engineering students. In spanish.

Exercises_of_vectors_forces_and_moment_with_Maple.mw

Videotutorial:

https://www.youtube.com/watch?v=DxpO0gc5GCA

Lenin Araujo Castillo

Ambassador of Maple

The development of the calculation of moments using force vectors is clearly observed by taking a point and also a line. Different exercises are solved with the help of Maple syntax. We can also visualize the vector behavior in the different configurations of the position vector. Applications designed exclusively for engineering students. In Spanish.

Moment_of_a_force_using_vectors_updated.mw

Lenin Araujo Castillo

Ambassador of Maple

A project that I have been working on is adding some functionality for Cluster Analysis to Maple (a small part of a much bigger project to increase Maple’s toolkit for exploratory data mining and data analysis). The launch of the MapleCloud package manager gave me a way to share my code for the project as it evolves, providing others with some useful new tools and hopefully gathering feedback (and collaborators) along the way.

At this point, there aren’t a lot of commands in the ClusterAnalysis package, but I have already hit upon several interesting applications. For example, while working on a command for plotting clusters of points, one problem I encountered was how to draw the minimal volume enclosing ellipsoid around a group (or cluster) of points. After doing some research, I stumbled upon Khachiyan’s Algorithm, which related to solving linear programming problems with rational data. The math behind this is definitely interesting, but I’m not going to spend any time on it here. For further reading, you can explore the following:

• Ellipsoid Method: https://en.wikipedia.org/wiki/Ellipsoid_method
• The Ellipsoid (Kachiyan) Method: https://web.stanford.edu/class/msande310/ellip.pdf
• A note on Approximate Minimum Volume Enclosing Ellipsoid of Ellipsoids: http://compgeom.com/~piyush/papers/emve.pdf

Khachiyan’s Algorithm had previously been applied in some other languages, but to the best of my knowledge, did not have any Maple implementations. As such, the following code is an implementation of Khachiyan’s Algorithm in 2-D, which could be extended to N-dimensional space rather easily.

This routine accepts an Nx2 dataset and outputs either a plot of the minimum volume enclosing ellipsoid (MVEE) or a list of results as described in the details for the ‘output’ option below.

MVEE( X :: DataSet, optional arguments, additional arguments passed to the plotting command );

The optional arguments are as follows:

• tolerance : realcons;  specifies the convergence criterion
• maxiterations : posint; specifies the maximum number of iterations
• output : {identical(data,plot),list(identical(data,plot))}; specifies the output. If output includes plot, then a plot of the enclosing ellipsoid is returned. If output includes data, then the return includes is a list containing the matrix A, which defines the ellipsoid, the center of the ellipse, and the eigenvalues and eigenvectors that can be used to find the semi-axis coordinates and the angle of rotation, alpha, for the ellipse.
• filled : truefalse; specifies if the returned plot should be filled or not

Code:

You can run this as follows:

As it stands, this is not an export from the “work in progress” ClusterAnalysis package – it’s actually just a local procedure used by the ClusterPlot command. However, it seemed like an interesting enough application that it deserved its own post (and potentially even some consideration for inclusion in some future more geometry-specific package). Here’s an example of how this routine is used from ClusterAnalysis:

The source code for this is stored on GitHub, here:

https://github.com/dskoog/Maple-ClusterAnalysis/blob/master/src/MVEE.mm

Comments and suggestions are welcomed.

If you don’t have a copy of the ClusterAnalysis package, you can install it from the MapleCloud window, or by running:

These worksheets provide the volume calculations  of a small causal diamond near the tip of the past light cone, using dimensional analysis and particular test metrics.

I recommend them for anyone working in causet theory on the problem of finding higher order corrections.

2D.mw

4D.mw

4Dflat.mw

With this app you will be able to interpret the curvatures generated by two position vectors, either in the plane or in space. Just enter the position vectors and drag the slider to calculate the curvature at different times and you will of course be able to observe its respective graph. At first I show you how it is developed using the natural syntax of Maple and then optimize our
 app with the use of buttons. App made in Maple for engineering students. In spanish.

Plot_of_Curvature.mw

Videotutorial:

https://www.youtube.com/watch?v=SbXFgr_5JDE

Lenin Araujo Castillo

Ambassador of Maple

This is Maple:

These are some primes:

22424170499, 106507053661, 193139816479, 210936428939, 329844591829, 386408307611,
395718860549, 396412723027, 412286285849, 427552056871, 454744396991, 694607189303,
730616292977, 736602622363, 750072072203, 773012980121, 800187484471, 842622684461

This is a Maple prime:

In plain text (so you can check it in Maple!) that number is:

111111111111111111111111111111111111111111111111111111111111111111111111111111
111111111111111111111111111111116000808880608061111111111111111111111111111111
111111111111111111111111111866880886008008088868888011111111111111111111111111
111111111111111111111116838888888801111111188006080011111111111111111111111111
111111111111111111110808080811111111111111111111111118860111111111111111111111
111111111111111110086688511111111111111111111111116688888108881111111111111111
111111111111111868338111111111111111111111111111880806086100808811111111111111
111111111111183880811111111111111111100111111888580808086111008881111111111111
111111111111888081111111111111111111885811188805860686088111118338011111111111
111111111188008111111111111111111111888888538888800806506111111158500111111111
111111111883061111111111111111111116580088863600880868583111111118588811111111
111111118688111111111001111111111116880850888608086855358611111111100381111111
111111160831111111110880111111111118080883885568063880505511111111118088111111
111111588811111111110668811111111180806800386888336868380511108011111006811111
111111111088600008888688861111111108888088058008068608083888386111111108301111
111116088088368860808880860311111885308508868888580808088088681111111118008111
111111388068066883685808808331111808088883060606800883665806811111111116800111
111581108058668300008500368880158086883888883888033038660608111111111111088811
111838110833680088080888568608808808555608388853680880658501111111111111108011
118008111186885080806603868808888008000008838085003008868011111111111111186801
110881111110686850800888888886883863508088688508088886800111111111111111118881
183081111111665080050688886656806600886800600858086008831111111111111111118881
186581111111868888655008680368006880363850808888880088811111111111111111110831
168881111118880838688806888806880885088808085888808086111111111111111111118831
188011111008888800380808588808068083868005888800368806111111111111111111118081
185311111111380883883650808658388860008086088088000868866808811111111111118881
168511111111111180088888686580088855665668308888880588888508880800888111118001
188081111111111111508888083688033588663803303686860808866088856886811111115061
180801111111111111006880868608688080668888380580080880880668850088611111110801
188301111111111110000608808088360888888308685380808868388008006088111111116851
118001111111111188080580686868000800008680805008830088080808868008011111105001
116800111111118888803380800830868365880080868666808680088685660038801111180881
111808111111100888880808808660883885083083688883808008888888386880005011168511
111688811111111188858888088808008608880856000805800838080080886088388801188811
111138031111111111111110006500656686688085088088088850860088888530008888811111
111106001111111111111111110606880688086888880306088008088806568000808508611111
111118000111111111111111111133888000508586680858883868000008801111111111111111
111111860311111111111111111108088888588688088036081111860803011111111863311111
111111188881111111111111111100881111160386085000611111111888811111108833111111
111111118888811111111111111608811111111188680866311111111111811111888861111111
111111111688031111111111118808111111111111188860111111111111111118868811111111
111111111118850811111111115861111111111111111888111111111111111080861111111111
111111111111880881111111108051111111111111111136111111111111188608811111111111
111111111111116830581111008011111111111111111118111111111116880601111111111111
111111111111111183508811088111111111111111111111111111111088880111111111111111
111111111111111111600010301111111111111111111111111111688685811111111111111111
111111111111111111111110811801111111111111111111158808806881111111111111111111
111111111111111111111181110888886886338888850880683580011111111111111111111111
111111111111111111111111111008000856888888600886680111111111111111111111111111
111111111111111111111111111111111111111111111111111111111111111111111111111111

This is a 3900 digit prime number. It took me about 400 seconds of computation to find using Maple.  Inspired by the Corpus Christi College Prime, I wanted to make an application in Maple to make my own pictures from primes.

It turns out be be really easy to do because prime numbers are realy quite common.  If you have a piece of ascii art where all the characters are numerals, you could just call on it and get a prime number that is still ascii art with a couple digits in the corner messed up (for a number this size, I expect fewer than 10 of the least significant digits would be altered).  You may notice, however, that my Maple Prime has beautiful corners!  This is possible because I found the prime in a slightly different way.

To get the ascii art in Maple, I started out by using to import ( )  and process the original image.  First then and to get a nice 78 pixel wide image.  Then to make it a pure 1-bit black or white image.

Then, from the image, I create a new Array of the decimal digits of the ascii art and my prime number.  For each of the black pixels I randomly use one of the digits or and for the white pixels (the background) I use 's.  Now I convert the Array to a large integer and test if it is prime using (it probably isn't) so, I just randomly change one of the black pixels to a different digit (there are 4 other choices) and call again. For the Maple Prime I had to do this about 1000 times before I landed on a prime number. That was surprisingly fast to me! It is a great object lesson in how dense the prime numbers really are.

So that you can join the fun without having to replicate my work, here is a small interactive Maple document that you can use to find prime numbers that draw ascii art of your source images. It has a tool that lets you preview both the pixelated image and the initial ascii art before you launch the search for the prime version.

Prime_from_Picture.mw

With this application you will learn the beginning of the study of the vectors. Graphing it in a vector space from the plane to the space. You can calculate its fundamental characteristics as triangle laws, projections and strength. App made entirely in Maple for engineering students so they can develop their exercises and save time. It is recommended to first use the native syntax then the embedded components. In Spanish.

Vector_space_with_projections_and_forces_UPDATED_2018.mw

Vector_space_with_projections_and_forces_UPDATED.mw

Movie #01

https://www.youtube.com/watch?v=VAukLwx_FwY

Movie #02

https://www.youtube.com/watch?v=sIxBm_GN_h0

Movie #03

https://www.youtube.com/watch?v=LOZNaPN5TG8

Lenin Araujo Castillo

Ambassador of Maple

This is a toy example illustrating three possible ways to define a group.

An icosahedron:

with(GroupTheory): with(Student[LinearAlgebra]): with(geom3d):

icosahedron(ii): vv := vertices(ii):

PLOT3D(POLYGONS(op(evalf(faces(ii))), TRANSPARENCY(.75)),
  op(zip(TEXT, 1.1*evalf(vv), [`$`(1..12)])), AXESSTYLE(NONE));

The group of rotations is generated by the rotation around the diagonal (1,4) and the rotation around the line joining the midpoints of the edges (1,2) and (3,4), by the angles 2*Pi/5 and Pi respectively.

Define the group by how the two rotations permute the 6 main diagonals of the icosahedron:

gr := PermutationGroup({[[2, 5, 3, 4, 6]], [[1, 2], [5, 6]]});

IdentifySmallGroup(gr);
                             60, 5

Or define the group by the relations between the two rotations:

gr2 := FPGroup([a, b], [[a$5], [b$2], [a, b, a, b, a, b]]);

IdentifySmallGroup(gr2);
                             60, 5

Finally, define a group with elements that are rotation matrices:

m1 := RotationMatrix(2*Pi/5, Vector(op(4, vv) - op(1, vv))):
m2 := RotationMatrix(Pi, Vector(add(op(3..4, vv) - op(1..2, vv)))):
m1, m2 := op(evala(convert([m1, m2], radical))):

gr3 := CustomGroup([m1, m2], `.` = evala@`.`, `/` = evala@rcurry(`^`, -1), `=` = Equal);

IdentifySmallGroup(gr3);
                             60, 5

AreIsomorphic(SmallGroup(60, 5), AlternatingGroup(5));
                              true

One question is how to find out that the group is actually A₅ without looking up the group (60, 5) elsewhere.

Also, it doesn't matter for this example, but adding `1`=IdentityMatrix(3) to the CustomGroup definition gives an error.