hi

please help me for simplify (factor) this equations.

thanks

vel.mw
 

Download vel.mw

can maple code saved into database for self modifying easily?

self modifying , metaprogramming , database, snapshot, blockchain for code integrity etc

LetterA_Axes_query.mws

  The attached shows animation of the letter A. The animation works fine, and in the plot diagram of the large letter A, the axes are shown.  However, in the second plot (animated), the axes are not being shown, despite clicking on Axes in the animation.  The choices here are Boxed, Framed, Normal or None.

  In the Maple 7 documentation on Axes it states "From the Axes menu choose Ranges...."   ...but I can't see Ranges. 

Any reasons for this?

Hi all, since I cannot use Latex over here I try to formulate as good as possible. Suppose we have the standard integral from a to b of a function f(x), which is equal to:

h * sum (k=1 to N) [c_k f(a+kh)] +O(h^p), where h=(b-a)/N+1, an p(N)>= N+1;

Would it be possible to write a procedure to evaluate the coefficients c_k , k=1,2,3..N and P(N)

Perhaps a stupid question, because I don't know if it is possible.

Best wishes, Math

Hey, 

I run into the same issue quite often. Let's say I have some polynomial over variable like this

I do a substitution on s and get something quite messy as a result. Example:

Now I would like to get the polynomial in the same pole / zero form. I'm sure maple is capable of doing this but I have no clue where to click. Is there an easy way to bring a polynomial over some variable in a standarized form?

Cheers!

Download simplln.mw

with(CodeGeneration)

ua=[ 1 2 3 4];

Matlab(ua);

%How can i write the Output of "Matlab(ua)"  on file so I can use the Matlab "load" command
later on to get the result in Matlab?  

For my own use, I am attempting to port Joe Riel’s glyph package for geometric algebra into a module more compatible with recent versions of Maple. To this end, I have been testing individual procedures extracted from the package into Maple 2016, both to understand the algorithms and to check for glitches caused by the code running in more current Maple 2016. The procedure for carrying out the exterior multiplication of blades does not seem to work reliably, and I haven’t the necessary knowledge of Maple language to determine whether this is due to an error on my part or a feature of Maple V that no longer works.  I have attached a worksheet,tablemultiplyexample.mw,  that includes the procedures necessary for the multiplication routine to work, but I can’t get any consistency in the results.  Can anyone advise me what is the problem?  

As I understand the routine, setup defines a anti-symmetric root blade table with an indexing function that precludes assignment to the table. Clifford blades are then represented as indexed variables using the root table. The process is as follows see worksheet for actual code):

initialize := proc ()
 global _e, tableroot;
tableroot := table(antisymmetric, blade);
tableroot[] := 1;
_e := tableroot;
end proc:
#The index function `blade` is as follows:

`index/blade` := proc (Indices, tableau)
 if nargs = 2 then if Indices = [] then 1
          else tableau[op(checkindices(Indices))] end if
elif Indices = [] then tableau[Indices[]] := 1
 else ERROR("cannot assign to a blade", Indices) end if
end proc;

#Exterior multiplication is performed by the following routine.
b_exteriorp := proc (u, v)
option remember;
 if  u = 1 or v = 1 then u*v
else _e[op(u), op(v)] end if
end proc:

As near as I understand, the procedure joins the lists representing the two input blade into a single list that is processed by the antisymmetric indexing function and outputs the indexes as the product blade. I don’t understand how the case of duplicate indexes (which should return 0) is supposed to be handled by the procedure.  What the procedure usually returns is simply the appended list of the two blades without modification by the indexing function.

Can anyone give me a hint about how to fix this procedure?

tablemultiplyexample.mw

I am trying to input data via a data table. Have several problems here.

I used an array because I want the row and column numbers to start at 0.

1st When the table appers after that the document runs hediously slow as in a second or two to enter a digit or letters appear after typing.  Like something is absorbing the computer resources. But I have a fast machine.

2nd Any data I  enter to the table vanishes but does get stored.

3rd I tried to turn it all into a procedure but cant get that to work.
 

Download DataTable_Experiment.mw

Hi all,

I have a bunch of polynomials in q that involve unknown roots of unity and I want to bound them above by another polynomial.

For example: f(q):=q³-a*q²+b*q²-5.

Here a and b are powers of some roots of unity. These roots/powers depend on some variables which are unimportant.

My incorrect method up until now was to let all root of unity equal 1 so they vanish, and then run a short script that finds all coefficients of the poly f and makes them positive. 

But in this case it returns an answer of q^3+5 as the quadratic terms vanish - I don;t want this to happen! I really want the bound q³+2*q²+5.

If I run the script that changes the coefficients first, then maple can't  recognise if -a is positive or negative and so this doesn't work. If it helps this is it:

f:=g[i,j]; 
coffs:=[];
for m from 0 to degree(f) do
   coffs:=[op(coffs), abs(coeff(f,q,m))] end do;
fabs:=0;
for m from 1 to degree(f,q)+1 do
   fabs:=fabs+coffs[m]*q^(m-1) end do;
      g[i,j]:=fabs end do;
                     end do;
Any ideas would be great. Thanks!

EDIT: to perhaps make it clearer. The kind of roots of unity i'm dealing with are things like z^{2*j*k+q*k+(1/2)*l} where z is a (q-1)th root of unity, and j,k,l are unknown integer variables. 

Hi everybody,

I use dsolve(..., numeric, events =[...], parameters = [...], range=0..TMAX) to solve a parameterized system of 2 ODEs (unknowns x(t) and v(t)).

The solution over the whole range [0, TMAX] is constructed by assembling partial solutions over adjacent subranges of [0, TMAX].

(please look the attached file and feel free to contact me if you need more details than those given below

There exist two types of solution :

• Type 1 : trivial solution : for all t in some range [a>=0, b<= TMAX], the solution is x(t)=0 and v(t)=0
• Type 2 : for all t in some range [b>=0, c<= TMAX] {x(t), v(t)} is the solution of the differential system

The end of the simulation corresponds :

• either to t=TMAX
• either to x(t) = CMAX where CMAX is some predefined value for x(t)
   

I use events to manage the two following situations 

• x(t) = CMAX
• x(t) = 0 and v(t) < 0 : this is the situation which describes the transition between Type 2 solutution and Type 1 solution

The global solution is constructed by assembling partial solutions over subranges [0, b[1]], [b[1], b[2]], [b[2], b[3]] ... where type 1 solutions "live" in [b[n], b[n+1]] if n is odd and type 2 solutions in  [b[n], b[n+1]] if  n is even.
 
The assembly of the partial solutions doesn't work correctly : I identified the reason but I'm not capable to fix it.
If you look to the red instructions on yellow background you will see they do not return the same answer than the pink instructions (look to the blue outputs over the plot) . 

This is probably due to a very big mistake on my part  but I can't fix it !

Once again, if my explanations are not sufficient or if I'm not enough clear, feel free to ask me any questions you need.

Thanks in advance

ParametricDsolve.mw

Why is maple showing 1D math when evaluating?

Dear sir,

I request to provide the procedure to evaluate the following double integral in steps. Please find the enclosed attachment

I wanted to calculate the bessel function's limit, but there is no results.

Download test.mw

Below is my attempt to distinguish between add vs sum commands.  In principle, the sum command is symbolic.  I attempt the comparison in general, but get an error for the add command.  This error appears to occur if I do not assign numeric values to the general variables in the function.  I would like to execute the comparison symbolically.  Can this be done or does add only execute numerical evaluations?

Download sum_vs_add.mw

sum_vs_add.mw