A simple question. I have this:

k*(2x+y-3z+2)+s*(5x+5y-4z+3)=0

And I want to group it by x, y, z, so that I would get:

x*(2k+5s)+y(k+5s)...=0

I'm using Maple 11.

Hey, I'm just starting to work with maple and I have no idea how i could restract a,b,c,d,e,f,g,h,i in a 3x3 matrix

Hello everyone

I want to check whether a recurrence relation produces integers. What I have written is rather messy, I ideally would like some kind of Proc where I can just put in the recurrence relation, the initial conditions and the number of terms I would like to check. Then get a result out which tells me whether the terms in the sequence are all integer. 

I have written the following (which tells me what I want to know but in a crude way)

problem := ur+dr, {con1, con4, con5}, seq(w[i] = 0 .. 1, i = 1 .. N):
problem_matrix_form := Optimization:-Convert:-AlgebraicForm:-LPToMatrix(problem):

Optimization:-LPSolve(problem, maximize = true);
Optimization:-LPSolve(problem_matrix_form[2 .. 4], maximize = true);


The above trick-conversion method works for all LP and QP problems
However it does not work on NLP problems. I have attached the workshet

Hello!

I'm studying Computational Mechanic at the Technical University in Munich. Would you please be so kind and help solving this. During my study I'm encountered with Dimensionless Analysis which I do with Buckingham Pi-Theorem. There I have to set up a matrix, each of the colums get a name wich refers to a certain physical quantity. When you are applying the Buckinham Theorem, in most case you are dealing with a rank defiecient matrix. so many of the columns of my...

I want to ask a question about parallel programming capability of Maple (for Maple15). I have a 4-core PC (intel i7 processor) running under Windows-7(64-bits). I'm making a monte carlo simulation by using maple15. The simulation is very complicated such that it includes loops and inside these loops we use Newton-raphson method (a numerical algorithm). Because of being complicated iterative calculations, one simulation needs approximately 50 hours to be completed. And this...

I have a 3rd order nonlinear recurrence relation and I would like to produce the associated sequence.

Here is the relation x[n+2]:=(((x[n+1]*x[n])^2+x[n]^2+x[n+1]^3))/x[n-1]. At the moment the method I am using (a standard do command) is very computationally heavy when I want lots of iterates. I was wondering if there were faster loops, or procs.

Also I would like some kind of way to check if all the terms are integers, maybe some kind of summation where an...

Can Maple 13 solve nonlinear algebraic equations system numerically without using fsolve? for example Gauss siedel iterative method .

Projektet...mw

And indeed it has, 3/4th of my document is gone. What to do? Is there any way to fix this?

 Maple readily turns partial sum 1+sum(alpha^2, j = 1 .. l-1) into expression 1+(l-1)*alpha^2. 

I need to replace alpha with a function c(j) such that c(0)=1 and c(j)=alpha for j=1,2,3,...and to compute sum(c(j)^2, j = 0 .. l-1) symbolically to get the above expression. This is the simplest special case only and in general c(j) is 1 for j=0 and some expression involving j and alpha, beta, etc for j::posint.

I tried several thing, e.g., 

consider f=f(z)

whereby z=Complex(x,y)

how do you find diff(f(z),z)?

thanks in advance

I have the following setup of springs and dampeners:

which gives me the following ode system

Hi everyone.

I have a doubt:

On the example at "kinematic exports help", the position constrain equations are not the same as the one made by hand. In fact, they should be as:

l1·cos(theta)+l2·sin(beta)-s = 0

l1·sin(theta)-l2·cos(beta) = 0

I know that a bit difference might be due to de sector of the angle beta. However, what I cannot undestand is why the term "s" appears multiplying to "cos(theta)" in the example.

Can anybody please help me?

Regards.

Why do I get this error message:


X := proc (a, b) local w, V, i, E, s; global Nr, sampvar, u;

w := sampvar*(1-a-b);     V[2] := u[1]^2;

if w = 0 then w := 0.1e-4 end if;

for i from 3 to Nr-1 do V[i] := w+a*u[i-1]^2+b*V[i-1] end do;

for i from 2 to Nr-1 do E[i] := -(1/2)*ln(V[i]^2)-u[i]^2/V[i] end do;

s[1] := 0;   for i from 2 to Nr-1 do s[i] := s[i-1]+E[i] end do;

s[Nr-1]

end proc:

Hello, everybody! I can`t solve these equations. Please, help me! Thanks...

x=a*sin(k*z)±W/2;

k=2π/λ, λ=10000, a=3000, W=500;

and

x=z*tan(θ)-d*cos(θ);

θ=π/6, d=0..100;