MaplePrimes Questions

Hello

This is a sawtooth GIF from the wikipage Sawtooth wave 

I want to recreate this animation in Maple. Could someone help me out with the formula to create this

 

 

What have I done!

Whatever I have created - Maple doesn't think it is a list.

The question is - what is it then?

proclist.mw

I'm trying to obtain the dynamical response of a simply-supported beam with a cantilever extension, coupled to a spring-mass system. In mathematical terms, this system is ruled by three PDEs (relative to each bare part of the main structure) and one ODE (relative to the spring-mass system). I think my mathemical model is finely formulated, but Maple keeps telling me this:

Error, (in pdsolve/numeric/process_IBCs) improper op or subscript selector

I believe it is because my PDEs depend on "x" and "t", while the ODE depends solely on "t". I have tried to transform my ODE into a "PDE", making it also dependent of "x", but without imposing any boundary conditions relative to "x". However, after this Maple points a new error message:

Error, (in pdsolve/numeric) initial/boundary conditions must be defined at one or two points for each independent variable

Could someone help me finding a solution? My algorythm in shown in the attached file below.

Worksheet.mw

I'm trying to plot this integral but without success. Could someone help me?  I tried it the following way.

Thanks in advance for any help!

integral_test.mw

 

Hello everyone, we are doing some excercises on graphs. The commands PetersenGraph and GeneralisedPetersenGraph only draw an indirected one, and i was wondering, is there a way to draw a directed Petersen graph?

Here's a very simple example, working as intended:

 

 

Now, if I try to use the exception indexing function:

 

 

We can notice that b[1] isn't using exception anymore (as if the fourth input overwrote the second one) and that b[1][2] isn't linked to the value "two". However, if I define the tables first, I get the expected result:

 

 

Why does the exception indexing function prevent me from getting an existing table entry in the second case?

Hi,

how to generate a graph of ellipsoid from ellipse equation ( revolution x axis or y axis) ?

Thanks

QEllipsoide.mw

Hi Guys,

I am trying to intgrate a function involving hyperbolic functions in a range of 0 to 1 and it is giving me very large value of 10^94. However, on doing integration terms terms i can see that some large terms involving 10^191 cancel out with each other and I can have a fnite value of this integration. It would be really helpful if someone can help me out why it is happening with int function and how can I solve this case involving hyperbolic function. For reference maple file is attached. Thanks in advance and much appreciated.

With Regards

Sunit

question.mw

I've drawn shape with the Graph function and all the lines are drawn as the same length even though the shape is weighted and when I do the WeightMatrix function I get the right weights.  What do I need to do to have the lines drawn to the correct length?

THE ISSUE: It's returning a list of [1] when it should be returning [1,1,1,7]

##Find remainder##
rm := proc(a, b) local n; n := 0; while 0 <= b - n*a do n := n + 1; end do; b - (n - 1)*a; end proc;
rm := proc (a, b) local n; n := 0; while 0 <= b-n*a do n := n+1 

   end do; b-(n-1)*a end proc


rm(8, 3657);
                               1

rm(16, 12345);
                               9

##FINDING THE WHOLE NUMBER PORTION ##
whole := proc(a, b) local r, i; r := 0; i := 0; if a < b then r := rm(a, b); i := (b - r)/a; else 0; end if; end proc;
whole := proc (a, b) local r, i; r := 0; i := 0; if a < b then 

   r := rm(a, b); i := (b-r)/a else 0 end if end proc


whole(8, 3657);
                              457

whole(16, 12345);
                              771

 


j = whole(8, 3657);
                            j = 457

k = rm(8, 3657);
                             k = 1

L := [];
                            L := []

L := [op(L), rm(8, 8657)];
                            L := [1]

j = whole(8, 457);
                             j = 57


##GETTING THE LIST OF DIGITS (BEFORE REVERSING)##
HELPER := proc(a, b, L) local j; j := whole(a, b); [op(L), rm(a, b)]; if 0 < j then HELPER(a, j, L); else ; end if; L; end proc;
HELPER := proc (a, b, L) local j; j := whole(a, b); [op(L), 

   rm(a, b)]; if 0 < j then HELPER(a, j, L) else  end if; L end 

   proc


CNS := proc(a, b) HELPER(a, b, L); end proc;
          CNS := proc (a, b) HELPER(a, b, L) end proc

 

CNS(8, 3657);
                              [1]

 

HELPER(8, 3657, L);
                              [1]

 

Let E all triplets as X=(p,q,r) such as p^2+q^2=r^2. We define the application f of E dans C complex as X in E f(X)=(p+Iq)/r=Z. Calculate abs(Z). Show that in E the law noted * defined by
X1*X2=(p1*p2-q1*q2,p2*q1+p1*q2,r1*r2) is an internal law. Calculate f(X1*X2). Then if X0=(3,4,5), find
X0*X0, X0*(X0*X0).Thank you for the help.

Hello

I wonder if someone on the list can give me some guidelines on how to use Grid:-Seq.

I have applied Grid:-Set and Grid:-Seq to one of my problems where parallelization is a possibility.   In this problem, I have a massive list of lists that needs to be processed in chunks and then a new list is returned.

What I've found so far:

1) Grid-Seq won't work if I use a procedure from a private module that calls local (or exported) functions of the same module.  Solution:  I need to use savelib (there is a bug in Grid:-Seq)

2) Grid-Seqs seems to be working fine up to a point where it simply stops.  For example:   Starting with 431895 sets, the procedure divides them into 864 sets of 500 elements (the last one does not usually contain 500 elements).  Then I use res:=Grid:-Seq['tasksize'=9](myFunction(newSets[i],...,....),i=1..864).   The messages sent out by Grid:-Seq are 

Seq: using tasksize=9; number of elements= 864, number of partitions = 96

......

Seq: done sending all partitions

Seq: received results from all nodes; collating results

After two hours running and using 36 cores, the result is available in res.  The next step is to use the results in res for another cycle of calculations.  1503462 sets = 3007 sets of 500 elements.  The messages sent out by Grid:Seq are 

Seq: using tasksize=9; number of elements= 3007, number of partitions = 335

......

Seq: done sending all partitions

The last message showed up on the screen after an hour. During the process, I saw the current tasks finishing and new ones starting.  However I could not see "Seq: received results from all nodes; collating result" after a day running.  I am using timelimit to be sure that all calculations will finish no matter what.  

I have checked the system information and found that: 1) all 72 cores are running but they are jumping from 0% to 100% (in the example that works I could see all of them in 100% solid), 2) Memory is at 156 GB (200 Gb is the limit) and no swap to disk.

I have also noticed:

  1. If I use Maple 2017, not even the first example works.
  2. tasksize=9 somehow helps with similar problems.  If the size is left for Maple to decide, it seems that the problem happens for sets of smaller size.
  3. On linux I had to use "kill -9" to remove maple from every single core. My impression is that Grid:-Seq does not clean up the processes after they finished.  
  4.  The problem seems to be on "results from all nodes; collating result".

 

I know that the explanation above in rather vague, but if someone has any clue or guidelines on how to solve this problem, please share it with me.

 

Many thanks

 

Ed

 

 

 

Hi All,

https://www.maplesoft.com/support/helpJP/Maple/view.aspx?path=NAG%2ff11dec

This link shows that there are 3 options rgmres, cgs and bicgstab. When I use iterative solver, it uses the cgs option.

LinearAlgebra:-LinearSolve(
      A, b, method= SparseIterative)

LinearSolve:   "copying right hand side to enable external call"
LinearSolve:   "using method"   SparseIterative
LinearSolve:   "using method  "   SparseIterative
LinearSolve:   "calling external function"
LinearSolve:   "using CGS method"
LinearSolve:   "preconditioning with incomplete LU factorization"
LinearSolve:   "level of fill = "   0
LinearSolve:   "using complete pivoting strategy"
LinearSolve:   "dimension of workspaces for preconditioner = "   44
LinearSolve:   "using infinity norm in stopping criteria"
LinearSolve:   "setting maximum iterations to "   200
LinearSolve:   "setting tolerance to "   .10e-7
LinearSolve:   "NAG"   hw_f11zaf
LinearSolve:   "NAG"   hw_f11daf
LinearSolve:   "NAG"   hw_f11dcf
LinearSolve:   "number of iterations"   1
LinearSolve:   "residual computed last as"   3.33066907387547e-016
 

 

How can I force Maple to use BiCGSTAB?

thanks

I think the Maple Physics package has the promise to revolutionize the teaching of physics. Two recent tutorials have been very helpful (“Vectors in Spherical coordinates using tensor notation” and “A Complete Guide for performing Tensors computations using Physics”).   Unfortunately, despite these, I still have problems even when trying to use it for simple things. No doubt this is primarily a sign of my limitations. However, in the hope that others might share this, I have the following question.

As an exercise, I would like to use the Maple Physics Tensor notation to derive the expression for acceleration in spherical coordinates – identifying Coriolis force, etc.  I can’t get past the first step – how to define the tensor dx/dt.   That is, how do I write the time derivative of the Maple space coordinates [X].  I assume that this can be done in about 3 steps, if someone would be kind enough to humor my ignorance. Thanks in advance.

Why on earth is Maple giving me all these solutions compared to last year??

Last year:

Now:

First 555 556 557 558 559 560 561 Last Page 557 of 2426