Maple Questions and Posts

These are Posts and Questions associated with the product, Maple

 Hi, I've been trying to solve these PDE below 

Omega*(diff(c(y, t), t))+6*pe*Lambda*(-y^2+y)*cos(2*Pi*x)+pe = diff(c(y, t), y, y)

BC = diff(c(t,1),y)=0,diff(c(t,0),y)=0 

I have got the solution. but could not implement the boundary condition ( maybe those conditions are not correct,/ suggestion needed )

and also have to eliminate those arbitrary constants. pde.mw

 

 

Hello everyone!
Could you help me with the next problem:

1. I have a nonlinear pde system(two equations, two unknown functions: tau(t, r) & R(t, r)) of hyperbolic type.

2. And I have no idea how to solve it.

3. But I know some interesting things about it:

  • In direct variables (tau(t, r) & R(t, r)) this is a nonlinear system maple2.mw
  • But in inverse variables (t(tau, R) & r(tau, R)) it splits into two independent linear differential equations.maple3.mw And we can get a solutions of each in HeunC functions(it would be great if maple could give me an inverse Heun's functions, I couldn't find how). 

4(last). I have a condition in which one of two equtaions = 0, (this condition: tau(t, r) = t) and now I want to try to see what one of the unknown functions(R(t, r)) looks like. But I can not use numeric values. The system describes a spherical gravitational wave, depends on time and distance. r > mass so i want to see some discrete solutions of R(t, r)(jpeg file).the dimensions of t and r are the same. Maybe you have some ideas?
 

In the realm of tetrads where both world indices and Lorentz indices are present, contractions, say, using simultaneously the Minkowskian (galilean) Levi-Civita symbol,

and the curvilinear Levi-Civita (pseudo-)tensor,

can be considered. Although each of the two types of Levi-Civitas can easily be obtained separately by specifying Setup(levicivita = galilean) or Setup(levicivita = nongalilean), I cannot figure out how to have them both available at the same time. Any suggestions?

PS: I am, of course, aware of the fact that the two Levi-Civitas are related by some appropiate square-root of the determinant of the metric, but I have no desire to fiddle around with explicit such determinants if they can be avoided.

This is probably a question to Edgardo: In another thread, the following quantity is considered [Eqs. (5) and (6) combined]:

expand(gamma_[definition]);

This is all very well, but it seems to depend on the metric loaded: if the Schwarzschild metric g_[sc] is loaded, then the above output results, but if the Minkowski metric g_[minkowski] is loaded, then the output of the above expansion is identically zero. Does that make sense? Is that intentional? The explicitly evaluated Ricci rotation coefficients vanish identically for the Minkowski metric, of course, but if evaluation is performed for that case, then why not also for the Schwarschild metric [not meaning to say that I want evaluation]?

In the following codes I am very sure exp(-3*q) is a factor both at numerator and denominator. However, I dont know how to annihilate this factor. Can someone kindly help to ensure it cancels out? Thanks and kind regards.

restart:
s:=(sum(a[j]*x^j,j=0..2)+sum(a[j]*exp(-(j-2)*x),j=3..4)):
F:=diff(s,x):
p1:=simplify(eval(s,x=q))=y[n]:
p2:=simplify(eval(F,x=q))=f[n]:
p3:=simplify(eval(F,x=q+h))=f[n+1]:
p4:=simplify(eval(F,x=q+3*h/2))=f[n+3/2]:
p5:=simplify(eval(F,x=q+2*h))=f[n+2]:

vars:= seq(a[i],i=0..4):
Cc:=eval(<vars>, solve({p||(1..5)}, {vars})):
for i from 1 to 5 do
	a[i-1]:=Cc[i]:
end do:
Cf:=s:
T:y[n+2]=collect(simplify(eval(Cf,x=q+2*h)), [y[n],f[n],f[n+1],f[n+3/2],f[n+2]], recursive);

 

Does anyone know why Maple doesn't simplify the following expression?

Thanks!

 

Hi dears,

I hope that my request (question) is appropriate for Mapleprimes.

I know Gröbner bases and Buchberger's algorithm and I want to understand  the F4-algorithm. However, I know that  the corresponding paper can be found:

https://www.sciencedirect.com/science/article/pii/S0022404999000055 

Could you please state the sketch and main parts of the algorithm s.t. I can understand it?
Is there any primary Maple implementation of F4-algorithm?

Thanks in advance.

I believe I've found a bug, where Eigenvectors returns two eigenvectors which are the same (even though the eigenvalues are different). The expressions involves RootOf's, and it seems that the eigenvalues use "index" to distinguish themselves, yet the eigenvectors do not.

with(LinearAlgebra);

x := RootOf(z^2-t, z);
m := Matrix(2, (i,j) -> evala(add(a[j, k]*((-1)^(i-1))^k*x^k, k = 0..1)));
ev := Eigenvectors(m);


 

sin(Pi/12);

(1/4)*6^(1/2)*(1-(1/3)*3^(1/2))

(1)

 


 

Download calculation.mws

can anyone explain to me this result ?

in the book "maple by example" they said that sin(Pi/12);
sin (1/12 π)
returns sin(π/12) because it does not know a formula for the explicit value of sin(π/12). but when i'm calculated this in maple i had got , this result, what does this result mean ?

 

hello,

this is my first post here so sorry if it's done wrong...

I'm having difficulties with the following command because maple only returns a solution if the first two boundary conditions of the "if" arguments are true. If the the first or the second condition is false then maple doesn't give a solution solution.

for i to n do if H[i] < 2.7 then if A[i, f] < 12 then if A[i, o] < 1.2 then Q[i, foo] := evalf(610*(A[i, o]*sqrt(H[i])*h[k]*A[i, T])^(1/2)) else Q[i, foo] := evalf(7.8*A[i, t]+378*A[i, o]*sqrt(H[i])) end if end if end if; print(Q[i, foo]); end do;

I've also tried with the elif command but it gives a similar problem

Anyone knows how to solve this?

suppose for example i am working on the function

exp(-I*Pi*(n+2*n*(m-1))/m);

and i wanted to for what ever reason assign a unique symbol to each of the two times the indeterminant 'n' occurs:

exp(-I*Pi*(n[1]+2*n[2]*(m-1))/m)

How could i accomplish this for any function F?

i have tried the method of

map(op, [op(op(exp(-I*Pi*(n+2*n*(m-1))/m)))]);
                [-1, Pi, n, 2 n (m - 1), m, -1]
 

And though i could then use algsubs on the original function for each in the above list, but then ran into problems arising that for any function the number of times i need to map op in iteration is not known, i will actually work this out by the end of the night so i dont know why im bothering asking

 

Edit 2: yep its ok i discovered subsop

I've created a worksheet that outputs a boggle board.  I think it could be more efficient than the method I came up with but the idea is there.  The only way I could figure to rotate the letters was to output them to a bmp format then read them back in and use imagetools for rotation.  I used Times Roman font but the font Boggle uses I think is Tunga, Latha or Mangal.  

Note - remove the colon in the last line to produce the output.  One other thing I believe, in Tools->Options-> (uncheck)Limit Expression Length to 1000000  

Saving the file with the output would have produced a file in the tens of Megabytes and may have caused error loading.


 

restart; gc()

with(plots); with(ImageTools)

a := [seq(k, k = "A" .. "Z")]

["A", "B", "C", "D", "E", "F", "G", "H", "I", "J", "K", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U", "V", "W", "X", "Y", "Z"]

(1)

for i in a do plotsetup(bmp, plotoutput = cat("c:/test/", i, ".bmp")); img || i := textplot([0, 1, i, font = ["times", "roman", 200]], axes = none, scaling = constrained) end do
NULL

plotsetup = default

(2)

plotsetup(default)

with(combinat)``

``

Setting up the 16 boggle cubes

 

cube1 := ["H", "E", "E", "N", "W", "G"]

cube2 := ["T", "M", "I", "O", "C", "U"]

cube3 := ["D", "E", "X", "L", "R", "I"]

cube4 := ["S", "P", "F", "A", "K", "F"]

cube5 := ["T", "O", "E", "S", "I", "S"]

cube6 := ["H", "N", "L", "N", "Z", "R"]

cube7 := ["R", "L", "T", "Y", "T", "E"]

cube8 := ["D", "E", "Y", "L", "R", "V"]

cube9 := ["C", "A", "O", "S", "P", "H"]

cube10 := ["Qu", "U", "M", "H", "I", "N"]

cube11 := ["D", "Y", "I", "S", "T", "T"]

cube12 := ["S", "N", "I", "E", "E", "U"]

cube13 := ["T", "O", "O", "W", "A", "T"]

cube14 := ["W", "H", "E", "V", "R", "T"]

cube15 := ["J", "B", "O", "O", "A", "B"]

cube16 := ["N", "A", "E", "A", "E", "G"]

cubes := [seq(cat("cube", i), i = 1 .. 16)]

["cube1", "cube2", "cube3", "cube4", "cube5", "cube6", "cube7", "cube8", "cube9", "cube10", "cube11", "cube12", "cube13", "cube14", "cube15", "cube16"]

(3)

c := randperm(cubes)

["cube13", "cube14", "cube11", "cube6", "cube9", "cube1", "cube16", "cube7", "cube3", "cube2", "cube12", "cube5", "cube4", "cube10", "cube8", "cube15"]

(4)

cc := map(parse, c)

[cube13, cube14, cube11, cube6, cube9, cube1, cube16, cube7, cube3, cube2, cube12, cube5, cube4, cube10, cube8, cube15]

(5)

ccf := [seq(op(randcomb(cc[i], 1)), i = 1 .. 16)]

["A", "H", "I", "N", "A", "N", "E", "T", "D", "M", "E", "S", "K", "N", "E", "O"]

(6)

with(ArrayTools)

g := Reshape(Array(ccf), [4, 4])

Array(%id = 18446744074360417206)

(7)

rr := proc () randcomb([0, 90, 180, 270], 1) end proc

Reshape(Array([seq(display(Preview(Rotate(Read(cat("c:/test/", ccf[i], ".bmp")), op(rr()))), axes = none), i = 1 .. 16)]), [4, 4])
 

````

 

 

 

NULL


 

Download Boggle3-6final.mw

Why input fraction to eigenvector and then evalf output are all the same when input different ?

i would like to see more decimal numbers

digits := 36 

command can not show more decimal numbers

 

why can not see the difference?

 

if start from fraction

After set round screen display to 36 digits in options

If start from floating value

the result different from start from fraction

start from which is the most accurate and correct?

if fraction is correct, why all result are the same even if input are different?

I'm absolutely new in maple, but I need to solve PDE and I don't understand why maple do not solve it

restart; with(PDEtools);
U := diff_table(u(x, t));

pde[1] := U[t, t] = U[x, x]+5*sin(3*x);

bc[1] := eval(U[], x = 0) = 0; bc[2] := eval(U[], x = Pi) = 0;
ic[1] := eval(U[], t = 0) = 0; ic[2] := eval(D[2]*U[], t = 0) = 1;

sys[1] := [pde[1], bc[1], bc[2], ic[1], ic[2]];
pdsolve(sys[1]);

 

Error: Error, (in PDEtools:-Library:-NormalizeBoundaryConditions) unable to isolate the functions {u(0, t), u(Pi, t), u(x, 0)} in the given boundary conditions {D[2]*u(x, 0) = 1, u(0, t) = 0, u(Pi, t) = 0, u(x, 0) = 0}

 

If I solve it  with only boundary conditions or without any conditions, maple gives me an answer. 

Please, help me to understand, how to solve this pde system with boundary and initials conditions. This is my firs use of maple so I hardly understand how to write code correctly.

Real part + complex part

 

but 

sometimes it display

complex part + real part 

how to consistent display real part + complex part?

First 869 870 871 872 873 874 875 Last Page 871 of 2249