Hello, I'm currently trying to approximate the solution of a PDE with Maple, but I'm having troubles with the boundarie conditions .
For instance, when I set : (dT/dr)(r=3,t) = 0 , everything works fine .

With (dT/dr)(r=3,t) = -T(r=3,t), it's still okay .
But if I set (dT/dr)(r=3) = -T(r=3,t)^4, Maple just ignores the second member and works as if it was 0 . There is no error notification, but I don't get a satisfying solution ..

I have occasionally a need to map a function over the components of an expression; but not just at the top level---which map() does---but to an arbitrary level. One application is e.g. to throw simplify at subexpressions of a complicated object. Sooner or later I will want to specify the deepest level also... I looked through the docs and Help but could not find anything like that. I had expected map[n]() to do something like this, but it does not.

Does Maple have a...

Dear Maple users

We are using Maple at our school. Usually activation with the Activation code works well if the computer has a good connection to the Internet. Our data instructor have however experienced a problem with two computers he cannot seem to solve. He is not able to activate Maple 16 on those computers. After a failure in activation he even reset the license.dat file. Maybe someone have an idea to how we can get those computers activated and what the problem...

hello every body

how can i solve this equation with respect to z

a, b are constants

3a(1+z)^2=2(a(1+z)^3+b)^(1/2)

Dear experts, I have problems about "subs", see below

> restart:

> assume(A>0): interface(showassumed=0):
> f:= A^2-2*sqrt(A^2+1)+1;

Now I want to replace A^2+1 to M^2, so idealy, what I want to see is

M^2 + M

When I do:

> f2:= subs(A^2+1 = M^2,  f);

Maple shows 

A^2-2*sqrt(M^2)+1

Maple cannot replace A^2+1

I have a very large system of rather long equations.   I need to find a way to have maple recognise if two equations within the system are the same.  I've been attempting to do this by adding each of them to the same set.  Maple automatically eliminates two identical entries in a set, so this works quite well for, say, x+y=0 and y+x=0 - maple knows these are the same and deletes one from the set automatically.  However it does not recognise that x+y=0 is the same as 2x + 2y = 0.

Well, it’s been more than 17 years since First Leaves: A Tutorial Introduction to Maple V was first published as a hardcover book, and since that time, Maple, the Maple documentation, and the world have undergone huge changes.   We are now in a state where all our documentation is available electronically, including both in-product and online; where the vast majority of our customers receive our products electronically and never even see the printed...

Although unfinished, this project I had left idle for a while and just thought to share with the community.  Not fancy by any means, no graphs or anything, was just having fun creating a worksheet on mortgages but then ran out of free time to work on things as usual, anywyas.  I skipped the derivation for the formula after n payments at the end and just provided the formula and dove right into an example.  For interest, my applications usually have numbers after...

Hello all,

I have the state-space form of a dynamics sytem:

X_dot = AX+B.U

Y= C X,

The initial conditions of the outputs (Y0) are also given.

A is 7x7 known matrix,

C is 14x7 known matrix,

B = 0;

The problem is that it's too long to write down every equations (14+7 eqns) and variables in "dsolve" function

Would you please show me the shorter way to solve a very large state-space system?

I really appreciate your help.

Hi all,

I have the following equation: A.X = Y

A is a 14x7 known matrix, Y is a 14x1 known matrix, and X is a 7x1 unknown matrix Would you please how to find the solution X of this equation in Maple.

Thank you so much,

STH

PS: I attached matrices A and Y in this post
A.txt
Y.txt

Dear friends, I recently answered a query concerning the action of the automorphism group of the Petersen graph on its edges at math.stackexchange.com. The algorithm that I present is quite naive, but it does produce the desired result. I thought I would share it here because it makes a nice Maple programming exercise e.g. for a talented student at high school level. (I have always thought that Polya counting and permutation groups belong into the high school curriculum.) It makes extensive use of Maple's internal hash function for compound objects to efficiently compare them during the computation. It is quite interesting to observe how Maple does work hard for several minutes to do this computation and then comes up with the correct answer. (Obviously the core computation needs to be done only once.) Enjoy!

Best regards, Marko Riedel

If you come up with a better algorithm then please do share it at the stackexchange link.

Important update Mar 24 2016. The algorithm at the above post is middling to say the least, but can perhaps serve as an example of Maple computational techniques. There is an efficient algorithm including Maple code here at math.stackexchange.com.

Dear Maple Users,

I do need to find the intersection of two surfaces which defined by two equations eq1 and eq2, (see attached file).

There was similar question on the MP: 
http://www.mapleprimes.com/questions/127821-How-To-Plot-The-Intersection-Of-Three-Surfaces

, but that doesn't work in my case. And I can't understand why....

Hello everyone,

I am trying to execute a procedure but its not giving me the desired output.

Please have a look.

Ad_proc.mw

Thanks

I'm using maple 14 on a win7 2.8gHz 4gb laptop and over the past 2 days my maple has fallen appart, i'm trying to print a worksheet that is only 5 pages and not especialy complicated but maple's memeroy usage is exploding up to 400mb, or 1.3gb if i actually run the code. I need to print the work sheet and it just spent half an hour "spooling" i don't know what is causing maple to go haywire

hi frndz...i want to generate a matrix of order n x n in maple through loops..for example if equation is 
rUi-1,j+1 -2rUi,j+1 +rUi+1,j+1 = rUi-1,j -2rUi,j +rUi+1,j

then how to write code that it generates n x n matrix for above equation if at jth level values are known and j+1 level vaules are unknown...