Pick any point P and let Q = (1, −1, 1). [Your choice for P can be anything other than the origin or

Find an equation for the line l1 that passes through P and the origin. Plot the line segment formed by P and the origin in Maple 

How would I plot this?

Please, I need assistance with this problem.

Here is the problem I am trying to solve:

restart:
with(plots):
with(LinearAlgebra):
with(PDEtools):
with(Student):

myPDE1 := D11*diff(w(x,y), x$4) + 2*(D12+2*D66)*diff(w(x,y), y$4) + D22*diff(w(x,y), x$2, y$2) - G*diff(w(x,y), x,y)= 0;

pdsolve(myPDE1);

pdsolve(myPDE1, build);

"Boundary conditions";
"(Note:the domain for the problem is a rectangle)";
bc1 := w(0,y) = 0; # @ x=0 edge;
bc2 := w(a,y) = 0;  # @ x=a edge;
bc3 := w(x,0) = 0; # @ y=0 edge;
bc4 := w(x,b) = 0; # @ y=b edge;
bcx1 := -D11*D[2](w)(0,y) - D12*D[2](w)(0,y) = 0; # @ x=0 edge;
bcx2 := -D11*D[2](w)(a,y) - D12*D[2](w)(a,y) = 0; # @ x=a edge;
bcy1 := -D12*D[2](w)(x,0) - D22*D[2](w)(x,0) = 0; # @ y=0 edge;
bcy2 := -D12*D[2](w)(x,b) - D22*D[2](w)(x,b) = 0; # @ y=b edge;

sol := [myPDE1, bc1, bc2, bc3, bc4, bcx1, bcx2, bcy1, bcy2];

pdsolve(sol);

"Note:
and D11, D12, D22, D66 and G are constant.
The intention is to find the critical value for G"

I need help with how I can handle the boundary conditions for the problem. Thanks a million.

Hi,

I want to join two animations, but displayed subsequently, not simultaniously, As far as I got, I have:

plot2 := plots[animate](plot, [tau[1], z = -(1/2)*J .. (1/2)*J, color = red, legend = shear*stress], h = 1 .. 1+1/sqrt(3));
plot3 := plots[animate](plot, [tau[2], z = -(1/2)*h .. (1/2)*h, color = red, legend = shear*stress], h = 0 .. 1);
display([plot2, plot3], insequence = true);

my functions are difined as

tau[1] := h-1+(4/3)*(1/sqrt(3)-h+1)*sqrt(3)*(sqrt(3)*((1/4)*J^2-z^2)/(J^2*b))
tau[2] := (4/3)*sqrt(3)*((1/4)*h^2-z^2)/(h^2*b)

Both plots work individually, however, they have successive ranges. I wondered if I could make 1 plot, with an if statement wether to plot tau[1] or tau[2] depending on where the animation is in the range h. Does anyone know about a solution?

I need  some examples s.t. the computation of their lexicographic Groebner basis is heavy?

Thank you so much.

Already searched and browsed multiple different threads and still cannot find a solution.

Apologizing the noob nature of this question.

In this code below, Why is the factor command not working?

Download factor_polynomial_2_multivariable.mwfactor_polynomial_2_multivariable.mw

Hello people in maple primes

I have a question, which is about the matrix shown in http://www.mapleprimes.com/questions/217852-HOW-I-Convert-Root-Of-In-To-Another-Common-Form

Why can't C below be shown with beta?

A := Matrix(3, 3, [[-a, a, 0], [0, 0, -sqrt(l*b*c*(j+k))/(j+k)], [2*j*sqrt(l*b*c*(j+k))/((j+k)*l), 2*k*sqrt(l*b*c*(j+k))/((j+k)*l), -c]]);
B:=subs(l*b*c*(j+k)=alpha,A);
C:=subs(j*alpha^(1/2) = beta,B);
e:=subs(alpha^(1/2) = gamma,B);

Best wishes.

taro

From differential expression I am trying to extract coefficients corresponding to given indets, but the coeffs command is giving me error as "invalid argument to coeffs"

For example for worksheet titled "[852] Determining Equations using Prolongation" the error is showing for expression (9).

Whereas the same command in worksheet titled "[411] Determining Equations for Variable Coeff KdV(Reviewed)" is working okay and is giving desired result at (16).

I am running both worksheets in Maple 18.

[852]_Determining_Equations_Using_Prolongation.mw

[411]_Determing_Equations_for_Variable_coefficient_KdV_(reviewed).mw

Regards

Can anybody please tell, where I can find seminar/workshops on Maple training ?

Regards

Dear All,

I am a new Maple user and I am still unaware of a lots of fancy features of Maple. I have a problem of simultaneous fitting polynomials. I wish that I could have help from you. Say, we have two polynomials of two variables,

f1(x,y)=a1+a2*x+a3*y+(a4+a5)*x²+(a4-a5)*y_²;

f2(x,y)=b1+b2*x+b3*y+(a4-a5)*x²+(a4+a5)*y_².

Note that a4 and a5 are shared by the two polynomials. I would like to fit the two polynomials against their respective data set. Is there anyway I can do it using Maple? Any of your help is highly appreciated!

Best regards,

Toby

HI

HOW I convert root of in to another form

thanks

lorenz_5.mw

I'd like to find out what number Maple can still calculate the isprime for, and what number will make it go "No thanks, this is madness - ERROR".

I tried isprime (10^100,000,000 + 2), and it can still calculate the result. No prime of course, that's the whole point of the +2.

I tried isprime(10^10ˆ9 + 2) and it crashed.

But what is the tipping number?

I decided I should write a loop, and let maple write away the last number till it crashes. Is this possible? I think I'll need something like

> for n from 5 to ??? do isprime (10ˆn + 2) and ??? end do

This isn't suitable at all, but I cant figure out how to program "to error" or "write away this number"...

I hope the question is clear and look forward to ideas on how to make this work.

Dear Community,

I have difficulties evaluating a rather complicated infinite integral (see attachment). The result should be something like 12.319. Any idea how to go get this?

Tx for the kind help in advance,

best regards

Andras

Infinite_Integral_2.mw

Plz help me！ How to accelerate the calculation speed the following the program？

restart;
with(PDEtools); declare((u, W)(x, t)); KN := 10;
AFP := proc (C1, C2, C3, C4, H, KN, N) local ADM1, n, lambda, F, i, A0, A, U, W, u, L, R, NL, w, PDE1, IC1, d, Eq1, Eq2, Eq3, LI, trL, tr1, trN, Apr, AprK, trSol, Sol, AD; declare((u, W)(x, t)); ADM1 := proc (n) options operator, arrow; convert(subs(lambda = 0, value((Diff(F(Sum(lambda^i*U[i], i = 0 .. n)), `$`(lambda, n)))/factorial(n))), diff) end proc; A0[0] := F(U[0]); for n to KN do A0[n] := ADM1(n) end do; for n from 0 to KN do A[n] := convert(C1*(diff(subs({seq(U[i] = W[i](x, t), i = 0 .. KN)}, expand(subs(F(U[0]) = U[0]*exp(U[0]), A0[n]))), x)), diff)+convert(C2*subs({seq(U[i] = Diff(W[i](x, t), x), i = 0 .. KN)}, expand(subs(F(U[0]) = U[0]^2, A0[n]))), diff) end do; L := proc (w) options operator, arrow; diff(w(x, t), t) end proc; R := proc (w) options operator, arrow; C3*(diff(w(x, t), x)) end proc; NL := proc (w) options operator, arrow; C1*(diff(w(x, t)*exp(w(x, t)), t))-C2*(diff(w(x, t), x))^2 end proc; PDE1 := proc (w) options operator, arrow; L(w)-R(w) = -NL(w) end proc; IC1 := u(x, 0) = sum(2*(int(sin((d+1/2)*Pi*x/H), x = 0 .. H))*exp(-C4*(d+1/2)^2*Pi^2*t/H^2)*sin((d+1/2)*Pi*x/H)/H, d = 0 .. N); LI := proc (w) options operator, arrow; Int(w(x, t), t = 0 .. t) end proc; tr1 := u-rhs(IC1); Eq1 := LI(lhs(PDE1(u))) = LI(rhs(PDE1(u))); Eq2 := simplify(subs(lhs(Eq1) = tr1, Eq1)); trL := u = add(u[j](x, t), j = 0 .. KN); trN := LI(NL(u)) = Int(Sum(A[i], i = 0 .. KN), t = 0 .. t); Eq3 := subs(trL, lhs(Eq2)) = subs(trN, rhs(Eq2)); Apr[0] := u[0](x, t) = rhs(IC1); AprK := u[k+1](x, t) = -(Int(AD[k], t = 0 .. t)); for i from 0 to KN do Apr[i+1] := value(subs({seq(Apr[m], m = 0 .. i)}, subs({seq(W[m] = u[m], m = 0 .. i)}, subs(k = i, AD[i] = A[i], AprK)))) end do; trSol := {seq(Apr[i], i = 0 .. KN)}; value(subs(trSol, trL)) end proc;

Download AFP.mw

Am here again, pls help me check out this adm code, cant get a result.

below is the attached file

 adm_2_method.mw

Ok i have used a diverse range of programming IDE now, but i am of course alot more comfortable the maple interface simply because of the amount of time i have spent on it, also it was my first "real" introduction to programming, but i was keen to trial and review of all the major CAS out on the market, but for a common purposed package within them they provide, for example the number theory package.

So the question is quite broad, im looking for suggestions for the most unbias way to go about this.

it would need to be a coauthored review with a representative writer for the seasoned user for each one right?