Hi Maple People,

My question is, "How can I combine the two plots shown in the attachment into one plot?".

Download plot_real_example_5_Exact_Curve_Fit_questiion_for_MaplePrimes.mw

Regards

Matt

I have to use the optimization package. 

- The objective function is non linear,

- I have constrains and bounds,

- The constrains are not linear.

I have reading the help page on maplesoft.com

My question are:
Can you confirm me that the only algorithm I can use is : NLPSolve with method ''sqp''?


And if I would like to use the gradient method how can I do?

This is somehow an old problem which came back and I decided to post it. So, I have some code which runs in Grid framework locally. Each node saves data directly to hard disk and there is no need to return anything at the end to the node of ID 0. Nevertheless, I noticed that memory usage on one instance of the mserver is very huge.  Moreover, this instance is all the time in S state, namely sleeping. Below you can see dump from top. I deny this is caused by some particular procedures called in my code since in this case I should rather observe more uniform memory usage. I am not sure if for this moment I could share some code with you which demonstrate this behavior. I will try to write some toy example because my productive code cannot be posted here.

%MEM     TIME+ COMMAND

49.1 17:00.19 mserver
0.1 12:43.70 mserver
0.1 12:32.15 mserver
0.1 13:54.02 mserver
0.1 14:45.45 mserver
0.1 12:35.22 mserver
0.1 13:50.77 mserver
0.1 14:14.85 mserver
0.1 8:58.82 mserver
0.1 12:58.48 mserver
0.1 8:51.00 mserver
0.1 10:35.92 mserver
0.1 12:58.13 mserver
0.1 9:34.39 mserver
0.1 10:10.13 mserver
0.1 12:07.77 mserver
0.0 8:21.17 mserver
0.0 11:41.42 mserver
0.0 5:07.27 mserver
0.0 8:31.88 mserver
0.0 6:30.12 mserver

hi.please see attached file below and help me for gain real or complex answer 

with out show answer in root of manner

thanksroot_of....mw

What is the maximal independent set of monomial ideal$<c^4a^3b>$ in $K[a,b,c]$?

(Some) prime reciprocals have an interesting property. the repeating sequence has length p-1.

eg 7, has repeats after 6.

1/7=0.142857142857......

17 has repeats after 16

1/17=0.05882352941176470588235294117647059.........

of course some primes don''t have this property....

So what I need the experts here is for some code

myproc(17)=16, (and the sequence) 0588235294117647

my go:pinched from

http://199.71.183.11/questions/39621-Pattern-Matching-In-A-Sequence-Of-Digits

PriDigits := "" || (op(1, evalf(1/17, 50)));

reps := StringTools[Repeats](PriDigits);

lngth := seq(op(3, A), A in [reps]);

the leading 0 (which is part of the sequence)  is a problem.....

hi every one, i would like to know if it is possible to implement the following recursive sequence in Maple :

q(1)       = q(0)        +q_dot(0)
q_dot(1)  = q_dot(0)  +q_ddot(0)
q_ddot(1) = q_ddot(0)+q_dddot

q(2)       = q(1)        +q_dot(1)   = (q(0)+q_dot(0)) + (q_dot(0)+q_ddot(0)) = q(0)+2q_dot(0)+q_ddot(0)
q_dot(2)  = q_dot(1)  +q_ddot(1)
q_ddot(2) = q_ddot(1)+q_dddot

q(3)      = q(2)        +q_dot(2)=(q(0)+2q_dot(0)+q_ddot(0))+(q_dot(1)+q_ddot(1))= q(0)+3q_dot(0)+q_ddot(0)+q_dddot
q_dot(3) = q_dot(2)  +q_ddot(2)
q_ddot(3)= q_ddot(2)+q_dddot

I would like every q(n) to be expressed as following : q(n)=q(0)+n_1*q_dot(0)+n_2*q_ddot(0)+n_3*q_dddot.

By computing manually some sequences i am now sure that :
n_1=n
n_2=(n²-n)/2
n_3=?? (I would like to find this one)

The sequence can be written in a more general way as following :
q(n)        = q(n-1) + q_dot(n-1)
q_dot(n)   = q_dot(n-1) + q_ddot(n-1)
q_ddot(n) =q_ddot(n-1)+q_dddot

Can you guys please show me how this can be implementes in Maple ?

Thanks in advance

Hi,

say I have defined some (very simple, acting on a finite set M) functions f,g,h. I want to evaluate certain permutations, so I want to make a for loop that goes through possible combinations of functions in my array A=Array([f,g,h]). (In reality my array is a little larger.) No I don't understand how I can use the elements of this array as actual functions. Even if f is defined and I can evaluate, say, f(m), I cannot use A(1)(m) to evaluate m. The output is just "f(m)". How can I make maple recognize that we are having a function here?

Thanks it advance.

Hi,

I'm not sure that I mean datatable component corectly.

I also consider that I was done somthing wrong

Thank you for advanced for any help.

wzel

Download datatable_problem.mw

Is there a way in Maple to convert a list into a string of numbers?

So [1,2,3,4,5] -> 12345

I have tried Maple help, but there are too many convert commands to try them all.
And the ones I have tried didn't work.

Thanks.

Hello,

In the creation of a list, I would like to use the assume function twice.

Here it is a print screen of my issue.

The second part of the list is not taken into account.

Do you have ideas so that my list takes into account the second term ?

Thanks a lot for your feedback

Hello! Hope every is fine. I want to expand all expression of exp of the attached file like this

exp(c[1]*t+d[1]*n-d) = exp(c[1]*t+d[1]*n)*exp(-d)

waiting your kind response.

Help.mw

Mob #: 0086-13001903838

Hello! Hope everything fine with you. Please share the command to find the max and min values of the attached function, I had tried but I was only for one variable. I am waiting your quick response.

Examples.pdf

Mob #: 0086-13001903838

Hello,

I would like to solve this equation :

tan(gamma0(t)) = tan(gamma[1](t)-theta[1](t)-psi[1](t)

I would like to select the solution of arctan by assuming the domain of variation of some variables. In my case, if -Pi/2 < gamma[1](t) - theta[1](t) - psi[1](t) < Pi/2, the arctan gives only one solution.

Can you help me to solve this equation ? 

eq:=tan(gamma0(t)) = tan(gamma[1](t)-theta[1](t)-psi[1](t))
solve(eq,gamma0(t)) assuming -Pi/2 < gamma[1](t) - theta[1](t) - psi[1](t) < Pi/2

I guess that I don't use properly the "assume" function.

The result that I would like to obain is quiet simple :

gamma0(t)) = gamma[1](t)-theta[1](t)-psi[1](t)

Thanks a lot for your help