Dear Maple experts,

I'm trying to make use of Maple's external calling facility to speed up some bottlenecks in my calculations (and simply to learn how it works...).

As I frequently need complex numbers, Fortran looked like the more appropriate choice. This is mainly because Maple can help with generating small code snippets for complex-valued functions whereas the code generation for C/C++ requires more manual work...

Although my calculations are somehow complicated, I don't think that's normal so I finally stoped it.

What are possible solutions? or shall I give it more time?!

Let be q(x) some polynomial of degree = 2 in several, n variables x[i],
x to be thought as (row) vector

Can Maple provide the quadratic normalform for q (real resp. complex)?

By this it is meant that q ° f (x) equals one of

  Sum( c[i]*x[i], i=1..n)
  Sum( c[i]*x[i], i=1..n) + 1
  Sum( c[i]*x[i], i=1..n) + x[n+1]

where c[i] in K, K = Reals or Complex (should not matter so much, except
char(K), and square roots have to exist, so Rationals(squareRoots) is fine),
and f: K^n -> K^n is affine ( = bijective and linear + shift vector)?

<p>I have a 1-dimensional list in the form of  data := [1,2,3,4...]. There are 5000 elements in this list, and only about 2000 don't repeat anywhere else in the list, the other 3000 do. What I want to do, is plot the number of times a given element repeats vs what that element is. For example, if an element with the value 5 is repeated 12 times in the list, than I want 5 on the x-axis, and 12 on the y axis. </p>
<p>I am using Maple 11. Can anyone help?? Thanks!</p>

As the discussion in this thread  did not provide me a clear understanding of the implementation and intended usage of the property 'continuous' I have looked at this subject a bit further. And as it is an underdocumented subject, it seems fit to post here some issues that I have found.

Hi all,

I  have problem about translate from maple to C Language. I do project about cryptography, now I can write command in Maple. I don't know how to translate to C language

How should i do?

Anser me please.

Thank you so much.

Hi all,

How can i get a bifurcation diagram and also identify the types of bifurcation that occur for these equations: 1) fa(x) = a + ln(x) , x>0 2) fa(x) = a - ln(x) , x>0 3) fa(x) = a * ln(x) , x>0 4) fa(x) = a + x - exp(x) , x>0

How do I plot the output of the Maximize command?

For example, here's a function that determines the value of x in the range [0,3] at which a particular fuction is maximized:

with(Optimization);

f := (x,t) -> -x^2+3*t*x-1

fmax := t -> rhs(Maximize(f(x,t),x=0..3)[2][1]);

How do I switch the autosaving off?

Hello! I am trying to create a double exponential smoothing model by optimizing the parameters a and b. The model is quite big and Maples needs a very long computation time. Can anyone help me on this one? I'll attach my file: View 9101_double_exponential_smoothing.mw on MapleNet or Download 9101_double_exponential_smoothing.mw

Hi

I am seeking a generalized collect command in Maple to collect a expresion W

W:=mu[1]*mu[3]^3*sin(mu[1]*Pi)*cos(mu[2]*Pi)*sin(mu[3]*Pi)*cos(mu[4]*Pi)+mu[4]^3*mu[3]*cos(mu[1]*Pi)*cos(mu[2]*Pi)*sin(mu[3]*Pi)*sin(mu[4]*Pi)-mu[3]^3*mu[2]*cos(mu[1]*Pi)*sin(mu[2]*Pi)*sin(mu[3]*Pi)*cos(mu[4]*Pi)-mu[4]^3*mu[2]*cos(mu[1]*Pi)*sin(mu[2]*Pi)*cos(mu[3]*Pi)*sin(mu[4]*Pi);  

to two different expresions W1 and W2 as

W1:=mu[3]*cos(mu[2]*Pi)*sin(mu[3]*Pi)-cos(mu[3]*Pi)*sin(mu[2]*Pi)*mu[2];

Hi there,

I'm having a problem when attempting an implicitplot of an expression containing an integral.

Here is a minimal example of what I'm trying to do:

restart: with(plots): with(DEtools):
f:= t-> t^(-2);
F:= x-> Int(f(t), t=x..1);
G:= (x,y) -> evalf(F(x)-y): G(x,y);
implicitplot(G(x,y), x=0..1, y=0..1);
plots[implicitplot](G(x,y), x=0..1, y=0..1, grid=[100,100]);

The above results in the following error message:

Dear All, I'm trying to plot points generated by something called the logistic map by using the following code:

> L:=array(1..30,1..1);
   x:=0.3;
   for i from 1 to 30 do
   x:=4*x*(1-x);
   L[i,1]:=x
   od;
   print(L);
 

>Lpoints:=convert(L,listlist);
>plots[pointplot](Lpoints,symbol=point);

 

Hi.  I'm trying to compute a posterior distribution (Bayesian inference), which requires integration.  I have set up the integral and have attempted to solve it numerically using evalf(Int...) with Maple 12 Worksheet interface and the command-line version.  When executing with Maple 12, I eventually (hours later) get a error - "connection to kernel lost".  When executing with the command-line, eventually the process seems to terminate.  The information about memory used stops updating and nothing happens.  Here is my code: