Can anyone help me to solve the attached system of PDEs with a given expression for the HINT such as 

I am not able to set such an arbitray HINT function for system of PDEs.

SysPDE_HINT.mw

Thank you,

Ahmad

Here are 4 statements that attempt to use invlaplace on the exponential function. Two work, two don't.

Does anyone know why the two that don't work do that?

Thank you.

__________________________

with(inttrans);
[addtable, fourier, fouriercos, fouriersin, hankel, hilbert,   invfourier, invhilbert, invlaplace, invmellin, laplace, mellin,   savetable]
invlaplace(exp(-s),s,t);
                          Dirac(t - 1)
invlaplace(exp(s),s,t);
                    invlaplace(exp(s), s, t)
invlaplace(exp(s),s,t) assuming s<0,s::real;
                    invlaplace(exp(s), s, t)

invlaplace(exp(-s),s,t) assuming s<0,s::real;
                          Dirac(t - 1)
What is going on here?
 

Hello!
How do I solve ODE numerically. I tried, but I fall into a singularity when t is greater than 0.01.
Please help me!!!

I am a new user of Maple 2020. I have found that when I create a 3D plot, the point probe does not return the coordinates of the point that I click on.  I would appreciate any help in using the point probe in a 3d plot. Thanks.

Dear All,

I want to apply the ‘simplify’ command, in parallel, for the simplification of some parameters. Both Grid:-Map and Grid:-Run commands are tested. There is no error in both, whereas no simplification is implemented. It seems that the ‘simplify’ command correctly works on only ‘Master’ node, namely anywhere we are typing.

Can anyone help me to simplify in parallel. I examined two following codes.

1)

with (Grid);

for i from 1 to nops(dummy_UU1) do

freenode:=WaitForFirst():

Run(freenode,simplify,[dummy_UU1[i]],assignto='dummy_UU2'[i]):

end do:

Wait();

2)

dummy_UU2:=Map[tasksize=1](simplify,[seq(dummy_UU1[i],i=1..nops(dummy_UU1))]):

The following code is correctly executed and resulted in the simplification of dummy_UU1 components in serial.

for i from 1 to nops(dummy_UU1) do

dummy_UU2[i]:=simplify(dummy_UU1[i]):

end do:

Good day to all.

I have a data set consisting of 12 points in the x-y plane. These points form a periodic pattern and I was wondering if it is possible to obtain a curve that is a best-fit for these points. I have reason to expect that this pattern will repeat for successive points (i.e. points 13, 14, ..., 30).

Does anyone know of a way to obtain a function that can represent this behavior?

Thanks for reading!

MaplePrimes_Best_Fit.mw

Hi, I have this values I want to plot as three dimension how can I plot it?

ApproximateSol := proc (w, t) options operator, arrow; w^2+t+rtable(1 .. 1, 1 .. 1, {(1, 1) = (.2960214364*piecewise(0 <= w and w < 1, 1)+.1939557186*piecewise(0 <= w and w < 1, 4*w-2)+0.2635024425e-1*piecewise(0 <= w and w < 1, 16*w^2-16*w+3))*(0.7620592980e-10*piecewise(0 <= t and t < 1, 1)+0.1532687805e-9*piecewise(0 <= t and t < 1, 4*t-2)+0.8496500063e-10*piecewise(0 <= t and t < 1, 16*t^2-16*t+3))+(-.2380729574*piecewise(0 <= w and w < 1, 1)-0.9481780593e-1*piecewise(0 <= w and w < 1, 4*w-2)+0.442773709e-1*piecewise(0 <= w and w < 1, 16*w^2-16*w+3))*(-0.2362176714e-9*piecewise(0 <= t and t < 1, 1)+0.6793447600e-10*piecewise(0 <= t and t < 1, 4*t-2)+0.2039654777e-9*piecewise(0 <= t and t < 1, 16*t^2-16*t+3))+(0.7931761947e-1*piecewise(0 <= w and w < 1, 1)+0.967928372e-2*piecewise(0 <= w and w < 1, 4*w-2)-0.2747829289e-1*piecewise(0 <= w and w < 1, 16*w^2-16*w+3))*(-0.1118492678e-9*piecewise(0 <= t and t < 1, 1)-0.5202991920e-10*piecewise(0 <= t and t < 1, 4*t-2)+0.1128321001e-9*piecewise(0 <= t and t < 1, 16*t^2-16*t+3))}, datatype = anything, subtype = Matrix, storage = rectangular, order = Fortran_order) end proc

Could anyone help me out to convert the equation into differential transform method

Hello Everyone, can anyone explain how to import a mathematical equation from maple to word directly?

The strandbeest is a walking machine developed by Theo Jansen. Its cleverly designed legs consist of single-degree-of-freedom linkage mechanisms, actuated by the turning of a wind-powered crankshaft.

His working models are generally large - something of the order of the size of a bus. Look for videos on YouTube.  Commercially made small toy models are also available.  This one sells for under $10 and it's fun to assemble and works quite well. Beware that the kit consists of over 100 tiny pieces - so assembling it is not for the impatient type.

Here is a Maple worksheet that produces an animated strandbeest. Link lengths are taken from Theo Jansen's video (go to his site above and click on Explains) where he explains that he calculated the optimal link lengths by applying a genetic algorithm.

Here is a Maple animation of a single leg.  The yellow disk represents the crankshaft.

And here are two legs working in tandem:

Here is the complete beest, running on six legs. The crankshaft turns at a constant angular velocity.

The toy model noted above runs on twelve legs for greater stability.

Download the worksheet: strandbeest.mw

Write a program to display all different relations on a set with 4 elements.

Hello,

My question is quite simple yet maybe a bit hard since I understand that messing around with series can lead to dead ends.

Given a certain general term, for instance sum(x^n/n!,n=0..infinity): Can Maple recognize which function does it come from (in case such analytic function is known)? in the example I would expect it to return exp(x).

Thank you very much.

Hi,

I wonder if we can change the way Maple works so that all calculation can be done in degree instead of radian?

I know that we can *pi/180 to set it to degree but if the calculation lots of sin, cos, tan etc. it would be really hard.

Hope you can help me. Thanks for your participation and assistance.

Thank you.


Kind regards

Faiz Farhan

Dear people at Mapleprimes

My situation is the following: I have a number of bins (n bins), which all contain a specific number. I want to choose at random from these bins a number of times (N times), but in such a way that it is not equal likely that I choose from bin1, bin2 ...

Example: I have 5 bins: The 5 bins contains the numbers 50, 60, 70, 80, 90 respectively. The probabilities of choosing from these 5 bins should be 0.10, 0.30, 0.20, 0.25, 0.15 respectively. I make N = 100 selections. The output is expected to be a list with 100 numbers, for example: [ 50, 80, 80, 60, 60, 90, 50, ... , 70]. 

I could make it work myself by picking a random number from the uniform distribution from 0 to 1 and deciding if the a random number is between 0 and 0.10, between 0.10 and 0.40, between 0.40 and 0.60, etc. and then choosing the number in the corresponding bin ... I just wonder if Maple has an elegant way to to it? 

Regards,

Erik

Can anyone kindly tell me why isn't "evalm" working even with all the neccessary varaibles have corresponding values? 

Thank you!

Here is my code: