Hi, I have a J(5x5 diagonal matrix), I have M(5x5 matrix). Let i be my rows and j be my columns. I'm trying to calculate [A]_ij = ([M]_ij)/(JJ_i-JJ_j-2)

I cant think of a proper way to do it. Please help.

M:=Matrix([[2,5,7,9,8],[8,5,2,6,8],[5,4,5,5,7],[1,4,9,6,6]])

J:=Vector([3,5,4,9,6])

JJ:=DiagonalMatrix(J)

A₁₁=2/(3-3-2), A₁₂

Hi. I have nodes:=7

How do i write a matrix with my first set of nodes = -1 and a second set as 1, in a diagonal form? Sort of like a identity matrix but not quite.

What I did was to write J:=Matrix([[-1,-1,-1,-1,-1,-1,-1,1,1,1,1,1,1,1]])    ####my vector will have 2 times the number of my nodes.

Then DiagonalMatrix(J)

But I then want to change my number of nodes. Could you please advice if there's a smarter way to do this please?

I want to solve equations,program in maple as follows:

solve({n = b+2*c+q+2*r, (a+b+c)/(p+q+r) = 9, n*b-3.32*a*(a+p+2*n)*10^(-7)*t^(5/2)*exp(-18.27*10^4/t) = 0, n*c-3.32*a*(a+p+2*n)*10^(-7)*t^(5/2)*exp(-32.035*10^4/t) = 0, n*q-3.32*p*(a+p+2*n)*10^(-7)*t^(5/2)*exp(-9.16*10^4/t) = 0, n*r-3.32*p*(a+p+2*n)*10^(-7)*t^(5/2)*exp(-18.77*10^4/t) = 0, a+b+c+p+q+r+n-.73*10^28/t = 0}, {a, b, c, n, p, q, r})

I can't get the results but  "Warning, solutions may have been lost"

Can anyone help me write a procedure for Maple 15 that does the following:

INPUT: number of unknowns and equations n; augmented matrix A=[aij], where 1<=i<=n and 1<=j<=n+1.
OUTPUT: solution x[1], x[2], ... , x[n] or message that the linear system has no unique solution.

Step 1: For i=1,...,n-1 do steps 2-4.  # Elimination process.

Step 2: Let p be the smallest integer with i<=p<=n and A[p,i]≠0.
          ...

every time I enter / or ^, maple automatically changed the text I entered into fraction or power, and I am having hard time enter equations normally like the way I do in graphic calculator or matlab. I am forced to type all my equations on a text pad and then copy over.

is there a way to stop maple from auto formatting my input text? I am more of a matlab guy and I really need to use symbolics and integration abilities right now, but this version of maple is making...

I would like to simplify algebraic modulo expression.

For example, (N+k) mod N should be simplified to k mod N (N and k are positive integers).

Is there a way to achieve this with maple?

Thank you!

can someone please help me out on how to solve second order nonlinear coupled ode with perturbation  method in maple

Problem. Let MNPQ be a square.  Find the other two vertices,  knowing that,  the vertices M(5; 3; -1), P(2; 3; -4) and N lies on the plane x + y - z  - 6 = 0.

This is my code

> restart:

with(LinearAlgebra):

M:=<5,3,-1>:

P:=<2,3,-4>:

N:=<x,y,z>:

A:=DotProduct(M-N,P-N,conjugate =false):

I have this

plotS := plots[:-implicitplot3d](S0(2, 1, x0, sigmaH) = S0(c, delta, xT, sigmaL), c = 0 .. 4, delta = 1 .. 3, xT = .8 .. 1)

to draw the graph below. What I would really like is to revert the direction of the xT axis. Any way to do this??

Thank you for your help

neeeeed help
Can someone help me to figure out what's wrong with my polygon's point representation inside my attachmed program? I  am not so much experieced with maple,actually I am a beginner, so can't see the fault in coding...

I'd really appreciate one's help,thx 

Hi, this is what i have

With(LinearAlgegra):

K:=ZeroMatrix(2):

J:=K.K^T

how do I get J to show me just a 2x2 zero matrix again? The output that I got is ZeroMatrix(K).ZeroMatrix(K)^T

Please help. Thanks.

Hi,

Im trying to animate a simple pendulum with maple 15. I'm able to make to the pendulum masse move, but, somehow, I can't animate the rope of the pendulum. I tried to draw the rope with the plottools library line , but no success.

Pendulum:=proc(x,y)plots[pointplot]([x,y],color=blue, symbol=solidcircle,symbolsize=25) end proc:
A:=animate(Pendulum,[XCoordinate,YCoordinate],t=0..8,frame=100):
Rope:=plottools[line]([0,1],[XCoordinate,YCoordinate],color=blue,thickness=3):

Dear all,

I have seen in the forum some post on this recently but cannot find it and thus ask this question again.

I have an output from a dsolve/numeric as a set of indexed names, like KK[1], KK[2], TT[1], TT[2], etc,

where KK[1]=eval(k(t),dsn) with dsn - output of dsolve/numeric.

I want to save to the file the result of last iteration (say, 15th) which is KK[15] in order not to repat all the calculations every time I open the file. In the file,...

Problem. Find the coordinates of the point M on the sphere (S): x^2 + y^2 + z^2-2*x+4*y+2*z-3=0 such that the distance from the point M 

I want to write a code to generate Legendre Polynomials using the Gram-Schmidt Process. I have no experience with programing. Here is how the process should work:

Given "(f) = {f[0]=1, f[1]=x , f[2]=x^(2) , f[3]=x^(3) , ... , f[n]=x^(n)} "
       
Find the Legendre Polynomials: "{P[0] , P[1] , P[2] , P[3] , ... , P[n]}"

First,  P[0]=f[0]=1

then, the rest are defined recursively by

P[1]=f[1]-(()/())*P[0] = x