Please help me plot the graphs of the following equations:-

eq1 := diff(E[X(t)], t) = lambda-delta*E[X(t)]-beta*E[X(t)*V(t)];

 eq2 := diff(E[Y(t)], t) = -delta*E[Y(t)]+beta*exp(-rho*tau)*E[X(t)*V(t)];
                                                    
eq3 := diff(E[V(t)], t) = gamma+N*kappa*E[Y(t)]-mu*E[V(t)]-beta*E[X(t)*V(t)]

NB:- E[X(t)]= the expected value of variable X at time t. 

Please help me know how to input this...

Hello colleagues! :)

I have some problems after create two objects, with array row in object definition...

The result - two same object...

How can i solve for X(t) in the following equation

diff(mean(X(t)), t) = lambda-delta*mean(X(t))-beta*mean(X(t)*V(t))

and how can i plot X(t) against t.

Branched from huffman coding (excellent example).  The huffman tree was not encoded in the message. The tree was known from the original message but suppose we didn't have the original message.  We need the tree in the compressed message.

How do you include the huffman tree in the message?

Every time i open an already saved document and change it then try to save it it comes up with this error:cwmaple.exe has stopped working!!! Why does this happen??

Please Help

Thanks,

Hello all

I have a set of differential equations and its numerical solution, for two functions. Here's the worksheet (just a part of it, I don't need the rest)

##########################################

eq1 := diff(W(r), r) = -(1-beta*(W(r)-W0))*(M(r)+4*Pi*r^3*p(r))/(beta*r*(r-2*M(r)));

eq2 := diff(M(r), r) = 4*Pi*r^2*rho(r);

W0 := solve(thetaR = theta0-W0, W0);

r0:=10^(-5);

rf:=10^20;

# ini := evalf({M(r0) = 0, W(r0) = W0});

How to include/code/type such type of boundary conditions in maple?

Thanks

I wrote the following code but am stuck on how to Update prcLeastSquareLA, so it does what prcLeastSquare does.

I believe you have to add error estimate information in prcLeastSquareLA but I have tried to no avail.

prcLeastSquareLA:= proc(data,degree)
local vars,y,A,V,k,e,i,j,v,c,1stVars;

vars:= seq(ci, i=0..degree);
y:=unapply(‘+’(seq(ci*t^j, i=0..degree)),t);
for k

Hi, I need to update a procedure prcLeastSquareLA so that it includes error estimate information as output in it. So far for the procedure I have this:

prcLeastSquareLA:=proc(data,degree)

local vars,y,A,V,k,e,i,j,v,c,lstVars;  

vars := seq(c_i, i = 0 .. degree);

y := unapply(`+`(seq((c_i)*t^i, i = 0 .. degree)), t);

 for k to nops(data) do 

e_k := y(data[k][1]) = data[k][2];

v_k := [coeffs(lhs(e_k))];

How to extract affine terms from a differential equation after linearization?

Vanderpol Eqn:

To be precise, I linearized...

i use Infeld's The Factorization method and find this Hermit is type D. since not exactly match r i use R(x,m) = r(x,m) + f(m) and compare them, then find k = x but eigenfunction Y := C*exp(-int(x,x)); has constant C, range x should between negative infinity and infinity. C is 1/Pi^(1/4) after solved. i guess this is wrong, but i do not know where is wrong.

another problem is that i assume C = 1, after sum for generating function the solution is not the same as mentioned in book which is exp(2*x*z-z^2)...

Hello,

1-I have one calculation and the result is "Error, (in expand/bigprod) object too large"... What can I do with this error?

thamks alot.

Modify the shortest path problem by rewriting a procedure Path, non-Recursion
 that print out the shortest path from a to e base on the information from
 setShortestDistNode
 input:  destination "e" and setShortestDistNode
 output:  path : a -> b -> d -> e the total cost: 9
hint: copy everything that we did in shortest path problem, and rewriting a procedure Path, with while loop

I'm assuming this means this, but...

Modify the shortest path problem by rewriting a procedure Path, non-Recursion
 that print out the shortest path from a to e base on the information from 
 setShortestDistNode
 input:  destination "e" and setShortestDistNode
 output:  path : a -> b -> d -> e the total cost: 9
hint: copy everything that we did in shortest path problem, and rewriting a procedure Path, with while loop 

can...

I adopted the approach suggested in an earlier post (http://www.mapleprimes.com

/questions/137320-Plotting-A-System-Of-Ode) for the known results,

but some part of curve is missing.

The output I got is