Hello,

It is not a very important question... but i like when i have a nice worksheet.

I would like to change the color of the maple input. Unfortunately, i manage to change the color for the inputs already created but not for the new maple input.

How can i change the color for the new maple input i want to create ?

Thank you for your help.

I saw the expression:

proc(a::array(1, mumeric))

the decration of a is array(a, numeric).

But, I can't find still now the expression of array(a, numeric) in HELP in maple.

In the term of array, it is written that it takes as arguments indexfcn, bounds, list.

as in  array( indexfcn, bounds, list).

1 in array(1, mumeric)) is bounds, and probably numeric in array might mean each terms of the array such as (1,2,3)

has to take the property of being numeric. But, it is not written in the term of array in the HELP of Maple.

Where can I find that syntax of array of array(1, numeric)?

Thanks in advance.

taro 

How can I solve raychaudhuri equations numerically using GRtensor?

Hi guys, i'm a student from France, so excuse  me in advance for my english.

I'm currently struggling to solve a partial differential equation :

where E,I,Fv,p,S0,L are constants.

When i ask Maple to solve it, here's its answer

But how can i use this solution ? May I use a different method ? Any suggestion ?

here's the code :
[code]E := (1/2)*Fv*(L-y)^2+EI*(diff(x(y, t), `$`(y, 2))) = -(1/12)*p*S0*(diff(x(y, t), t, t))*(L-y)^4/L^2;[/code]

to get the solution type the following code :

[code]pdsolve(E);[/code]

any advice would be appreciated

Thank you for your concern.

g := (-12*y^2+1)/(4*y^2+1)^3 * ln(abs(-1+2^(1-x-I*y)));

Compute Int(g, [x=1/2 .. infinity, y=0 .. infinity]).

PS: this stems from How to calculate hard integral?, 
but it is not related to the RH.

My problem is i am working with a very large randomly generated output, generated using maple's builtin in random generating functions. I have the output which i want to investigate but i want to be able to reproduce this result when i save and close the worksheet. Since the list of generators is very long copy pasting is not very nice and i donot know the seed of these generaters. I want to ask if i can store the values in variable in the worksheet so that when i open the worksheet i can get the same random generates stored in the variable.

Dear All

I have a question about applying fsolve in MAPLE.

These codes come from an applicable model from heat transfer.

I previously solve such systems, but the fsolve takes long time, for example for N=2, I have 12 equations with 12 unknowns. But the fsolve does not work!

I try by N=3 or N=4, but a similar result has been obtained.

If kindly is possible, please give me a help for using fsolve more efficiently that solve my problem.

I have MAPLE 13 in my PC.

With kind regards,

Emran Tohidi.

> restart;
> with(orthopoly);
print(`output redirected...`); # input placeholder
> Digits := 20;
> N := 3; f := proc (x) options operator, arrow; cos(Pi*(x-1/2)) end proc; h1 := proc (t) options operator, arrow; 0 end proc; h2 := proc (t) options operator, arrow; 0 end proc; E := proc (t) options operator, arrow; cos(.2*Pi)*exp(-t^2) end proc;
print(`output redirected...`); # input placeholder
> u := sum(sum(b[m, n]*P(m, 2*x-1)*P(n, 2*t-1), m = 0 .. N), n = 0 .. N);
print(`output redirected...`); # input placeholder
> u := unapply(u, x, t);
print(`output redirected...`); # input placeholder
> ut := diff(u(x, t), `$`(t, 1)); ut := unapply(ut, x, t);
print(`output redirected...`); # input placeholder
> uxx := diff(u(x, t), `$`(x, 2)); uxx := unapply(uxx, x, t);
print(`output redirected...`); # input placeholder
> a := sum(c[m]*P(m, 2*t-1), m = 0 .. N); a := unapply(a, t);
print(`output redirected...`); # input placeholder
> A := fsolve(P(N+1, 2*x-1) = 0);
print(`output redirected...`); # input placeholder
> S1 := {seq(seq(ut(A[i], A[j])-a(A[j])*uxx(A[i], A[j]) = 0, i = 2 .. N), j = 2 .. N+1)}; S2 := {seq(u(A[i], 0)-f(A[i]) = 0, i = 2 .. N)}; S3 := {seq(u(0, A[j])-h1(A[j]) = 0, j = 1 .. N+1)}; S4 := {seq(u(1, A[j])-h2(A[j]) = 0, j = 1 .. N+1)}; S5 := {seq(u(.3, A[j])-E(A[j]) = 0, j = 1 .. N+1)}; S := `union`(`union`(`union`(`union`(S1, S2), S3), S4), S5);
print(`output redirected...`); # input placeholder
> sol := fsolve(S);

Hi. I want to generate a Julia set, and teh first instruction in the demo, applications fractal is

GenerateComplex(a,b,c,d,e)

I have Maple13 and I can not find such instruction. Could you tell me where can I get it, or how to define it?

Thanks

I want to do a step by step computation for obtaining the coefficents of the sine fourier series expansion of f(x)=x over the interval [-L,L]. The steps are as follows:

1-write the fourier expansion as: Sum(A[n]*sin(n*pi*x/L),n=1..N)
2-multiply the series by: sin(m*pi*x/L)
3-integrate the series over the interval [-L,L]
3-using the orthogonality properties of the set {sin(n*pi*x/L} compute the A[n].

I can't do these steps since I have problem with the series manipulations in maple!
Can any one suggest a way from begining to the end?

Thanks. :)
Below shows what I did in Maple 17.

Help Please! :)
As it is seen in the picture, I can not integrate the power series. In contrast, the differentiation works!
what is wrong?

Dear people in Mapleprimes,

I calculated the following Quick Sort algorithm.

restart;
quicksort:=proc(A::array(1,numeric),
m::integer, n::integer) 
local partition, p;

partition:=proc(m,n)
i:=m;
j:=n;
x:=A[j];
while i<j do
if A[i]>x then
A[j]:=A[i];
j:=j-1;
A[i]:=A[j];
else
i:=i+1;
end if;
end do;
A[j]:=x;
p:=j;

end proc:

if m<n then
p:=partition(m,n);
quicksort(A,m,p-1);
quicksort(A,p+1,n);
end if;
eval(A);
end proc:

trace(quicksort);

a:=array([2,4,1,5,3]);

quicksort(a,1,5);

Then, in the answer, there was a sentence that

{--> enter , quicksort, , args = , a, , , 2, , , 2

........................

{--> enter , quicksort, , args = , a, , , 4, , , 5

I could understand the reason of the "{--> enter , quicksort, , args = , a, , , 2, , , 2," 

but, I could not understand why 4, , , 5 could appear here. I think there is no reason why n that is the number at 5 

increased from 2 to 5. I thought n continues to be 2.

I hope you will give me some hint for this understanding.

I thought it with a lot of time. And, I don't know whether this place is an appropriate place to ask this question.

But, I will be very glad if you teach me some of this.

Best wishes.

taro

Download for_clever_guys.mw

i m calculating space of this elipse,i need to find point t1 wherein [XX(t1), YY(t1)] creates full circle and get S(t1). here its between 22.6-22.7. but i need to find it with ~0.1^3  accuracy.

for_clever_guys.mw

Hello

Is it me or is it not possible to hide table borders in Maple 18?

I can not hide the borders when I make tables ind Maple 18..

Jakob

 support type error when plot, and moreover how to animate this plot

restart;
with(ExcelTools):
with(ListTools):
with(DynamicSystems):
filename := "0257.HK";
open3 := Import(cat(cat("C://Temp//HK//Bank//",filename),".xls"), filename, "B2:B100");
high3 := Import(cat(cat("C://Temp//HK//Bank//",filename),".xls"), filename, "C2:C100");
low3 := Import(cat(cat("C://Temp//HK//Bank//",filename),".xls"), filename, "D2:D100");
close3 := Import(cat(cat("C://Temp//HK//Bank//",filename),".xls"), filename, "E2:E100");
with(CurveFitting):
n := 31;
f := Vector(n);
f2 := Vector(n);
open2 := Vector(n);high2 := Vector(n);gain2 := Vector(n);algebra2 := Vector(n);creative2 := Vector(n);creative3 := Vector(n);
upper2 := Vector(n);lower2 := Vector(n);upperloweratio := Vector(n);
deltaopen2 := Vector(n); deltahigh2 := Vector(n); deltalow2 := Vector(n); deltaclose2 := Vector(n);
logn := Vector(n);
for i from 0 to n-4 do
open2[i+1] := PolynomialInterpolation([[0,open3[n-i][1]],[1,open3[n-(i+1)][1]],[2,open3[n-(i+2)][1]],[4,open3[n-(i+3)][1]]],t):
high2[i+1] := PolynomialInterpolation([[0,high3[n-i][1]],[1,high3[n-(i+1)][1]],[2,high3[n-(i+2)][1]],[4,high3[n-(i+3)][1]]],t):
low2[i+1] := PolynomialInterpolation([[0,low3[n-i][1]],[1,low3[n-(i+1)][1]],[2,low3[n-(i+2)][1]],[4,low3[n-(i+3)][1]]],t):
if (close3[i+1][1]/close3[i+2][1]-1) < 0 then
gain2[i+1] := -1*round(100*abs(close3[i+1][1]/close3[i+2][1]-1)):
else
gain2[i+1] := round(abs(100*(close3[i+1][1]/close3[i+2][1]-1))):
end if;
od;
n := 31;
newclose := Vector(n);
for j from 0 to n-4 do
for i from 0 to n-4 do
x1 := close3[i+1];
y1 := close3[i+1];
newclose[i+1] := subs(y=y1, subs(x=x1, (1/2)*(-y+sqrt(-3*y^2-4*y*x))/y))
od;
close3 := newclose;
plot(close3(x), x=1..31);
od;

i am using maple to solve a system of ordinary differential equations , 3 unknows (x,y, x ), and 3 equations (dx/dt,dy/dt,dz/dt)

there is one known variable denpendent on x and z

# code begins here

if x(t) <= z(t) then Q(t) := 8 end if;

if x(t) > z(t) then Q(t) := 10 end if;

eq1 := diff(x(t), t) = 3*x(t)-1;

eq2 := diff(y(t), t) = y(t)+Q(t);

eq3 := diff(z(t), t) = z(t);

eqs := {eq1, eq2, eq3};

# code ends here

above i put the system of ODEs, the code maybe illegal in maple, but i wrote in this way to make it clear.

Q is dependent on x and z.

in the past, when i was trying to solve ODEs, normally, eqs contains with only x,y,z as unknowns. but in this eqs, clearly, Q is included as an unknown. 

i've tried to use piecewise function to express Q(t), but failed.

how could i solve a system like this? thanks