hi, is there a way to change color of the page in Maple 18? in fact I am preparing my lectures using slideshow option and want to change the color instead of the default white.

Hi guys,

       I have the following Lagrange function. 

       (Note :w is the generalized co-cordinate.) 

       L := (diff(w(r, t), t, r))*v(r, t)

       ( I know

        If L =diff(w(t),t)*v(t)..... I can write EulerLagrange(L,t,w(t) but I dont know how to handle above function)

        Thanks in advance!!!

I am having issues opening my final year project, it was working an hour ago and now it will not open. When I try to open the file it brings up a box title TEXT FORMAT CHOICE with the options: MAPLE TEXT, PLAIN TEXT, MAPLE INPUT and CANCEL.

This is all my work and I need it to complete my year.

Any help with how I can rectify this would be extremely helpful.

Many thanks

Hi

I am trying to optimize a 39, 1 MATLAB matrix, but cannot seem to get a result beyond a 6, 1 matrix. I am getting "Warning, cannot resolve types, reassigning t##'s type" where t## varies from each time I run it, and can show multiple of these warnings. It also says "Warning, cannot translate list".

I found a pretty similar problem posted here earlier, where the user "Carl Love" suggested to replace a command from the original code with

Matlab(
     subsop([-1,1]= J, eval([codegen:-optimize](tmp, tryhard), pow= `^`)),
     output = string, defaulttype = numeric
);

I was wondering what exactly this command does? Can I apply it to my code to solve my problem? It yielded a result that looks (on the surface) as an optimized code, but I don't feel completely comfortable using it without being certain.

What I have done is simply to replace Matlab(tmp, optimize) with the suggested code above. My code is attached. Thanks in advance for any help.

OptiMatrix.mw

Hi,

I'm, trying to write a nested loop in maple, but I keep getting the Unterminated Loop error. I'm sure the solution is quite simple, but I haven't been able to find it. Any suggestions would be much appreciated. The loop looks like this:

i:=0:
di:=25:
n:=1:  

while (n<=nLimit) do
sol1:=fsolve(eq1, y=i..i+di)
     if type(sol1, numeric) = true then
     lambda(n) :=sol1
     i:=i+di
     n:=n+1
     else  i:=i+di
     end if:
end do:

The physics package is pretty awesome, but one thing that would be a big help is some functionality for entering and resolving vectors in angle/magnitude format (50 angle 45 degrees, or what have you.) Is there a way to do this?

Thanks

Joe

Hi,

     I want to know what K1 and K2 means in the answer after using Euler Lagrange command.

     Thanks in advance.

Hej hej,

is there a way to obtain confidence intervals for the parameters in a NonlinearFit? To give you an impression of the problem which I was working on, I created a minimial working example (not sure wheather that actually helps). In this particular case, I have two parameters to fit the coefficients of a binomial series to some data I obtained. Beyond the values of the parameters (in a least square fit), I'm also interested in some kind of confidence interval, to get a feeling about how realiable my values are. Is there a direct (or even indirect) way to obtain such a thing. Either directly as a Maple function (confidenceintervals is not supported for NonlinearFit, if I'm not mistaken) or as something I can implement myself (within a reasonable time frame, as in hours rather than days).
Thanks in advance!

Cheer,

Sören

Download nonlinearfit-problem.mw

Dear Community Members,

We have problem with calculation in Maple v11 and v18. when we make a calculation by using maple v11 and v18, we was not able to get the solution as you see enclosed. when we clicked to "enter + ; ", programme does not run.

Dear all

I want to know, how one can install third party package into Maple13, the package is "wkptest" i downloaded it from link http://cpc.cs.qub.ac.uk/summaries/ADTY. If anyone knows how to do this please help.

When I create a component, here a label component, and set a name property and then click OK, that name seems to go into some list never to be erased. If I then delete the first name and put in a new name and click OK. thus saving it, and the then try to use that name again on a different component, I am told that the name is already in use. Well, no existing component has the name, but it is still in Maple's list of components. If I go to edit an action for any component and input %+command completion, I get a list of components which includes the deleted name which does not belong to any existing component. Since the name is on this list, I cannot reuse the component name.

How do I clean up this erroneous list of component names, so that a mistake in naming one component doesn't forever prevent me from using it on the component for which it was intended?

Hello every one,

I am trying to solve a backward induction problem (game theoretic problem) in maple. Lets say we have S rounds. I start from bottom (S-th round) and solve a parametric equation. Then I put the solution in the upper level (S-1). Then, update the functions at level and solve the equation pertatining to this level (S-1). Again, I put the solution ofround S-1 into the equations of S-2 and update the equations and parametrically solve the equation belonging to level S-2 . This process repeats till the first level.

The issue is that the solution gradually becomes larger and larger. I guess that's why Maple is not able to solve it. 

Have any of you guys faced to a similar problem. Any suggestion?

I was thinking of asking maple to reduce its precision in computations. I mean there may not be necessary to store a number with 100 digits precision! However, I don't know how to do that (I don't know the command). Any suggestion?

Thank you in advance.

Ahmadreza

Using Maple 18, I solved for minimum and maximum price. Instead of using fsolve I wanna use procedure programming structure in order to get the same results. How can I do it?

min_sol := fsolve([bc_cond, slope_cond, x[G, 1] = w[aggr, 1]], {p = 0 .. 1, x[G, 1] = 0 .. w[aggr, 1], x[G, 2] = 0 .. w[aggr, 2]}); p_min := subs(min_sol, p); max_sol := fsolve([bc_cond, slope_cond, x[G, 2] = w[aggr, 2]], {p = 0 .. 1, x[G, 1] = 0 .. w[aggr, 1], x[G, 2] = 0 .. w[aggr, 2]}); p_max := subs(max_sol, p);
{p = 0.3857139820, x[G, 1] = 127.8000000, x[G, 2] = 38.99045418}
0.3857139820
{p = 0.8841007104, x[G, 1] = 44.30160890, x[G, 2] = 164.2000000}
0.8841007104

Hello,

please explain how to write a code to calculate and output the actual area using integration for y=X^3 over range (0,2) using left-hand rule and 200 subdivisions?

Thank you 

I currently have a function quadsum(n) that determines the [x,y] solutions of the above equation for an integer n. :

quadsum:= proc(n::nonnegint)
local
k:= 0, mylist:= table(),
x:= isqrt(iquo(n,2)), y:= x, x2:= x^2, y2:= y^2;
if 2*x2 <> n then x:= x+1; x2:= x2+2*x-1; y:= x; y2:= x2; end if;
while x2 <= n do
y:= isqrt(n-x2); y2:= y^2;
if x2+y2 = n then k:= k+1; mylist[k]:= [x,y] end if;
x:= x+1; x2:= x2+2*x-1;
end do;
convert(mylist, list)
end proc:

How would I alter this so that I get [x,y] for n= (5^a).(13^b).(17^c)(29^d) for non-negative integers a,b,c,d?