https://drive.google.com/file/d/0Bxs_ao6uuBDUVkE1b2pmcnljcnc/view?usp=sharing
https://drive.google.com/file/d/0Bxs_ao6uuBDUbE56R3Z1c0tLRkE/view?usp=sharing

restart;
changering := proc(Equation1, f3,g3)
g1 := (x,y)-> f3;
f1 := (x,y)-> g3;
h:=subs(g=g1, Equation1);
h:=subs(f=f1, h);
h:=subs(0=0, h);
return h;
end proc:
Eq1 := f(x,g(x,y)) + f(x,y);
h2 := changering(Eq1,x+y, x+y);
h2;

g1 := (x,y)-> x+y;
f1 := (x,y)-> x+y;
h:=subs(g=g1, Eq1);
h:=subs(f=f1, h);
h:=subs(0=0, h);

Dear All

I am trying to integrate a function, however Maple is not giving me the results. I have tried to use int as well as evalf however I am still not getting the results.

I would be grateful if you could please suggest me a way out. I have attached the maple file for your reference.

ThanksExample.mw

I have this data I want to import in to Maple.




In Maple I type:

ImportMatrix("C:\\Users\\marc\\Desktop\\data1.csv", delimiter = ",");

then I get the following:




My question now becomes how can I import the data with the correct dates and not just -Aug, 1-Aug etc ?
The method should also work when I have many more columns of dates.

Ps I cant upload the data on MaplePrimes since it is a csv file.

how to show chain rules result when diff this

Eq1 := f(x,g(x,t)) + f(x,y);
diff(Eq1, x);

 http://math.stackexchange.com/questions/372093/chain-rule-definition-f-fx-gx-y

https://drive.google.com/file/d/0Bxs_ao6uuBDUanVWYm1SMWc4R3M/view?usp=sharing

Hello All,

I have the PDE system shown below. It is a simple system for 2 unknown functions f1(x,t) and f2(x,t). Also, say we have x=x(t)=e^t for example. How does one solve such PDE system with Maple? I tried including the condition x=e^t in the PDE system itself, but got "System inconsistent" error message. x=x(t) can be looked at as an additional constraint and I am baffled how do I feed it into the PDE solver. 

Perhaps someone has experience with such systems?

Hi,

  My question is related to this one http://www.mapleprimes.com/questions/37447-How-Can-I-Sort-A-List-Of-List-According

but not exactly the same.

  Suppose I have lists

***

f[1]:=[1,3,2];
f[2]:=[2,1,3];
f[3]:=[1,2,3];
f[4]:=[2,3,1];
f[5]:=[3,2,1];
f[6]:=[3,1,2];

***

  The aim of sorting is first, arrange by ascending order of the first variable, then the second, then the third.

I could program manually by explicitly comparision, is there any robust way in maple can do it (possibly a few build-in function)?

Thank you very much!

Just trying Maple again after 10+ years, so please bear with me. I am basically trying to do a symbolic integration, where the output should be the antiderivative of the function I am integrating. However, I have not been able to succesfully get the output I expect.

I defined a function C_p(T), with constants C₁, C₂, etc. like so:

C__p := T -> C__1+C__2(C__3/(T*sinh(C__3/T)))^2+C__4(C__5/(T*cosh(C__5/T)))^2 

But when I integrate the function using int(C_p(T), T=T_ref..T_sys) it does not output the antiderivative as I would expect. This is what I am looking for, but it just gives me the equation within the integral sign without symbolically solving integral. Can this be done?

It should be,

int(C_p(T), T=T_ref..T_sys) = C₁*(T₂-T₁) + C₂*C₃[coth(C₃/T₂) - coth(C₃/T₁)] - C₄*C₅[tanh(C₅/T₂)-tanh(C₅/T₁)]

Trivial integrals such as int(x2,x) = 2x solve okay, so I am assuming I setup the problem incorrectly. I just cannot figure out what I did wrong, and it is driving me crazy. I already wasted more time than is healthy on this. Any help would be greatly appreciated. Thanks.

f(x, g(x,y)) + f(g(x,y), y) >= f(g(x,y), g(x,y))
f(x, g(x,y)) + f(x, g(x,y)) >= f(g(x,y), y)

f(x, g(x,y)) + f(x, g(x,y)) >= g(f(x,y), y)

f(x, g(x,y))*f(x, g(x,y)) >= f(g(x,y), y)

how to create a combinations of function of another function in maple

I'm writing an algorithm that takes a while and I'd like to print status messages periodically. I typically use the command line interface, and this is no problem. I just do a printf whenever I need.

However, some people who will use this code prefer to use the GUI, and I've found that the GUI tends to buffer the output from printf, printing 20-30 printf statements in clumps instead of as they're called. Is there any remedy for this?

hi.i am a problem with rule solve or fsolve in maple....please see attached file and say your comments

thanks

equ.mw

How do I solve this? Can anone help?

Here x and y both are variables.

Hi,

I have a small problem. I want to findout area under a curve. I got the plot from solving a partial differential equation. I want to find out area under the curve with out using interpolation. Are there any methods to find this.

here i enclose the method i have done.

Es := 0.117108e12:
Ef := 0.78125e11:
l := 0.150e-6:
s := 0.500000e-3:
f := 0.5898334197e-6:
o := 0.9e-5:
d := 0.10e-17:
cb := 0.1e7/(19.9):
c := l*f/(d*cb):

PDE := diff(u(x, t), t)-(diff(u(x, t), x, x)) = 0:
            
with(plots):
with(plottools):
ys := -0.4245333333e-1:
IBC1 := {u(x, 0) = 0, (D[1](u))(0, t) = 0, (D[1](u))(1, t) = c}:
S1 := pdsolve(PDE, IBC1, numeric, time = t, timestep = 0.1e-2);

p2 := S1:-plot(t = .2525);

p3 := getdata(p2);

p3[3]:
co:=CurveFitting[PolynomialInterpolation](p3[3], x):
Area := int(co, x = x[1] .. x[2]):

So this is the procedure i used to find out, but can there be any other procedure to findout area directly from hte solution of PDE.

Thanks.

plot(t+1, t); plot(t+1, t = -1 .. 1);

Error, (in plot) incorrect first argument t+1
Error, (in plot) incorrect first argument t+1

Here is my code

restart;
with(LinearAlgebra):
P := unapply(Matrix(4, 4, {(1, 1) = p[w], (1, 2) = p[x], (1, 3) = p[y], (1, 4) = p[z], (2, 1) = -p[x], (2, 2) = p[w], (2, 3) = -p[z], (2, 4) = p[y], (3, 1) = -p[y], (3, 2) = p[z], (3, 3) = p[w], (3, 4) = -p[x], (4, 1) = -p[z], (4, 2) = -p[y], (4, 3) = p[x], (4, 4) = p[w]}),(p[w],p[x],p[y],p[z]));
evalm(P(x,y,z,w));

(y1, y2, y3, y4) -> rtable(1 .. 4, 1 .. 4, {(1, 1) = y1,

(1, 2) = y2, (1, 3) = y3, (1, 4) = y4, (2, 1) = -y2,

(2, 2) = y1, (2, 3) = -y4, (2, 4) = y3, (3, 1) = -y3,

(3, 2) = y4, (3, 3) = y1, (3, 4) = -y2, (4, 1) = -y4,

(4, 2) = -y3, (4, 3) = y2, (4, 4) = y1}, datatype = anything,

subtype = Matrix, storage = rectangular, order = Fortran_order)

S:=Matrix(3,5):
for j from 1 to 3 do;
for k from 1 to 5 do;
S[j,k]:=P(seq(RandomTools[Generate](integer(range = 0 .. 4)),i=1..4));;
end do:
end do:
S;
W:=Matrix(3,5):
for j from 1 to 3 do;
for k from 1 to 5 do;
W[j,k]:=Transpose(S[j,k]);;
end do:
end do:
W;

M:=Matrix(3,3,shape=symmetric):
for j from 1 to 3 do;
for k from 1 to j do;
M[j,k]:=P(x[j,k],y[j,k],z[j,k],w[j,k]);
end do:
end do:
M;
N:=Matrix(3,3,shape=antisymmetric):
for j from 1 to 3 do;
for k from j+1 to 3 do;
N[j,k]:=P(u[j,k],v[j,k],q[j,k],r[j,k]);
end do:
end do:
N;
H:=M+N;
(Transpose(W)[2].H.Transpose(Transpose(S)[2]));

I would like the output to be a 4x4 matrix.

my project supervisor has made it mandatory that i build a maple maplet of the bessel equation: