I need to formally partial-differentiate a given arbitrary function G(z,w) with respect to two other variables z=z(s,t) w=w(s,t) and then to express the p-th-total-order partial derivatives of z with respect to s and t as a polynomial in the partial derivatives of G with respect to z and w and the partial derivatives of w with respect to s and t, divided by the partial derivative of G with respect to z raised to the power 2p+1.   The eliminate function allows me to eliminate all partial derivatives of z w.r.t. s and t of total order lower than p.

I have a 3-dimensional dynamic system of ODEs characterized by zero eigenvalues at the origin. I would like to know if it's possible to find one trajectory converging towards the origin.

My system is derived from a control problem and has consequently control-like and state-like variables -- while the neighborhood is typically unstable I need to know if an appropriate choice of initial values can steer the system towards the origin;  I expect at most one such trajectory.

Is there a way to set a default header for every new maple document?

hi everyone. i am a complete beginner to maple, have used it for about 1 hour in total.  could you take me through step by step how to solve coupled equations please. for example:

3x+5y+7x=25, 4x-2y-3z=15, x+y+z=0

to obtain solutions for x, y and z

any help is very appreciated. thank you

What's the difference between VerticalBar and VerticalLine?

we have:

x = c[2]*e/c[1]+(2*c[3]*c[1]-3*c[2]^2)*e^2/c[1]^2+(3*c[4]*c[1]^2-10*c[2]*c[3]*c[1]+8*c[2]^3)*e^3/c[1]^3

how can we find a function "F(x)" the first three terms of whose power series around "e=0"  is given as:

1+c[2]*e/c[1]+(2*c[3]*c[1]-c[2]^2)*e^2/c[1]^2

Hello,

I'm try to access some external Fortran routines within maple. I have a Fortran datatype of

  character*255 hf(20)

This is an input parameter, and I believe this will map into a maple Array object, but I'm not sure of the datatype. The help says that the datatype can only be "hardware datatypes" so I take to mean it would have to be of type integer[4]...when I do this I get the error below.

Hello,

I am interested in computing the image of a constructible set in Maple.  I am using Maple 12 on a remote machine.  I am able to load the ConstructibleSetTools, ChainTools, and RegularChains libraries.  This paper indicates that the authors were using Maple 12 and have defined the RationalMap command.

Hello,

Just a question about presentation.

If I have  a program like this:

for i to N do
for j to N do
i+j
od;
od;

How to show it like this?

for i to N do
   for j to N do
        i+j
    od;
od;

I have tryed some compositions with the keyboard but "everything doen't work".

Many thanks,
Ternox

Very few people would ever need this, I think, even while programming. But sometimes the details of the call stack are just what one wants.

So, for example,...

> h:=proc(x)
>   debugopts('callstack');
> end proc:

> m:=module() export f; local g;
>   f:=proc(x)
>     g(x^2);
>   end proc:
>   g:=proc(x)
>     global h;
>     h(x^3);
>   end proc:
> end module:

> m:-f(a);
[DEBUGSTACK, h, `debugopts('callstack')`, [a^6...

How do i code into maple to check if a matrix is diagonally dominant?

s:=Matrix([[2,1,2],[-5/4,-5,5/4],[21/5,-14/5,7]]):
 

s[1,1];

2

s[1,2] + s[1,3];

3


this is what av done so far but i dont think its correct

for i from 1 to 3 do
for j from 1 to 3 do

s[i,i] <= s[i,j] + s[i,j+1]

od:od:

hello everybody,

Just a little question about lists.
I have a result like this

Result := {alpha[2] = -1.536774530, alpha[3] = -2.345615736};

How to select -1.536774530 and -2.345615736 ???

If I do Result[1];     it return alpha[2] = -1.536774530.

Many thanks !!!

Ternox

Hi,

How do I label something without having to have maple evaluate it first?

For instance I would like something like this

to be labeled on the right side, when i try it just retuns false.

I defined five functions f[i] and three functions u[j].

Afterwards I integrated f[1]*u[1] for x=-infinity..infinity and defined it as E[11].

Then I defined an equation eqn[11] := E[11] = u[1]

Last but not least I solved eqn[11] to x. So far my doing was none of a problem and produced the expected result.

Then I wanted to let maple do this procedure with all combinations of f[i] and u[j].

So I wrote the following nested for loops:

I want to integrate a function which includes a proc. For example

P:=proc(t,w::list)

local v;

v:=choose an element from the list w, according to the value of t

return v

end proc

and my integrand is like this:

F:=(a,b,c,d)->a*b*c*P(d)