Maple Questions and Posts

These are Posts and Questions associated with the product, Maple


Suppose I have a PDE

i*psi[t]+psi[xx] = epsilon*(abs(psi)^2)[yy]*psi:

Here I can set psi = u(x, y, t)+i*v(x, y, t), i = sqrt(-1)

Then my query is, how can I obtain simplified resultant system after equating real and imaginary parts. Of course there would be two partial differential equations in u(x, y, t)and v(x, y, t) and those can also be written down manually very easily but this process becomes difficult when we have large system.

Please help !!!


Download Maple_Query_1.mw

Regards

Hi every one,

I am using Maple 7 because I am running Windows XP

I believe this equation:

 

> solve( 1.15=exp(-xi*Pi/(sqrt(1-xi^2))), xi);

 

has two solutions: xi=+0.4444364945e-1 and xi=-0.4444364945e-1

but Maple only gives -0.4444364945e-1

 

Why?? And how can I get the two solutions?? Thanks before hand by your comments.

I'm trying to view the source of the webpage fuelsonline.ca

I used HTTP[Get] like I did before which doesn't retrieve much of anything useful.  I thought of the sockets package which I can't seem to pull any information from.  Then I had an idea and viewed the page source which finally has information I can use if I can get Maple to read it in.  If I can get Maple to pull in the contents of the page source I should at least be able to carry it from there. 

Any ideas from anyone?

The code "solve((x+exp(-1))^x = 1, x)"gives the error "Error, (in Engine:-Dispatch) invalid subscript selector". How is this possible?

Hello people in mapleprimes,

I have an equation called aa in the following.

alias(`δx`=dx, `Δx`=Dx,`Δy`=Dy,`Δz`=Dz):
aa:=Dz=f(x+Dx,y+Dy)-f(x,y);

As for modification of this expression, I ask your favor to teach me.

Then, I want to change this aa to D[1](f)(x+theta__1*Dx,y+Dy)*Dx+D[2](f)(x,y+theta__2*Dy)*Dy.

But, to do so, I have to split aa into the one including -f(x,y+Dy)+f(x,y+Dy) between two terms

of aa.

But, as maple cancels these terms, I can't do so. How can I insert two terms, then

obtain the expression  D[1](f)(x+theta__1*Dx,y+Dy)*Dx+D[2](f)(x,y+theta__2*Dy)*Dy?

 

Thanks in advance.

taro

hi...how i can convert 3 couple equations to 1 equation with Placement each other?

thanks...

 

3-1.mw

pd1 := A1*(diff(U(x, theta), x, x, x, x))+A2*(diff(U(x, theta), x, x))+A3*(diff(U(x, theta), x, x, theta, theta))+A4*(diff(V(x, theta), x, x, x, theta))+A5*(diff(V(x, theta), x, theta))+A6*(diff(V(x, theta), x, theta, theta, theta))+A7*(diff(W(x, theta), x, x, x))+A8*(diff(W(x, theta), x))+A9*(diff(W(x, theta), x, theta, theta))+A10*(diff(U(x, theta), theta, theta))+A11*(diff(U(x, theta), theta, theta, theta, theta))-A12*omega^2*U(x, theta)

A1*(diff(diff(diff(diff(U(x, theta), x), x), x), x))+A2*(diff(diff(U(x, theta), x), x))+A3*(diff(diff(diff(diff(U(x, theta), theta), theta), x), x))+A4*(diff(diff(diff(diff(V(x, theta), theta), x), x), x))+A5*(diff(diff(V(x, theta), theta), x))+A6*(diff(diff(diff(diff(V(x, theta), theta), theta), theta), x))+A7*(diff(diff(diff(W(x, theta), x), x), x))+A8*(diff(W(x, theta), x))+A9*(diff(diff(diff(W(x, theta), theta), theta), x))+A10*(diff(diff(U(x, theta), theta), theta))+A11*(diff(diff(diff(diff(U(x, theta), theta), theta), theta), theta))-A12*omega^2*U(x, theta)

(1)

pd2 := B1*(diff(V(x, theta), x, x, x, x))+B2*(diff(V(x, theta), x, x))+B3*(diff(V(x, theta), theta, theta, theta, theta))+B4*(diff(V(x, theta), theta, theta))+B5*(diff(V(x, theta), x, x, theta, theta))+B6*(diff(U(x, theta), x, x, x, theta))+B7*(diff(U(x, theta), x, theta, theta, theta))+B8*(diff(U(x, theta), x, theta))+B9*(diff(W(x, theta), x, x, theta))+B10*(diff(W(x, theta), theta, theta, theta))+B11*(diff(W(x, theta), theta))-B12*omega^2*V(x, theta)

B1*(diff(diff(diff(diff(V(x, theta), x), x), x), x))+B2*(diff(diff(V(x, theta), x), x))+B3*(diff(diff(diff(diff(V(x, theta), theta), theta), theta), theta))+B4*(diff(diff(V(x, theta), theta), theta))+B5*(diff(diff(diff(diff(V(x, theta), theta), theta), x), x))+B6*(diff(diff(diff(diff(U(x, theta), theta), x), x), x))+B7*(diff(diff(diff(diff(U(x, theta), theta), theta), theta), x))+B8*(diff(diff(U(x, theta), theta), x))+B9*(diff(diff(diff(W(x, theta), theta), x), x))+B10*(diff(diff(diff(W(x, theta), theta), theta), theta))+B11*(diff(W(x, theta), theta))-B12*omega^2*V(x, theta)

(2)

pd3 := C1*(diff(W(x, theta), x, x, x, x, x, x))+C2*(diff(W(x, theta), x, x, x, x))+C3*(diff(W(x, theta), x, x, x, x, theta, theta))+C4*(diff(W(x, theta), x, x))+C5*(diff(W(x, theta), x, x, theta, theta))+C6*(diff(W(x, theta), x, x, theta, theta, theta, theta))+C7*(diff(U(x, theta), x, x, x))+C8*(diff(U(x, theta), x))+C9*(diff(U(x, theta), x, theta, theta))+C10*(diff(V(x, theta), x, x, theta))+C11*(diff(V(x, theta), theta))+C12*(diff(V(x, theta), theta, theta, theta))+C13*W(x, theta)+C14*(diff(W(x, theta), theta, theta))+C15*(diff(W(x, theta), theta, theta, theta, theta))+C16*(diff(W(x, theta), theta, theta, theta, theta, theta, theta))-C19*omega^2*W(x, theta)-C18*omega^2*(diff(W(x, theta), theta, theta))-C17*omega^2*(diff(W(x, theta), x, x))

C1*(diff(diff(diff(diff(diff(diff(W(x, theta), x), x), x), x), x), x))+C2*(diff(diff(diff(diff(W(x, theta), x), x), x), x))+C3*(diff(diff(diff(diff(diff(diff(W(x, theta), theta), theta), x), x), x), x))+C4*(diff(diff(W(x, theta), x), x))+C5*(diff(diff(diff(diff(W(x, theta), theta), theta), x), x))+C6*(diff(diff(diff(diff(diff(diff(W(x, theta), theta), theta), theta), theta), x), x))+C7*(diff(diff(diff(U(x, theta), x), x), x))+C8*(diff(U(x, theta), x))+C9*(diff(diff(diff(U(x, theta), theta), theta), x))+C10*(diff(diff(diff(V(x, theta), theta), x), x))+C11*(diff(V(x, theta), theta))+C12*(diff(diff(diff(V(x, theta), theta), theta), theta))+C13*W(x, theta)+C14*(diff(diff(W(x, theta), theta), theta))+C15*(diff(diff(diff(diff(W(x, theta), theta), theta), theta), theta))+C16*(diff(diff(diff(diff(diff(diff(W(x, theta), theta), theta), theta), theta), theta), theta))-C19*omega^2*W(x, theta)-C18*omega^2*(diff(diff(W(x, theta), theta), theta))-C17*omega^2*(diff(diff(W(x, theta), x), x))

(3)

``


Download 3-1.mw

I've read the help page ?printf for the format codes many times over the years. I think that this is new:

The Z modifier, "%Zm" can be used to generate an alternate equivalent dotm representation that is used in communication with the GUI and in DocumentTools related functionality for the creation of XML content for .mw files.

Could someone show me an example of that?

 

i am working on laplacian eigenvalues of some special graphs and when i want to find  min([laplacianEigenvalues]) then i alltime see same error code, [Error, (in simpl/min) complex argument to max/min...]

my aim is write a procedure about Algebraic connectivity

how to i fix it? please help

Hello, I run Maple to solve Binary Integer Programming problem which contain about 1340 constraint and its goal to maximize the objective function.

At first, it's running for 2 hours and said that the iteration limit was reached. So I try to add 'iterationlimit' at LPSolve opts and set it to 10000, but after 3 or 4 hours it said that the iteration limit was reached. So I set 'iterationlimit' to 100000000 and now Maple keep evaluating more than 12 hours.

I run Maple at my notebook with these spesification:

Processor: Intel Corei3-5005U 2.0 GHz

Memory: 4GB RAM

Windows 10

 

It is normal? Or I must run Maple in higher notebook spesification?

Thank you in advance.

 

Below is my Maple file, hope you can help me.

ISL_2017_FASE3.mw

I want to analyze the runtimes on certain Linear Algebra functions in Maple, so I need a (large) set of matrices to input into these functions.

I have written the below code, which does succesfully generate a file of matrices:

The resulting file looks like:

However, I am unable to read the matrices from this file back into Maple. When using the code below, I get an error.


I think the error is that %a in fscanf scans up to the next whitespace, so the spacing in Matrix(3, 3, [[9,1,-4],[-5,6,-10],[-10,-4,-4]]) is throwing fscanf off. Do you guys know of any way I can fix this?

 

Or, is there a better way for me to generate these matrices so that they can be easily read into Maple? I've considered using ImportMatrix/ExportMatrix, but I believe that they only work for a single matrix, not the numerous ones that I would need. 

how can i generate graph families(all possible set )with given number of vertices?(just vertices ,not given edge set)

for instance : how can i write a procedure about with 4-vertices all graphs ,5-vertices,..and so on

please hellp me

I want to approximate the following hypergeometric function for large values of Y. The variables c and R are complex parameters.

hypergeom([-I*(c+sqrt(c^2-1)), I*(-c+sqrt(c^2-1))], [-I*(2*c+I), -I*(c+I+I*c/R)], exp(Y)*c/R)

 

I allready tried asympt(f,Y), but maple failed.

How can I get the equation G1 automatically shown in Latex as stated? Example:

G1 := V = Pi*(d/2)^2*h;

latex(G1);

# yields V=1/4\,\pi\,{d}^{2}h

rendered:

 

 

How can I make G1 inert so that Latex generator accepts it as input?

I am a beginner with Maplesoft.

I have a data file with several devices IDs and links between these devices (more than 5000 links). For representing a network in Maple, I am aware that the GraphTheory package should be used. The vertices and edges are to be defined and the graph to be displayed.

The examples that I have looked at do not have such a large number of links. With more than 5000 links in the data file, I am not sure how to proceed further.

Any help or pointers would be highly appreciated.

In a recent conversation I explained whyLSODE was giving wrong results (http://www.mapleprimes.com/questions/210948-Can-We-Trust-Maple#comment230167). After a lot of confusions and weird infinite loops for answers, it turned out that Newton Raphson was not properly done.

Both LSODE and MEBDFI are currently incompletely implemented (only one iteration is done instead of Newton Raphson till convergence). Maplesoft should update the help files accordingly.

The post below explains how better results are obtained with method = mgear. To run the command mgear you will need Maple 6 or earlier versions. For lsode, any current version is fine.  Unfortunately Maple deprecated an algorithm that worked fine. From Maple 8, the algorithm moved to Rosenbrock methods for stiff equations. This is still not ideal.

If Maple had a working algorithm, I am hoping that Maplesoft folks would consider bringing it back in future versions. (At least with the same functionality as in Maple 6).

PLEASE NOTE, the issue is not with solving this example (Very simple). This example is chosen to show how a popular algorithm in the literature is wrongly implemented.

 

Here Maple's lsode is forced to take only one step and use first order back ward difference formula to integrate from 0 to 1.  LSODE mimics Eulerbackward using the options given below. The post shows that LSODE does not do Newton Raphson and just performs only iteration for nonlinear equations.

restart;

Digits:=15;

Digits := 15

(1)

eq:=diff(y(t),t)=-y(t);

eq := diff(y(t), t) = -y(t)

(2)

C:=array([0$22]);

C := Vector[row](22, {(1) = 0, (2) = 0, (3) = 0, (4) = 0, (5) = 0, (6) = 0, (7) = 0, (8) = 0, (9) = 0, (10) = 0, (11) = 0, (12) = 0, (13) = 0, (14) = 0, (15) = 0, (16) = 0, (17) = 0, (18) = 0, (19) = 0, (20) = 0, (21) = 0, (22) = 0})

(3)

C[9]:=1;

C[9] := 1

(4)

sol:=dsolve({eq,y(0)=1},type=numeric,method=lsode[backfull],ctrl=C,initstep=0.1,minstep=0.1,abserr=1,relerr=1):

sol(0.1);

[t = .1, y(t) = .909090909090834]

(5)

subs(diff(y(t),t)=(y1-1)/0.1,y(t)=y1,eq);

0.1e2*y1-0.1e2 = -y1

(6)

fsolve(%,y1=0.5);

.909090909090909

(7)

 While for linear it gave the expected result, it gives wrong results for nonlinear problems.

sol1:=dsolve({eq,y(0)=1},type=numeric):

sol1(0.1);

[t = .1, y(t) = .904837355407810]

(8)

eq:=diff(y(t),t)=-y(t)^2*exp(-y(t))-10*y(t)*(1+0.01*exp(y(t)));

eq := diff(y(t), t) = -y(t)^2*exp(-y(t))-10*y(t)*(1+0.1e-1*exp(y(t)))

(9)

sol:=dsolve({eq,y(0)=1},type=numeric,method=lsode[backfull],ctrl=C,initstep=0.1,minstep=0.1,abserr=1,relerr=1):

sol(0.1);

[t = .1, y(t) = .501579294869466]

(10)

subs(diff(y(t),t)=(y1-1)/0.1,y(t)=y1,eq);

0.1e2*y1-0.1e2 = -y1^2*exp(-y1)-10*y1*(1+0.1e-1*exp(y1))

(11)

fsolve(%,y1=1);

.488691779256025

(12)

sol1:=dsolve({eq,y(0)=1},type=numeric):

 the expected answer is correctly obtained with default tolerance as

sol1(0.1);

[t = .1, y(t) = .349614721994122]

(13)

 The results obtained are worse than single iteration using jacobian.

eq2:=(lhs-rhs)(subs(diff(y(t),t)=(y1-1)/0.1,y(t)=y1,eq));

eq2 := 0.1e2*y1-0.1e2+y1^2*exp(-y1)+10*y1*(1+0.1e-1*exp(y1))

(14)

jac:=unapply(diff(eq2,y1),y1);

jac := proc (y1) options operator, arrow; 20.+2*y1*exp(-y1)-y1^2*exp(-y1)+.10*exp(y1)+.10*y1*exp(y1) end proc

(15)

f:=unapply(eq2,y1);

f := proc (y1) options operator, arrow; 0.1e2*y1-0.1e2+y1^2*exp(-y1)+10*y1*(1+0.1e-1*exp(y1)) end proc

(16)

y0:=1;

y0 := 1

(17)

dy:=-evalf(f(y0)/jac(y0));

dy := -.508796088545793

(18)

ynew:=y0+dy;

ynew := .491203911454207

(19)

 Following procedures confirm that it is indeed calling the procedure only at 0 and 0.1, with backdiag giving slightly better results.

myfun:= proc(x,y) if not type(x,'numeric') or not type(evalf(y),numeric)then 'procname'(x,y);
    else lprint(`Request at x=`,x); -y^2*exp(-y(x))-10*y*(1+0.01*exp(y)); end if; end proc;

myfun := proc (x, y) if not (type(x, 'numeric') and type(evalf(y), numeric)) then ('procname')(x, y) else lprint(`Request at x=`, x); -y^2*exp(-y(x))-10*y*(1+0.1e-1*exp(y)) end if end proc

(20)

sol1:=dsolve({diff(y(x),x)=myfun(x,y(x)),y(0)=1},numeric,method=lsode[backfull],ctrl=C,initstep=0.1,minstep=0.1,abserr=1,relerr=1,known={myfun}):

sol1(0.1);

`Request at x=`, 0.

`Request at x=`, 0.

`Request at x=`, .1

`Request at x=`, .1

[x = .1, y(x) = .501579304183583]

(21)

sol2:=dsolve({diff(y(x),x)=myfun(x,y(x)),y(0)=1},numeric,method=lsode[backdiag],ctrl=C,initstep=0.1,minstep=0.1,abserr=1,relerr=1,known={myfun}):

sol2(0.1);

`Request at x=`, 0.

`Request at x=`, 0.

`Request at x=`, .1

`Request at x=`, .1

[x = .1, y(x) = .497831388424072]

(22)

 

Download Lsodeanalysistrunc.mws

 

Next see how dsolve method = mgear works just fine in Maple 6 (gives the expected answer upto 3 Digits accuracy). To run this code you will need Maple 6 or earlier versions. Maple 7 has this algorithm, but I don't know to use it as it is hidden. I would like to get support from other members to get Maplesoft's attention to bring this algorithm back.

If Mdy/dt = f(y) is solved using mgear algorithm (instead of dy/dt =f ), then one can have a good DAE solver based on this (M being singular). 

 

restart;

myfun:= proc(x,y) if not type(x,'numeric') or not type(evalf(y),numeric)then 'procname'(x,y);
    else lprint(`Request at x=`,x); -y^2*exp(-y(x))-10*y*(1+0.01*exp(y)); end if; end proc;

myfun := proc (x, y) if not (type(x, 'numeric') and type(evalf(y), numeric)) then ('procname')(x, y) else lprint(`Request at x=`, x); -y^2*exp(-y(x))-10*y*(1+0.1e-1*exp(y)) end if end proc

(1)

sol2:=dsolve({diff(y(x),x)=myfun(x,y(x)),y(0)=1},{y(x)},numeric,method=mgear[mstepnum],stepsize=0.1,minstep=0.1,errorper=1):

sol2(0.1);

`Request at x=`, 0.

`Request at x=`, .1

`Request at x=`, .1

`Request at x=`, .1

[x = .1, y(x) = .4887165263]

(2)

 

 

Download Mgearworks.mws

First 1106 1107 1108 1109 1110 1111 1112 Last Page 1108 of 2255