Help me, please!

If i have boundary conditions with D(psi), i have no problem. But if i have condition with psi(infinity) (which i need), Maple says "too few boundary conditions". Maybe i make stupid mistakes, but i don't see.

restart;
assume(r, nonnegative);
ic_Re := `ψRe`(0) = 0, (D(`ψRe`))(0) = 0;
ic_Im := `ψIm`(0) = 0, (D(`ψIm`))(0) = 0;
V0 := 2.5; ERe := 1.5; EIm := 1.2; `ℏ` := 6.582; mu := 938.27*(1/2); Q0 := 1.5; Rq := 4.5; Rv := 2.5;
Q := proc (r) options operator, arrow; -Q0*exp(-r/Rq) end proc;
V := proc (r) options operator, arrow; -V0*exp(-r/Rv) end proc;
`Eqn_ψRe` := -`ℏ`^2*(diff(`ψRe`(r), r, r)+2*(diff(`ψRe`(r), r))/r)/(2*mu)-ERe*`ψRe`(r)+V(r)+EIm*`ψRe`(r) = Q(r);
`Eqn_ψIm` := -`ℏ`^2*(diff(`ψIm`(r), r, r)+2*(diff(`ψIm`(r), r))/r)/(2*mu)-EIm*`ψRe`(r)-ERe*`ψIm`(r) = 0;
F := dsolve({ic_Im, ic_Re, `Eqn_ψIm`, `Eqn_ψRe`}, numeric);
plots[odeplot](F, [r, `ψRe`(r)], r = 0 .. 20, numpoints = 500);

plots[odeplot](F, [r, `ψRe`(r)], r = 0 .. 20, numpoints = 500);

restart;
assume(r, nonnegative);
ic_Re := `ψRe`(0) = 0, `ψRe`(infinity) = 0;
ic_Im := `ψIm`(0) = 0, `ψIm`(infinity) = 0;
V0 := 2.5; ERe := 1.5; EIm := 1.2; `ℏ` := 6.582; mu := 938.27*(1/2); Q0 := 1.5; Rq := 4.5; Rv := 2.5;
Q := proc (r) options operator, arrow; -Q0*exp(-r/Rq) end proc;
V := proc (r) options operator, arrow; -V0*exp(-r/Rv) end proc;
`Eqn_ψRe` := -`ℏ`^2*(diff(`ψRe`(r), r, r)+2*(diff(`ψRe`(r), r))/r)/(2*mu)-ERe*`ψRe`(r)+V(r)+EIm*`ψRe`(r) = Q(r);
`Eqn_ψIm` := -`ℏ`^2*(diff(`ψIm`(r), r, r)+2*(diff(`ψIm`(r), r))/r)/(2*mu)-EIm*`ψRe`(r)-ERe*`ψIm`(r) = 0;
F := dsolve({ic_Im, ic_Re, `Eqn_ψIm`, `Eqn_ψRe`}, numeric);
Error, (in dsolve/numeric/bvp/convertsys) too few boundary conditions: expected 5, got 4

Hi, I need help with this little university assignment.

See the thumbnail below.

I have been away from the class because of a staph infection and missed the notes about vectors and Euler's formula.

It would be helpful if someone could give a rundown about how to solve the problems or give a general solution.

-Thanks

Dear All

I calculate something with gr tensor, for example Ricciscalar. How can I save it in maple memory? As you know, in this situation you can not use your calculation directly and it seems that it saved in grtensor memory not maple memory. For example, if you want to plot Ricciscalar, you should save it as a new definition in maple and then plot it. 

Thank you.

I have tried to solve the following ode equation, but I have got error. What is the potencial problem?

http://i65.tinypic.com/xdcl8p.jpg

hy

i have to develop a code i which i have system of nonlinear equation 

i have to generate the matrix of that nonlinear equation then i want to do or apply any method say newton method and make a loop which help us to find a solution using some tolerance 

at the end i get a result in form of a table which give nth matrix then value of function matrix at nth value then error i-e xn-x(n-1) 

thanx in advance

I need help i worked hard on this work but Maple just won´t open my work!!

Maple Worksheet - Error

Failed to load the worksheet /maplenet/convert/problem-opgaver-jakob-2.y.mw .

Download problem-opgaver-jakob-2.y.mw

Hi evey ones ; 

how can i convert these code below TO matlab 

thank a lot Maple_to_MATLAB.mw

I need to do assignments on Maple T.A. but the website is in Japanese?

Everytime I visit (doesn't matter whether I type in the webadress or whether I follow a link via Google or elsewhere) saxion.mapleta.com/saxion I get a website that's entirely in Japanese. 

My PC language is English (UK) and Dutch, I have tried removing cookies, history etc of my webbrowser. Nothing has helped. I can reach the English site via my mobile phone browser.

There is an example in the help of maple, that is to solve the symmetries of the equation ut=uxx using the order "Infinitesimals".

But the result i can't understand.

I solved by hand and find  _eta[u](x, t, u)=cu+b(x,t), where b(x,t) is a solution of the ut=uxx.

While in maple, b is only two exponential function which are also the solution of ut=uxx. 

why?

thanks for your help!

I need to write a procedure that adds all multiples of 5 and 7 less than an arbitrary number. I was thinking something maybe with mod? I am very new to Maple. 

On in this same assignment, we are also supposed to generate a sequence using the Fibonacci equation but from an arbitrary pair of initial conditions. So if there are some parallels between these two problems, I would love to learn from that angle.  

We recently in class learned about do loops, so if there is a way to attack these problems with do loops, I would like to hear!

Dear all!.       

I have an expression with ramdom variables. Can i use NLP to optimize it?. In this case, does Maple take the histogram of theses ramdom variables?. Thank!!!

What is the difference between the Expression Palette and the Layout Palette? First I thought that the Layout Palette is supporting the entering of names with e.g. sub- and superscripts, but I learned (the hard way) that the templates of the Layout Palette are "mathematically active".

What is the meaning of the colours green and violett in both palettes?

how to fasten dsolve and is it possible to timeout faster if it know no solution earlier?

i split into near 500 blocks of nested for loop, total around 42 billions trials

i run in cmaple, 

i see it run the first 4 blocks of code and output to files,  which are daff001, daff002, daff003 and daff004

it seems that it can run parallel intelligently though i write in serial lines.

but it run a very long time, still running near first 4000 records

window 10 use 3.4GB memory, only 4GB memory rest

but 4000 records use more than 4GB memory

i just hope to run 1000 records every day, hope 1000 records can be finished within a few hours

and plan to run around 500days

restart:
read "D:\\daff2039mm.m":
with(combinat):
appendto("D:\\daff001.txt");
for ii from 1 to 1 do
for jj from 1 to 1 do
for kk from 1 to 1 do
if ii < jj and jj < kk then
if mm[ii] <> mm[jj] and mm[jj] <> mm[kk] then
sol := dsolve([mm[ii] , mm[jj] , mm[kk] ],[a(t), b(t), c(t)]);
if nops([sol]) = 1 then
print([mm[ii], mm[jj], mm[kk]]);
print(sol);
print(" * **");
end if:
end if:
end if:
od:
gc();
od:
od:

restart:
read "D:\\daff2039mm.m":
with(combinat):
appendto("D:\\daff002.txt");
for ii from 1 to 1 do
for jj from 1 to 1 do
for kk from 1 to 1001 do
if ii < jj and jj < kk then
if mm[ii] <> mm[jj] and mm[jj] <> mm[kk] then
sol := dsolve([mm[ii] , mm[jj] , mm[kk] ],[a(t), b(t), c(t)]);
if nops([sol]) = 1 then
print([mm[ii], mm[jj], mm[kk]]);
print(sol);
print(" * **");
end if:
end if:
end if:
od:
gc();
od:
od:

restart:
read "D:\\daff2039mm.m":
with(combinat):
appendto("D:\\daff003.txt");
for ii from 1 to 1 do
for jj from 1 to 1 do
for kk from 1001 to 2001 do
if ii < jj and jj < kk then
if mm[ii] <> mm[jj] and mm[jj] <> mm[kk] then
sol := dsolve([mm[ii] , mm[jj] , mm[kk] ],[a(t), b(t), c(t)]);
if nops([sol]) = 1 then
print([mm[ii], mm[jj], mm[kk]]);
print(sol);
print(" * **");
end if:
end if:
end if:
od:
gc();
od:
od:

restart:
read "D:\\daff2039mm.m":
with(combinat):
appendto("D:\\daff004.txt");
for ii from 1 to 1 do
for jj from 1 to 26 do
for kk from 2001 to 2001 do
if ii < jj and jj < kk then
if mm[ii] <> mm[jj] and mm[jj] <> mm[kk] then
sol := dsolve([mm[ii] , mm[jj] , mm[kk] ],[a(t), b(t), c(t)]);
if nops([sol]) = 1 then
print([mm[ii], mm[jj], mm[kk]]);
print(sol);
print(" * **");
end if:
end if:
end if:
od:
gc();
od:
od:

restart:
read "D:\\daff2039mm.m":
with(combinat):
appendto("D:\\daff005.txt");
for ii from 1 to 1 do
for jj from 26 to 51 do
for kk from 2001 to 2001 do
if ii < jj and jj < kk then
if mm[ii] <> mm[jj] and mm[jj] <> mm[kk] then
sol := dsolve([mm[ii] , mm[jj] , mm[kk] ],[a(t), b(t), c(t)]);
if nops([sol]) = 1 then
print([mm[ii], mm[jj], mm[kk]]);
print(sol);
print(" * **");
end if:
end if:
end if:
od:
gc();
od:
od:

i have already release memory with gc() in the most inner for loop ]

,but it still use up my memory

once it printed two lines each time, actually it can release memory

but why it still use up memory

read "D:\\hello.m":
with(combinat):
appendto("D:\\gogogo.txt");
for ii from 1 to 2040 do
for jj from 1 to 2040 do
for kk from 1 to 2040 do
if ii < jj and jj < kk then
if mm[ii] <> mm[jj] and mm[jj] <> mm[kk] then
sol := dsolve([mm[ii],mm[jj],mm[kk]],[a(t),b(t),c(t)]);
print([mm[ii],mm[jj],mm[kk]]);
print(sol);
print("***");
end if:
end if:
od:
gc();
od:
od:

i can only think

use c# to generate code with file write, nested for loop every 1000 records 

is it the only way to do?

int counter = 0;
for (int i=1; i<=2040; ++i)
{
for (int j = 1;j <= 2040; ++j)
{
for (int k = 1; k <= 2040; ++k)
{
if(counter % 1000 == 0)
{
Console.Write(i.ToString() + ","+j.ToString() + ","+k.ToString());
Console.Write("\r\n");
}
counter = counter + 1;
}
}
}

for ii from 1 to 2039 do
for jj from 1 to 2039 do
for kk from 1 to 2039 do
print(hello(ii,jj,kk));
od:
od:
od: