Good day everyone, could you please help use Gauss Elimination method for these system of equations. See the worksheet here F1.mw

Thanks.

restart; with(linalg); with(stats); with(plots); with(Statistics); with(LinearAlgebra); 

s := 1/(273.16+50); s1 := 1/(273.16+145); s3 := 1/(273.16+250); s2 := 1/(273.16+197.5); gamma0 := 0.1e-3; gamma1 := .5; gamma2 := 0.15e-2; beta := -3800;
c := 300; n := 200; tau1 := 99; tau2 := 120;

Delta := solve(1-exp(-(gam0*tau1+(1/2)*gam1*tau1^2)*exp(beta*s1)) = 1-exp(-(gam0*a+(1/2)*gam1*a^2)*exp(beta*s2)), a);
a := Delta[1];

Theta := solve(1-exp(-(gam0*(a+tau2-tau1)+(1/2)*gam1*(a+tau2-tau1)^2)*exp(beta*s2)) = 1-exp(-(gam0*b+(1/2)*gam1*b^2)*exp(beta*s3)), b);
b := Theta[1];

n1 := n*(int((gam1*t+gam0)*exp(beta*s1)*exp(-(gam0*t+(1/2)*gam1*t^2)*exp(beta*s1)), t = 0 .. tau1));
200. - 200. exp(-0.01119474511 gam0 - 0.5541398828 gam1)
n2 := (n-n1)*(int((gam1*t+gam0)*exp(beta*s2)*exp(-(gam0*t+(1/2)*gam1*t^2)*exp(beta*s2)), t = a .. a+tau2-tau1));

g1 := -n1(gam0, gam1)*(int((1/(gam1*t+gam0)-t*exp(beta*s1))*(gamma2*t^2+gamma1*t+gamma0)*exp(beta*s1)*exp(-(gamma0*t+(1/2)*gamma1*t^2+(1/3)*gamma2*t^3)*exp(beta*s1)), t = 0 .. tau1))-evalf(n2(gam0, gam1)*(int((1/(gam0+gam1*(a+t-tau1))-(a+t-tau1)*exp(beta*s2))*(gamma0+gamma1*(a+t-tau1)+gamma2*(a+t-tau1)^2)*exp(beta*s2)*exp(-(gamma0*(a+t-tau1)+(1/2)*gamma1*(a+t-tau1)^2+(1/3)*gamma2*(a+t-tau1)^3)*exp(beta*s2)), t = tau1 .. tau2)))

g2 := -n1*(int((t/(gam1*t+gam0)-(1/2)*t^2*exp(beta*s1))*(gamma2*t^2+gamma1*t+gamma0)*exp(beta*s1)*exp(-(gamma0*t+(1/2)*gamma1*t^2+(1/3)*gamma2*t^3)*exp(beta*s1)), t = 0 .. tau1))-evalf(n2*(int(((a+t-tau1)/(gam0+gam1*(a+t-tau1))-(1/2)*(a+t-tau1)^2*exp(beta*s2))*(gamma0+gamma1*(a+t-tau1)+gamma2*(a+t-tau1)^2)*exp(beta*s2)*exp(-(gamma0*(a+t-tau1)+(1/2)*gamma1*(a+t-tau1)^2+(1/3)*gamma2*(a+t-tau1)^3)*exp(beta*s2)), t = tau1 .. tau2)))

solve({g1 = 0, g2 = 0}, {gam0, gam1})

I want to find the answer of gam0 and gam1. It takes me 20 hours until now...and still evaluating...

Please Help ..

I can't directly copy Maple code into messages but have to insert into Word first, apply some changes that for better readability and copy it from there via Word-paste. Is there a direct way?

I am trying separation of variables in Maple. I get an equation that has the form   

And now I want to tell Maple to assign the terms with 1/R in them to one variable, say eq21, and the term with 1/Z to second variable, say eq22 The idea is that I can later more easily work with each separate ode. 

I do not know to separate those apart. I could offcourse copy and paste by hand, but I want to automate this.

I tried match() and patmatch() but I am not seeing the way. Here is the code:

restart;
T:=  (r,z)-> Z(z)*R(r);
eq1:= diff(T(r,z),r$2)+1/r*diff(T(r,z),r)+diff(T(r,z),z$2);
eq2:=expand(eq1/(Z(z)*R(r)));

#need now way to break the above into 2 different variables.

ps. I know I can do this:

restart;
T:=  (r,z)-> Z(z)*R(r);
eq1:= diff(T(r,z),r$2)+1/r*diff(T(r,z),r)+diff(T(r,z),z$2);
eq2:=expand(eq1/(Z(z)*R(r)));
eq3:=collect(eq2,1/R(r));
eq21:=op(1,eq3);
eq22:=op(2,eq3);

But this for me is not the right way to do it. I think there should be more algebraic way.

there is a solution of equation,so the equation can be divided by the solution,but because the equation is complex,it can't be simplify by the soution,can anyone give me some help?thanks a lot.

Buenas

Alguien tiene el planteamento de la ecuacion 1D HEAT EQUATION en maple?

Me pueden enviar?

Gracias

Saludos

En anexo esta el enunciado

a curve has residual p if it is linked, in a complete intersection, to a curve with residual p-1

0 residual if is a complete intersection of two surfaces

do complete intersection means two surfaces totally overlapped?

why they are not the same one if complete intersection?

test.mw

In this file, I tried my best to solve the pde. But the answer is still rather non-informative. I need some help to simplify it.

I did notice that my Maple might need reinstallation, due to a "bug" in the 18.02 update.

My ultimate aim is try to use some similar techniques to solve this, test2.mw, which has a similar type pde.

The standard pdsolve(pde) would just not work.

UPDATE:

I used the same file in Maple 17 on a differnt Machine, which can be solved by pdsolve. So I guess it's just that  the 18.02 update package is broken itself. I have tried to uninstall and reinstall twice.

Thanks,

casper

I want to solve a system of 11^3 equations  (each equation is quite small) in 11^2 unknows. The equations are all viewed mod 2. I only want to know the possible solutions for 11 of those variables.

That is given variables a[i], 1 from 1 to 11 and b[n] for the remaining 11^2-11  variables.

I want to know all the  distinct consistent solutions for the a[i]'s. I dont care what the b's are as long as the solution to the a[i]s is consistent.

I am VERY sure that the equations will quickly show that there are no solutions but I am having difficulty comming up with how to code this. 

>restart:
>with(LinearAlgebra):
>with(Student[NumericalAnalysis]):
s := {E[1], E[2], E[3]};
v := {x[1], x[2], x[3]};
A := GenerateMatrix(s, v);
B := augment(A)
Then what i do that for any matric i can use same program.

Hi there,

this may be a common task but did not find any helpful hint nor an answer: is there any way to combine to arrays A and B into another one element-wise, i.e.:
C = [[A[1],B[1]], [A[2],B[2]],...,[A[N],B[N]]]
without doing a for loop?

Thanks,
jon

Recently, in one of the old book on programming came across the following problem: to place on the chessboard 5 queens so that each free field was attacked by at least one queen. This problem is called the problem of the dominant queens. I have not seen the implementation of this task in Maple. Naturally to solve this problem for an arbitrary board N by N. I have 2 variants to solve the problem, but I am not going to to present them yet, so that everyone can enjoy the independent decision. Especially the interesting case is the case of the board 6 by 6, when the solution is unique (certainly up to symmetry).

Of course, it is interesting for each board  N by N to find the minimum number of queens that satisfy the above condition. It seems that for arbitrary board  N by N the exact value of this number is not known. I do not know any other way of solving the problem as a brute force method.

1. if parametric equations are
x0 = a^4, x1=a^3*b, x2=a^2*b^2, x3=a*b^3, x4=b^4

how to find ideal below

e12 = x0*x2-x1^2
e13 = x0*x3-x1*x2
e14 = x0*x4-x1*x3
e23 = x1*x3-x2^2
e24 = x1*x4-x2*x3
e34 = x2*x4-x3^2

2.
if let y_i = x_i/x0 for i = 1..4
how to find above parametrically by below equations
y1 = b
y2 = b^2
y3 = b^3
y4 = b^4

Dear any body,

I have tried several models/documents (with diagrams) using maplesim v7 32/64bit, but the simulation can not finish and in  equation generation a message appear as follow "protype must be a sructured record type or a record, but receipt squeezed".Same mesaages also appear if I try all examples exist in maplesim. What a big problem this?

Please help me..thanks in advance

the functions about vector field plot is so terrible,

is there any method to get it beautiful, like mathematica or matlab?

more options is needed for arrow's position, length, angle and color.

is there a plan for it?

And, the scalar field plot in 2d is better than vector field plot, but in 3d, isosurface plot are still need to be enhanced.

If possible, the plots in Plotting Guide are all need improve.