Maple 18 Questions and Posts

These are Posts and Questions associated with the product, Maple 18

I am new to maple. how do i segregate different term in long PDE in maple

Dear Maple users,

I am solving a system of linear equations Ax=b where A is a matrix (243*241) which contains a rational polynomial of unknown "kappa" along with floating numbers. As suggested in some other posts I am using Linear algebra package with the LinearSolve command and option "solve" to find out unknown vector x. b is a vector having entries zero and 1. The system is such that two equations are redundant but it is difficult to recognise which two are redundant and hence for the time being I am keeping them in the matrix. (For a known value of kappa (say kappa=2) I have checked that two equations are redundant.) For the reference, the matrix and the right-hand vector b is attached as text.

There are two issues

1) Maple takes very long time (12 hours and so) to get x=b\A;

2) The result is a long expression i.e.  x[i] is a rational polynomial in kappa; a very long rational polynomial which I am importing as a text. I am not sure if maple exports all terms in the polynomial as for the different value of kappa I see Ax-b >0. 

How can I overcome this problem? Any help will be greatly appreciated. 

I have final project to make a media for learning mathematic using maple. But I'm so confused to make a net of cuboid, anybody can help me? please :D

Dear all

I have an operator given below in the image. I want expand this operator upto order 5, when there are three independent variables x, y, t(i=1,2,3). The expansion can also be obtained manually, but that is always prone mistake, is the expansion posible using any routine of Differential Geometry package?

Hi everybody

In the attached file, when I run the code an error appears while calculating "omegaL1" parameter. The dimensions of the matrices are correct but the source of error is unknown to me. Can anyone help me?

Thanks in advance

R2_Link_2D.mw 

This must have a simple answer but I have been unable to figure it out after many attempts. 

I am trying to create a Clifford algebra, and then use the results in the multiplication table "MT". The multiplication table elements are correct as displayed, but I don't know how to access the results in the table (i.e. the products of the basis elements).  For example, trying to access the table results as matrix elements like MT[2,3] doesn't work, presumably because it is not a matrix. In other words, I need a matrix that contains the same information as the multiplication table.

DGsetup([x, y, z], M);
I12 := Matrix([[-1, 0, 0], [0, -1, 0], [0, 0, -1]]);
AD3b := AlgebraLibraryData("Clifford(3)", Cl3Q, quadraticform = I12);
DGsetup(AD3b, '[e0, e1, e2, e3, e12, e13, e23, e123]', '[omega]');
MT := MultiplicationTable(Cl3Q, "AlgebraTable");

 

i want to solve the system of equation ( 1 )  , (2)  ,  (3)   under the assumation that x , y have the CDF in (4)  ,  (5)
 

diff(L(lambda[1], lambda[2], alpha), lambda[1]) = n/lambda[1]+sum(x[i], i = 1 .. n)-(sum(2*x[i]*exp(lambda[1])/(exp(x__i*`λ__1`)-1+alpha), i = 1 .. n))

diff(L(lambda[1], lambda[2], alpha), lambda[1]) = n/lambda[1]+sum(x[i], i = 1 .. n)-(sum(2*x[i]*exp(lambda[1])/(exp(x__i*`λ__1`)-1+alpha), i = 1 .. n))

(1)

diff(L(lambda[1], lambda[2], alpha), lambda[2]) = m/lambda[2]+sum(y[j], j = 1 .. m)-(sum(2*y[j]*exp(lambda[2])/(exp(y__j*`λ__2`)-1+alpha), j = 1 .. m))

diff(L(lambda[1], lambda[2], alpha), lambda[2]) = m/lambda[2]+sum(y[j], j = 1 .. m)-(sum(2*y[j]*exp(lambda[2])/(exp(y__j*`λ__2`)-1+alpha), j = 1 .. m))

(2)

diff(L(lambda[1], lambda[2], alpha), alpha) = (n+m)/alpha-(sum(2/(exp(x[i]*`λ__1`)-1+alpha), i = 1 .. n))-(sum(2/(exp(y[j]*`λ__2`)-1+alpha), j = 1 .. m))

diff(L(lambda[1], lambda[2], alpha), alpha) = (n+m)/alpha-(sum(2/(exp(x[i]*`λ__1`)-1+alpha), i = 1 .. n))-(sum(2/(exp(y[j]*`λ__2`)-1+alpha), j = 1 .. m))

(3)

G(x, lambda[1], alpha) = 1-alpha/(exp(lambda[1]*x)-1+alpha)

G(x, lambda[1], alpha) = 1-alpha/(exp(lambda[1]*x)-1+alpha)

(4)

G(y, lambda[2], alpha) = 1-alpha/(exp(lambda[2]*x)-1+alpha)

G(y, lambda[2], alpha) = 1-alpha/(exp(lambda[2]*x)-1+alpha)

(5)

``

``


 

Download internet.mw

How do we write code for optimal problem using Pontryagin's maximum principle for simulation.

In Maple18.02:

Hso := Matrix(8, {(1, 4) = -x, (1, 6) = I*x, (2, 3) = x, (2, 5) = I*x, (3, 2) = x, (3, 5) = -I*z, (3, 8) = y, (4, 1) = -x, (4, 6) = I*z, (4, 7) = -y, (5, 2) = -I*x, (5, 3) = I*z, (5, 8) = -I*y, (6, 1) = -I*x, (6, 4) = -I*z, (6, 7) = -I*y, (7, 4) = -y, (7, 6) = I*y, (8, 3) = y, (8, 5) = I*y})

av, AV := LinearAlgebra[Eigenvectors](Hso)

Error, (in Polynomial:-Quadratic) type `truefalseFAIL` does not exist


This does not happen in Maple17.

Friends

I have plotted some figures and saved them yesterfay!

now once i opened them some nonsence digits appear on the figure! see the picture please. anyone has similar experience? how to solve it!

Dont make me disappointed maple! two days work is invain now !

 

Hello,
When I try to put the Gcdex in a procedure and start maplemint, then there occurs an error.

Gcdex(x^2 - 1, x - 2, x ,'s','t') mod 3;

--> works

But:

restart;
a := proc()
    Gcdex(x^2 - 1, x - 2, x ,'s','t') mod 3;
end proc;
maplemint(a);

Then there is an error I don't understand.

Error, (in maplemint/expression) not implemented POLY

By the way I have a fundamental problem to understand, where the values s and t are saved after calling Gcdex (or Quo, Rem, etc.). Till now I thought, that variables s and t are created, but when I declare s, t at the beginning as local variables and start maplemint, then there is something like:

    These parameters have the same name as constants:
      3
    These local variables were used before they were assigned a value:
      r::name, (-x-1)::name, (x-1)::name

So the names of s and t changed, they don't assign a new value? I don't understand that.

 

I having a hard time with defining a vector, in order to store in it some data, then plot it and export it to a file, I copied all what's in the help instructures but it doesn't work everytime, please it's urgent for my PhD thesis !

Hi, I have a big system with 27 polynomial equations in 16 unknowns: f_1=...=f_27=0.  I can store these equations but I cannot calculate a Grobner basis of the ideal  J generated by my polynomials (allocation problem) - I use the library "with(FGb)"-  What interests me is whether my system is minimal in the following sense.

If, for example,  I remove f_1, is the ideal generated by (f_2,...f_27)  J again ? That is to say, is f_1 in the ideal generated by f_2,...,f_27 ? I would like to get an answer "yes" or "no" for each removed  f_i.

My question: can we solve the problem above  without calculating a Grobner basis of J?

Thanks in advance.

 

 

 

 

 

Hello every one,

I'm using Maple to create a compiled program of my model Maplesim. I had a error with "getcompiledProc" command, which is :

Error, (in GetCompiledProc) non-numeric initial condition for `Main.RAB.value`(t): Float(undefined)

the "Main.RAB.value(t)" represent a probe used to visualize an output of my system.

Does anybody had a such error ?
Thank you for your responses.

Larbi ANIBA

Hi, I need help with this little university assignment.

See the thumbnail below.

I have been away from the class because of a staph infection and missed the notes about vectors and Euler's formula.

 

It would be helpful if someone could give a rundown about how to solve the problems or give a general solution.

 

 

-Thanks

1 2 3 4 5 6 7 Last Page 3 of 69