MaplePrimes Questions

I asked an LLM to provide an expansion of the MacDonald function of arbitrary order (a modified Bessel function of the second kind with purely imaginary order and positive argument), K(I*y,r), as a weighted sum of MacDonald functions of integer order. It came back with

         K(I*y,z)=2*sinh(Pi*y)/Pi* [K(0,r)/2*y+sum( (-1)^n*y*BesselK(0,r)/(y^2+n^2),n=1..infinity)]

(see below for more readable text)

I evaluated the LHS and RHS using MAPLE 2026 for various choices of y and r and found numerical agreement using both "sum" and "Sum".  I was very pleased until I realized that the RHS isn't a convergent series!

Can anyone explain to me how MAPLE pulls this off! 

(I asked MAPLE Tech Support but they said it is above their pay grade... I suspect that MAPLE is using Borel summability to evaluate the RHS but I haven't been able to verify that)

I apologize, but I can't see how to attach a .mw file, so I've cut and pasted the code below

 

 

 

restart;

T := R(xi)*R(xi) + lambda;

u := A[0] + A[1]*R(xi) + B[1]/R(xi);

d[1] := A[1]*T - B[1]*T/R(xi)^2;

d[2] := 2*A[1]*R(xi)*T - 2*B[1]*T/R(xi) + 2*B[1]*(R(xi)^2 + lambda)*T/R(xi)^3;

expand(((-alpha^2*b^2 + a^2)*alpha^2)/(2*beta)*d[2] + (omega + alpha^2*(alpha^2*l^2 + k^2)/2 - a*C[1]/(-alpha^2*b^2 + a^2))*u[0]/(beta - 2*beta*a^2/(-alpha^2*b^2 + a^2)) + u[0]*u[0]*u[0]);

value(%);

simplify(%);

collect(%, R(xi));


      /      6  4    4      2\      3
 A[1] \-alpha  b  + a  alpha / R(xi) 
 ------------------------------------
             /     2  2    2\        
        beta \alpha  b  + a /        

                  /      6  4    4      2\         
      A[1] lambda \-alpha  b  + a  alpha / R(xi)   
    + ------------------------------------------ + 
                     /     2  2    2\              
                beta \alpha  b  + a /              

                         /                               /     
             1           |/                    B[1] \    |     
   --------------------- ||A[0] + A[1] R(xi) + -----|[0] |beta 
        /     2  2    2\ \\                    R(xi)/    \     
   beta \alpha  b  + a /                                       

                                                  2
   /     2  2    2\ /                    B[1] \    
   \alpha  b  + a / |A[0] + A[1] R(xi) + -----|[0] 
                    \                    R(xi)/    

      1  2  2      6   1 /  2  2    2  2\      4
    + - b  l  alpha  + - \-a  l  + b  k / alpha 
      2                2                        

                                                       \\
      /  1  2  2    2      \      2    2               ||
    + |- - a  k  + b  omega| alpha  - a  omega + a C[1]||
      \  2                 /                           //

                  /      6  4    4      2\
      B[1] lambda \-alpha  b  + a  alpha /
    + ------------------------------------
               /     2  2    2\           
          beta \alpha  b  + a / R(xi)     

            6  4       2         4      2       2     
      -alpha  b  lambda  B[1] + a  alpha  lambda  B[1]
    + ------------------------------------------------
                     /     2  2    2\      3          
                beta \alpha  b  + a / R(xi)           

WHen I open many worksheets at same time, say 10. The new UI do not stack them all (i.e. the tab at the top), forcing one to use the small arrow to navigate to each worksheet.

Is there a way to tell the UI to show all tabs (may be double rows and 3 rows as needed) to make it easier to jump from one worksheet to the other?

I do not know if this is new feature in the new ribbon UI or not. 

Here is screen show where I have 10 worksheets open

There is also a pull down menu, but it only shows 8 worksheets and one can have more open but they do not show. So have to scroll down looking for the rest. Even that does not work well. many times when I try to scroll down, the window closes. It will not give me time to move the mouse to the scroll bar to move it before it closes.

Both of these solutions are not good. Having to use the arrow key to look and navigate for a different worksheet is bad UI design.

How to see all tabs for all open worksheet in same UI?  If the tabs do not fit on one row, why not make second row? If two rows do not fit, make 3rd row. This should be an option for the user. But I did not see one so far. But will keep looking.

I find tabs where all worksheet show much better design that this UI design.   

I only use worksheet and not document mode. Windows 10.

To give you idea what I mean, These are examples found on the net of stacked tabs

 

 

Where in Maple, each tab above will have the name of the worksheet open. Font can be small, is OK.

Is it possible to have this in the new UI for open worksheets?

One option I might try to make my worksheets names much shorter. May be then they will fit all in same window.

The below problem has already occured several times to me. In all such instances Maple did not realise that extracting a factor from a square root is the key for further simplification. Doing this by hand is obvious and often easy when extracted factors are positive.  

Did I overlook something? Are there other ways avoid disassembling an expression with the op command?
Should simplify or other commands be improved to adress such problems?

restart

How to transform the left-hand side by commands that it matches the right-hand side

sqrt(x__0+1)*sqrt(-2*beta^2*x__0-2*beta^2+4)*sqrt(-(x__0+1)*(beta^2-1))/((beta^2*x__0+beta^2-2)*(beta^2*x__0+beta^2-x__0-1)) = 2/(sqrt(-beta^2+1)*sqrt(-2*beta^2*x__0-2*beta^2+4))

(x__0+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2)*(-(x__0+1)*(beta^2-1))^(1/2)/((beta^2*x__0+beta^2-2)*(beta^2*x__0+beta^2-x__0-1)) = 2/((-beta^2+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2))

(1)

assumptions := 0 < x__0 and x__0 < 1, 0 < beta and beta < 1

0 < x__0 and x__0 < 1, 0 < beta and beta < 1

(2)

`assuming`([simplify(lhs((x__0+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2)*(-(x__0+1)*(beta^2-1))^(1/2)/((beta^2*x__0+beta^2-2)*(beta^2*x__0+beta^2-x__0-1)) = 2/((-beta^2+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2))))], [assumptions])

-(4+(-2*x__0-2)*beta^2)^(1/2)/((-beta^2+1)^(1/2)*(-2+(x__0+1)*beta^2))

(3)

I have tried the usual simplify and combine commands to remove the square root from the numerator.
Extracting a factor for -2 from the square root would probably make further simplification possible but there is no simple command to do so.

Factor_ := -2

-2

(4)

old := simplify([op(denom(-(4+(-2*x__0-2)*beta^2)^(1/2)/((-beta^2+1)^(1/2)*(-2+(x__0+1)*beta^2))))])

[(-beta^2+1)^(1/2), -2+(x__0+1)*beta^2]

(5)

new := old; new[1] := old[1]/Factor_; new[2] := old[2]*Factor_

[-(1/2)*(-beta^2+1)^(1/2), 4-2*(x__0+1)*beta^2]

(6)

subs(1/old[1] = 1/new[1], 1/old[2] = 1/new[2], -(4+(-2*x__0-2)*beta^2)^(1/2)/((-beta^2+1)^(1/2)*(-2+(x__0+1)*beta^2)))

2*(4+(-2*x__0-2)*beta^2)^(1/2)/((-beta^2+1)^(1/2)*(4-2*(x__0+1)*beta^2))

(7)

expand(simplify(2*(4+(-2*x__0-2)*beta^2)^(1/2)/((-beta^2+1)^(1/2)*(4-2*(x__0+1)*beta^2))))

2/((-beta^2+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2))

(8)

2/((-beta^2+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2)) = rhs((x__0+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2)*(-(x__0+1)*(beta^2-1))^(1/2)/((beta^2*x__0+beta^2-2)*(beta^2*x__0+beta^2-x__0-1)) = 2/((-beta^2+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2)))

2/((-beta^2+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2)) = 2/((-beta^2+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2))

(9)

is(2/((-beta^2+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2)) = 2/((-beta^2+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2)))

true

(10)

Second approach after "discovering" that content works also on square roots

[op(-(4+(-2*x__0-2)*beta^2)^(1/2)/((-beta^2+1)^(1/2)*(-2+(x__0+1)*beta^2)))]

[-1, 1/(-beta^2+1)^(1/2), (4+(-2*x__0-2)*beta^2)^(1/2), 1/(-2+(x__0+1)*beta^2)]

(11)

mul(`~`[`*`](`~`[content]([-1, 1/(-beta^2+1)^(1/2), (4+(-2*x__0-2)*beta^2)^(1/2), 1/(-2+(x__0+1)*beta^2)]), `~`[primpart]([-1, 1/(-beta^2+1)^(1/2), (4+(-2*x__0-2)*beta^2)^(1/2), 1/(-2+(x__0+1)*beta^2)])))

-2^(1/2)*(-beta^2*x__0-beta^2+2)^(1/2)/((-beta^2+1)^(1/2)*(beta^2*x__0+beta^2-2))

(12)

simplify(-2^(1/2)*(-beta^2*x__0-beta^2+2)^(1/2)/((-beta^2+1)^(1/2)*(beta^2*x__0+beta^2-2))) = rhs((x__0+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2)*(-(x__0+1)*(beta^2-1))^(1/2)/((beta^2*x__0+beta^2-2)*(beta^2*x__0+beta^2-x__0-1)) = 2/((-beta^2+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2)))

2^(1/2)/((2+(-x__0-1)*beta^2)^(1/2)*(-beta^2+1)^(1/2)) = 2/((-beta^2+1)^(1/2)*(-2*beta^2*x__0-2*beta^2+4)^(1/2))

(13)

is(%)

true

(14)

NULL

Context: The left-hand side in an integrand which was produced by a change of variables in a elliptic integral. Maple simplifies only halfway which makes validation of the result of the variable change difficult.  

NULL

Related functional programming question: Is a onliner `...`(-(4+(-2*x__0-2)*beta^2)^(1/2)/((-beta^2+1)^(1/2)*(-2+(x__0+1)*beta^2)))from the above content-primpart construct possible?NULL

Download Simplify_radical_02.mw

Help me rewrite the code to create visible Bar chart of different colors. I can't figure out why this code is not giving me a visible bar graph

restart; with(Statistics); with(plots); Data := [45, 38, 51, 67, 74, 91]; P := BarChart(Data, tickmarks = [[1 = "Chemical Vector Control", 2 = "Resistant Cultivars", 3 = "Roguing & Sanitation", 4 = "u1+u2", 5 = "u1+u3", 6 = "Integrated"], default], width = .75); T := textplot([[1, 48, "45%"], [2, 41, "38%"], [3, 54, "51%"], [4, 70, "67%"], [5, 77, "74%"], [6, 94, "91%"]], font = ["TIMES", "BOLD", 12]); display([P, T], title = "Figure 20: Comparative Effectiveness of Optimal Control Strategies", labels = ["Control Strategies", "Reduction in Coinfection Burden (%)"], labelfont = ["TIMES", "BOLD", 14], titlefont = ["TIMES", "BOLD", 16], axes = boxed, gridlines = true, view = [.5 .. 6.5, 0 .. 100], size = [1000, 650])

 
 

NULL

Download Bargraph.mw

restart;
with(plottools);
with(plots);
a := 1;
b := 1;
c := 1;
k := 1;
l := 1;
omega := 1;
A[2] = 2;
alpha := 2;
beta := 1;
kappa := 0.5;
C[1] := 1;
lambda := -1;

omega := (-alpha^6*b^4*lambda + 2*alpha^6*b^2*l^2 - 2*a^2*alpha^4*l^2 + 2*alpha^4*b^2*k^2 + a^4*alpha^2*lambda - 2*a^2*alpha^2*k^2 + 4*a*C[1])/(-4*alpha^2*b^2 + 4*a^2);

a[0] := 0;

a[1] := sqrt(-(-alpha^2*b^2 + a^2)/(4*beta))*alpha;

b[1] := sqrt(-(alpha^2*b^2*lambda*sigma - a^2*lambda*sigma)/(4*beta))*alpha;

sigma := A[1]*A[1] - A[2]*A[2];

T := A[1]*sinh(xi*sqrt(-lambda)) + A[2]*cosh(xi*sqrt(-lambda)) + mu/lambda;

t := diff(T, xi);

S := t/T;

R := 1/T;

mu := 0;

A[1] := 0;

y := 0;

xi := k*x^kappa/kappa + l*y^kappa/kappa - omega*t^kappa/kappa;

  Error, recursive assignment

Dear all,

I'm reporting what seems to me as a bug in the SMTLIB library in maple. 

    |\^/|     Maple 2026 (X86 64 LINUX)
._|\|   |/|_. Copyright (c) Maplesoft, a division of Waterloo Maple Inc. 2026
 \  MAPLE  /  All rights reserved. Maple is a trademark of
 <____ ____>  Waterloo Maple Inc.
      |       Type ? for help.
> SMTLIB:-Satisfiable({x^2=2,y^2=2,x<y});
                                     true

> SMTLIB:-Satisfiable({x^2=2,y^2=2,y<x});
                                     false

> SMTLIB:-Satisfiable({x^2=2,a^2=2,a<x});
                                     true

The Satisfiable command do not output the correct decision on two formulas of equivalent realization by switching x<y (output SAT) to y<x (output UNSAT). I suspect this is because some alphabetical order depandance in the variables as for a<y we get SAT again.

I tried to feed Z3 with the code given by ToString on the problematic formula and I get two different outputs :

  • on the Z3 version 4.8.12 from the ubuntu repository (apt install) I also get the wrong UNSAT output;
  • one the Z3 version 4.17.0 build from the official github repository I finally get the correct SAT output.

Thus, I suspect a version problem in SMTLIB that do not take in account the last updates made in SMT solvers (Z3?).

Many thanks for considering my problem!

restart;
solve({-alpha^4*b^2*lambda*mu*b[1] + a^2*alpha^2*lambda*mu*b[1] + 6*beta*lambda^2*sigma*a[0]*a[1]^2 + 6*beta*mu^2*a[0]*a[1]^2 - 6*beta*lambda*a[0]*b[1]^2 = 0, -alpha^4*b^2*lambda^2*mu*sigma - alpha^4*b^2*mu^3 + a^2*alpha^2*lambda^2*mu*sigma + a^2*alpha^2*mu^3 - 4*beta*lambda^2*sigma*a[0]*b[1] - 4*beta*lambda*mu*b[1]^2 - 4*beta*mu^2*a[0]*b[1] = 0, -alpha^4*b^2*lambda^2*sigma - alpha^4*b^2*mu^2 + a^2*alpha^2*lambda^2*sigma + a^2*alpha^2*mu^2 + beta*lambda^2*sigma*a[1]^2 + beta*mu^2*a[1]^2 - 3*beta*lambda*b[1]^2 = 0, -alpha^4*b^2*lambda^2*sigma - alpha^4*b^2*mu^2 + a^2*alpha^2*lambda^2*sigma + a^2*alpha^2*mu^2 + 3*beta*lambda^2*sigma*a[1]^2 + 3*beta*mu^2*a[1]^2 - beta*lambda*b[1]^2 = 0, -alpha^6*b^4*lambda^2*mu*b[1] + alpha^6*b^2*l^2*lambda^2*sigma*a[0] + alpha^6*b^2*l^2*mu^2*a[0] - a^2*alpha^4*l^2*lambda^2*sigma*a[0] + alpha^4*b^2*k^2*lambda^2*sigma*a[0] - a^2*alpha^4*l^2*mu^2*a[0] + alpha^4*b^2*k^2*mu^2*a[0] + 2*alpha^2*b^2*beta*lambda^2*sigma*a[0]^3 + a^4*alpha^2*lambda^2*mu*b[1] - a^2*alpha^2*k^2*lambda^2*sigma*a[0] - 6*alpha^2*b^2*beta*lambda^2*a[0]*b[1]^2 + 2*alpha^2*b^2*beta*mu^2*a[0]^3 - a^2*alpha^2*k^2*mu^2*a[0] + 2*a^2*beta*lambda^2*sigma*a[0]^3 + 2*alpha^2*b^2*lambda^2*omega*sigma*a[0] - 6*a^2*beta*lambda^2*a[0]*b[1]^2 + 2*a^2*beta*mu^2*a[0]^3 + 2*alpha^2*b^2*mu^2*omega*a[0] - 2*a^2*lambda^2*omega*sigma*a[0] - 2*a^2*mu^2*omega*a[0] + 2*a*lambda^2*sigma*C[1]*a[0] + 2*a*mu^2*C[1]*a[0] = 0, -2*alpha^6*b^4*lambda^3*sigma - 2*alpha^6*b^4*lambda*mu^2 + alpha^6*b^2*l^2*lambda^2*sigma + alpha^6*b^2*l^2*mu^2 - a^2*alpha^4*l^2*lambda^2*sigma + alpha^4*b^2*k^2*lambda^2*sigma + 2*a^4*alpha^2*lambda^3*sigma - a^2*alpha^4*l^2*mu^2 + alpha^4*b^2*k^2*mu^2 + 6*alpha^2*b^2*beta*lambda^2*sigma*a[0]^2 + 2*a^4*alpha^2*lambda*mu^2 - a^2*alpha^2*k^2*lambda^2*sigma - 6*alpha^2*b^2*beta*lambda^2*b[1]^2 + 6*alpha^2*b^2*beta*mu^2*a[0]^2 - a^2*alpha^2*k^2*mu^2 + 6*a^2*beta*lambda^2*sigma*a[0]^2 + 2*alpha^2*b^2*lambda^2*omega*sigma - 6*a^2*beta*lambda^2*b[1]^2 + 6*a^2*beta*mu^2*a[0]^2 + 2*alpha^2*b^2*mu^2*omega - 2*a^2*lambda^2*omega*sigma - 2*a^2*mu^2*omega + 2*a*lambda^2*sigma*C[1] + 2*a*mu^2*C[1] = 0, -alpha^6*b^4*lambda^3*sigma + alpha^6*b^4*lambda*mu^2 + alpha^6*b^2*l^2*lambda^2*sigma + alpha^6*b^2*l^2*mu^2 - a^2*alpha^4*l^2*lambda^2*sigma + alpha^4*b^2*k^2*lambda^2*sigma + a^4*alpha^2*lambda^3*sigma - a^2*alpha^4*l^2*mu^2 + alpha^4*b^2*k^2*mu^2 + 6*alpha^2*b^2*beta*lambda^2*sigma*a[0]^2 - a^4*alpha^2*lambda*mu^2 - a^2*alpha^2*k^2*lambda^2*sigma - 2*alpha^2*b^2*beta*lambda^2*b[1]^2 + 12*alpha^2*b^2*beta*lambda*mu*a[0]*b[1] + 6*alpha^2*b^2*beta*mu^2*a[0]^2 - a^2*alpha^2*k^2*mu^2 + 6*a^2*beta*lambda^2*sigma*a[0]^2 + 2*alpha^2*b^2*lambda^2*omega*sigma - 2*a^2*beta*lambda^2*b[1]^2 + 12*a^2*beta*lambda*mu*a[0]*b[1] + 6*a^2*beta*mu^2*a[0]^2 + 2*alpha^2*b^2*mu^2*omega - 2*a^2*lambda^2*omega*sigma - 2*a^2*mu^2*omega + 2*a*lambda^2*sigma*C[1] + 2*a*mu^2*C[1] = 0}, {omega, a[0], a[1], b[1]});
 

Any explanation why this happens? notice, I did not supply the x and y ranges, let Maple decide.

restart;

interface(version);

`Standard Worksheet Interface, Maple 2026.1, Windows 10, April 28 2026 Build ID 2011354`

plots:-contourplot(y+sin(x),'colorbar'=false,':-contours' = 2,size=[100,100]);

plots:-contourplot(y+sin(x),'colorbar'=false,':-contours' = 1,size=[100,100]);

Error, (in plot/iplot2d) numeric exception: division by zero

 

 

Download bug_in_contourplot.mw

nowday i am very intrested in this method which really i something intresting  i want to generate all the type of function not just thus in this paper  i will update the other  layers too but need sometime, i try to apply the exact layer  as author did in this paper but i did something mistake in one part about finding the parameters  i didnt fix that part but i did the second  part of the paper and i got answer, but for first one i need some help, also if possible  it will be amazing if someone can construct the all layer which can be construct , this is just two cases i provide here and in one of them i am stuck and i can't find the parameter but other i did it , target  of finding in apply the formula  for more  hiden layer  becuase in other papers i saw a lot of the  hiden layer i want to apply all of them if possible not jsut tw or three of them i want to know  and see how many hiden layer exist by constructing generate function, and the graph i am not sure maple can do that or not like fig 1 and fig 2 which if do that it will  be more amazing 

thank you for any help 

 

 

t1 have problem about  first case of layer and t2 dont have problem

I asked Maple AI what a glyph is. Then I prompted this

A kernel lost message was returned and the AI pannel became irresponsive.

Maple is still running well in exsisting and new tabs. 

Can the AI service be restarted from the user interface?

(Is that crash reproducible?)

 

Edit:

For exercises involving Pick's Theorem, I need grid points within a Cartesian coordinate system. How can "all" grid points - at least within the first quadrant - be generated without the tedious manual entry of integer coordinates? Is it possible to draw grid polygons as closed polylines simply by clicking on the grid points? (BTW: At the moment, this works well in the good old "Cabri.")
My search within the "Help" section (using terms such as plot, grid, mesh, lattice, etc.) proved unsuccessful.

The HTML characters in the attached document cause problems here on MaplePrimes. You have to open the worksheet

Download HTML_characters_in_math_mode.mw

05-2-2.mws

Can you help me with this code?

restart: with(VectorCalculus):

assume(g>0,Omega>0,V0>0,theta>0,alpha>0,alpha<=Pi/2):

alias(omega=w,Omega=W,alpha=a):

w:=<-W*cos(a),0,W*sin(a)>;

Vector(3, {(1) = -W*cos(a), (2) = 0, (3) = W*sin(a)})

(1)

r:=<x(t),y(t),z(t)>; v:=diff(r,t);

Vector(3, {(1) = x(t), (2) = y(t), (3) = z(t)})

Vector(3, {(1) = diff(x(t), t), (2) = diff(y(t), t), (3) = diff(z(t), t)})

(2)

F[gravity]:=<0,0,-g>;

Vector(3, {(1) = 0, (2) = 0, (3) = -g})

(3)

F[Coriolis]:=-2*w &x v;

Vector(3, {(1) = 2*W*sin(a)*(diff(y(t), t)), (2) = -2*W*cos(a)*(diff(z(t), t))-2*W*sin(a)*(diff(x(t), t)), (3) = 2*W*cos(a)*(diff(y(t), t))})

(4)

F[centrifugal]:=-w &x (w &x r);

Vector(3, {(1) = W*sin(a)*(W*cos(a)*z(t)+W*sin(a)*x(t)), (2) = W^2*cos(a)^2*y(t)+W^2*sin(a)^2*y(t), (3) = W*cos(a)*(W*cos(a)*z(t)+W*sin(a)*x(t))})

(5)

F[resultant]:=F[gravity]+F[Coriolis]+F[centrifugal];

Vector(3, {(1) = 2*W*sin(a)*(diff(y(t), t))+W*sin(a)*(W*cos(a)*z(t)+W*sin(a)*x(t)), (2) = -2*W*cos(a)*(diff(z(t), t))-2*W*sin(a)*(diff(x(t), t))+W^2*cos(a)^2*y(t)+W^2*sin(a)^2*y(t), (3) = -g+2*W*cos(a)*(diff(y(t), t))+W*cos(a)*(W*cos(a)*z(t)+W*sin(a)*x(t))})

(6)

eq:=(u,i)->simplify(diff(u(t),t,t)=F[resultant][i]):

xeq:=eq(x,1); yeq:=eq(y,2); zeq:=eq(z,3);

xeq := diff(x(t), `$`(t, 2)) = Omega*sin(alpha)*(Omega*sin(alpha)*x(t)+Omega*cos(alpha)*z(t)+2*(diff(y(t), t)))

yeq := diff(y(t), `$`(t, 2)) = Omega*(y(t)*Omega-2*(diff(z(t), t))*cos(alpha)-2*(diff(x(t), t))*sin(alpha))

zeq := diff(z(t), `$`(t, 2)) = sin(alpha)*cos(alpha)*x(t)*Omega^2+cos(alpha)^2*z(t)*Omega^2+2*Omega*cos(alpha)*(diff(y(t), t))-g

(7)

ic:=x(0)=0,y(0)=0,z(0)=0,D(x)(0)=0,D(y)(0)=V0*cos(theta),D(z)(0)=V0*sin(theta);

ic := x(0) = 0, y(0) = 0, z(0) = 0, (D(x))(0) = 0, (D(y))(0) = V0*cos(theta), (D(z))(0) = V0*sin(theta)

(8)

sol:=dsolve({xeq,yeq,zeq,ic},{x(t),y(t),z(t)},method=laplace):

assign(sol):

f:=u->simplify(expand(u(t))): X:=f(x); Y:=f(y); Z:=f(z);

X := -(1/4)*(Omega^4*V0*sin(theta)*cos(alpha)*(sum(exp(_alpha1*t)/((Omega^2+_alpha1^2)*_alpha1), _alpha1 = RootOf(Omega^2+_Z^2)))+cos(alpha)*g*(sum(exp(_alpha1*t)*_alpha1^2/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))-sin(theta)*cos(alpha)*V0*(sum(exp(_alpha1*t)*_alpha1/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))*Omega^2+(-2*Omega^3*cos(theta)*V0+3*cos(alpha)*Omega^2*g)*(sum(exp(_alpha1*t)/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))+4*(Omega^2*t*V0*sin(theta)-(1/2)*Omega^2*t^2*g-g)*cos(alpha))*sin(alpha)/Omega^2

Y := (1/4)*(-V0*cos(theta)*Omega^2+2*cos(alpha)*Omega*g)*(sum(exp(_alpha1*t)/((Omega^2+_alpha1^2)*_alpha1), _alpha1 = RootOf(Omega^2+_Z^2)))-(1/2)*sin(theta)*cos(alpha)*V0*Omega*(sum(exp(_alpha1*t)/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))+(1/4)*V0*cos(theta)*(sum(exp(_alpha1*t)*_alpha1/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))

Z := (1/4)*(-Omega^4*cos(alpha)^2*V0*sin(theta)*(sum(exp(_alpha1*t)/((Omega^2+_alpha1^2)*_alpha1), _alpha1 = RootOf(Omega^2+_Z^2)))-cos(alpha)^2*g*(sum(exp(_alpha1*t)*_alpha1^2/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))+cos(alpha)^2*sin(theta)*V0*(sum(exp(_alpha1*t)*_alpha1/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))*Omega^2+(2*Omega^3*cos(alpha)*cos(theta)*V0-3*Omega^2*g*cos(alpha)^2)*(sum(exp(_alpha1*t)/(Omega^2+_alpha1^2), _alpha1 = RootOf(Omega^2+_Z^2)))+(-4*Omega^2*t*V0*sin(theta)+2*Omega^2*t^2*g+4*g)*cos(alpha)^2+4*Omega^2*t*V0*sin(theta)-2*Omega^2*t^2*g)/Omega^2

(9)

P:=(u,n)->convert(taylor(u,W=0,n),polynom):

Xexp:=P(X,4); Yexp:=P(Y,4); Zexp:=P(Z,4);  

Error, (in series/sum) unable to compute series

Error, (in series/sum) unable to compute series

Error, (in series/sum) unable to compute series

 

tt:=solve(Zexp=0,t);

tt :=

(10)

 T1:=P(tt[2],1); d[x]:=eval(Xexp,t=T1);  

Error, invalid subscript selector

d[x] := Xexp

 

T2:=P(tt[2],2); d[y]:=P(eval(Yexp,t=T2),2);

Error, invalid subscript selector

d[y] := Yexp

 

d[y]:=collect(d[y],[cos(a),1/g^2,V0^3,W]);

d[y] := Yexp

(11)

parameters:={a=Pi/4,theta=Pi/3,V0=500,W=7.27*10^(-5),g=9.8}:

d[x]:=eval(d[x],evalf(parameters));

d[x] := Xexp

(12)

d[y]:=eval(d[y],evalf(parameters));

d[y] := Yexp

(13)
 

 

Download 05-2-2.mws

Can anyone share additional information about the Maple conference to be held in 2026? I want to submit a talk and then submit a paper to the Maple Transactions journal based on the same.

1 2 3 4 5 6 7 Last Page 1 of 2462