Hello ..

I need codes bifurcation and cobweb for logistic map by maple ..

can you help me ?

Thanks ...

I am trying to recreate journal work for validating using another computer program so I am trying to use maple to solve the ODE, based on further research I found using laplace might be the best but I am having some trouble.

eq8:=d*(n(t)+C(t))/drho = -rho(t)/(l*alpha*K_c)

given the initial conditions of:

ICs:= n(0) = n_0, rho(0) = rho_0, C(0) = (beta-rho_0)*n_0/(l*lambda)

therefore: 

equation9 := dsolve({equation8, ICs}, {C(t), n(t)}, method = laplace)

Following this process I get the error: 

Error, (in dsolve) invalid initial condition

According to the journal work the solution I am looking for is: 

C(t)=-n(t)+(rho_0^2+rho(t)^2)/(2*l*alpha*K_c)+((Beta+l*lambda-rho_0)*n_0)/(l*lambda)

is there something that I'm doing wrong or missing? 

Any help would be greatly Appreciated! 

I want to simulate Inelastic collision

There has 2 ball which I can change  Quality and Radius.

one ball  move to another stirless ball with diferent angle

Hi

I need your help .. I solve a system and I get the error Warning, solutions may have been lost.

The maple code is attached.

testerror.mw

Thank you for your help.

hi everyone , i need your point of view in my question,any help would be appreciated in advance .

we have a discrete function named g(t) and a continous function f(t) in in convolution integral just like this :
int(f(t-x)*g(x),x=0..t) ; 
we have just g(x) in some special points int the interval (0..t) , thus i need to convert this integral to a series.
how should i do this ? can anyone help or any idea ? i need at first a mathematical solution or idea about how to do this and then, how to do this in a software ?
tnx again.

I am trying to define some functions by recursion relations but I get this error:

Error, (in type/realcons) too many levels of recursion

Please see the attached file for details:

File.mw

restart:

Eq2 := diff(T(y), y, y)+(diff(sigma(y), y))*(diff(T(y), y))+(diff(T(y), y))^2+(exp(-y)

+exp(y))^2 = 0;

Eq3 := diff(sigma(y), y, y)+(diff(T(y), y, y))= 0;

bcs2:=T(h1)=0,T(h2)=1,sigma(h1)=0,sigma(h2)=1;

dsolve({Eq2,Eq3,bcs2});

This give me nothing. Please help me out. 

Dear all:

hello everybody;

I need your help to solve the system f(x,y)=0, and g(x,y)=0, such that there some parameter in the system, also all the parameter are positive and also our unkowns  x and y are also positive.

I try to write this code. I feel that under some condition we can have four solution or three or two. I need your help. Many thinks.

Systemsolve.mw

follow Computing non-commutative Groebner bases and Groebner bases for modules

in maple 12

Error, (in Groebner:-Basis) the first argument must be a list or set of polynomials or a PolynomialIdeal

then i find in maple 15 help file is changed from module M := [seq(Vector(subsop(i+1 = 1, [F[i], 0, 0, 0])), i = 1 .. 3)]

to array M := [seq( s^3*F[i] + s^(3-i), i=1..3)];

though it can run, but when apply other example can not run

such as

restart;
with(Groebner):
F := [2*x^2+3*y+z^2, x^2*z^2+z+2*x, x^4*y^7+3*x];
M := [seq( s^3*F[i] + s^(3-i), i=1..3)];
with(Ore_algebra);
A := poly_algebra(x,y,z,s);
T := MonomialOrder(A, lexdeg([s], [x,y,z]), {s});
G := Groebner[Basis](M, T);
Error, (in Groebner:-Basis) the first argument must be a list or set of polynomials or a PolynomialIdeal

G1 := select(proc(a) evalb(degree(a,s)=3) end proc, G);
[seq(Vector([seq(coeff(j,s,3-i), i=0..3)]), j=G1)];
C := Matrix([seq([seq(coeff(j,s,3-i), i=1..3)], j=G1)]);
GB := map(expand, convert(C.Vector(F), list));
Groebner[Basis](F, tdeg(x,y,z));

follow Computing non-commutative Groebner bases and Groebner bases for modules

using LeadingMonomials(f, lexdeg([s],[x,y]));

f:=[y^2+2*x^2*y, y^2];
f1:=[x+y^2,x];
f2:=[x,y];

g:=[f1,f2];

LeadingMonomial(g[1], lexdeg([s],[x,y]));
LeadingMonomial(g[2], lexdeg([s],[x,y]));
LeadingMonomial(g[1], lexdeg([s],[y,x]));
LeadingMonomial(g[2], lexdeg([s],[y,x]));

no result is (0,y^2)

where is wrong?

I`ve written this program:



It determines the power of the Ithfactor, only one problem. When I try to compute the factor of 512 I get 2_2 (subscript) which is extremly stupid. I want to know how I can change my program so that it can give the power of every ith factor. Thanks!

If I want to make a display of data, say 2 columns of data, with a heading on top of each column, how would one go about this in Maple? This will be for display purposes only (say for final result of a homework result, etc..)  

In Mathematica, I use the Grid command. I am not sure how to do this in Maple. I could not find Grid like command in Maple.

I can generate the data in 2 sequences  in Maple, but need to insert a heading, and also need to insert frame around eveything.

Here is an example:

f:=x->x^2;
g:=x->x^3;
data=[seq([i,f(i),g(i)],i=0..5)];
    #data = [[0, 0, 0], [1, 1, 1], [2, 4, 8], [3, 9, 27], [4, 16, 64], [5, 25, 125]]

The above data has 3 columns, 6 rows. I need to insert first row also called {"index","f","g"} and then display all in nice table form. This is how I would do the above in Mathematica to give idea of what I looking for

f[x_] := x^2;
g[x_] := x^3;
data = Table[{i, f[i], g[i]}, {i, 0, 5}]
    (* {{0, 0, 0}, {1, 1, 1}, {2, 4, 8}, {3, 9, 27}, {4, 16, 64}, {5, 25, 125}} *)

And this is below the part I do not know how to emulate in Maple:

data = Insert[data, {"i", "f(i)", "g(i)"}, 1]
    #   {{"i", "f(i)", "g(i)"}, {0, 0, 0}, {1, 1, 1}, {2, 4, 8}, {3, 9, 27}, {4, 16, 64}, {5, 25, 125}}
    # now use Grid to format with frame around everything
Grid[data, Frame -> All]

Dear people in Mapleprimes,

alpha-gamma*q[k]-eta*(int(q[i], i = 0 .. M__n))-eta*q[k] = p[k];

Then,

algsubs(-eta*(int(q[i], i = 0 .. M__n))-eta*q[k] = -eta*(int(q[i], i = 0 .. M__n)), alpha-gamma*q[k]-eta*(int(q[i], i = 0 .. M__n))-eta*q[k] = p[k]);

This works fine.

But,

applyrule(-eta*(int(q[i], i = 0 .. M__n))-eta*q[k] = -eta*(int(q[i], i = 0 .. M__n)), alpha-gamma*q[k]-eta*(int(q[i], i = 0 .. M__n))-eta*q[k] = p[k]);

This doesn't bring an right replacement.

What difference is there between applyrule and algsubs?

Best wishes

taro

Dear all,

I woul line integrate e gradient moltiply to a vector. I will try to explain better.

I have define this function:

and I have a vector a

v=(0,1)

I would like to applu a dot product between the gradient of phi an the vector and integrate the results. 

I have already try in many way but without succeed. Someone could please help me?

Thanks 

For some reason it always bugs me that Maple pulls a negative sign out in the solution.

eq:=c=a+b*exp(-k)

solve(eq,k)

The solution is correct, but one would expect it to be written like ..

.. after all that is a more conventional solution, isn't it? 

If I type the last equation into Maple it evaluates to

..again slightly unconventional but still correct.  Only if back quotes around the `c-a` are used can we achieve what we would write out on paper.  It would be nice if Maple would output the answer in a conventional manner ... at least in my opinion. 

Can we manipulate Maple to evaluate that solution into the conventional answer? 

Afterall, Maple is advertising it's "typsetting appears like it would appear in a textbook" and uses standard Math notation.  All I am trying to say is that if Maple advertises as a math standard could we also present solutions in the same manner? 

But not to get sidetracked from the question I posed, is there a way we can manipulate that solution into a "handwritten" convention?