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?

please is there any one can help me to find a solution of a sytem of 3 non linear equations each with 3 variable and with more than 30 unknown coefficients

this is the system

solve({EEE_x(x, y, z) = 0, EEE_y(x, y, z) = 0, EEE_z(x, y, z) = 0}, {x, y, z})

where x,y,r are the unknowns

and the three equations are simply the partial derivative with respect to x,y and z repectively

EEE_x(x,y,z):=(&DifferentialD;)/(&DifferentialD; x) EE(x,y,z)

EEE_y(x,y,z):=(&DifferentialD;)/(&DifferentialD; y) EE(x,y,z)

EEE_z(x,y,z):=(&DifferentialD;)/(&DifferentialD;z)EE(x,y,z)

the main equation is EE where (it has 3 variables and more than 30 qunknowns coefficients

(x, y, z) ->

1
----------------------------------------------------------------
2
/ 2 2 2\
hh \ii + jj x + ll z + mm y + 100. y + nn y z + oo x + pp z /

/ 2 2 2 2 3 2
\p z y + q z y + l z x + g z x + o z y + n z x + m y x

2 2 2 3 2 2 2
+ j y x + k y x + i z y + d z y + f z x + h z y

2 2 4 3 2 3
+ e y x + u z y x + v z y x + a + b x + c x + r x + s z

2 2 4 3 4 \
+ t z + bb z + cc y + dd y + ee y + ff y + gg z + aa x/

1.  a procedure quadsumstats whose input is an integer n. This procedure should return a list of length 

n whose kth  entry is the number of solutions to
x^2 + y^2 = k 
for
1 <= k and k <= n

I am sort of confused as to how to construct that list of length n and how to obtain integer solutions to the equation in maple.

2.

a procedure firstCount(k) that finds the first integer
n
with
k
representations as
"x^2+y^2= n." What does it mean for an integer to have k representations?

This is a question I have also submitted to the technical support, I am worried that it is a bit too technical for them, however:)

I am debugging a C program which links against the OpenMaple API library (under Linux and with Maple 17 and 18). I am using valgrind memcheck, because I am experiencing strange behavior which could be due to writes beyond allocated blocks of memory.  

The first thing which jumps to my eye, are many errors of the types

Use of uninitialised value of size (4/8/16)

Invalid read of size (4/8/16)

Conditional jump or move depends on uninitialised value(s) 

The same errors are also printed when I use the examples that ship with Maple. For instance, I compile "simple.c" with

gcc  -Wl,--no-as-needed -lmaple -lmaplec -lrt -L /usr/lib -L $MAPLEDIR/bin.X86_64_LINUX -I $MAPLEDIR/extern/include -o simple simple.c

and run valgrind as

valgrind --tool=memcheck --error-limit=no --log-file=memcheck.log ./simple

memcheck.txt 

Some, but not all, of the errors occur in __intel_sse2_strcpy or __intel_sse2_strlen. Furthermore, according to valgrind there are definite memory leaks. which appear in the library. 

Practically this makes it hard for me to identify my potential own errors. I am a bit surprised to see so many warnings because I tend to fix my own programs until memcheck does not print these anymore (before I give it away at least). The question is: Can I consider these errors as safe to ignore? How would I distinguish real errors which may appear in my application?

If I have the following system of first order diff eq's:

x'(t)=2x(t)+3y(t)

y(t)=-3x(t)-2y(t)

then can I consider the coefficient matrix A=<<2,-3>,<3,-2>> and compute the eigenvalues of A and infer as follows:

if the eigenvalues are of the same sign- eq point is a node

if they are of opposite signs- eq point is a saddle

if they are pure imaginary- eq point is a center

if they are complex conjugates- eq. point is a spiral

I've been given these conditions but my text says for a linear system of the form x'=Ax, the eigenvalues of A can be used to identify the nature of the eq. point. I am confused as to whether this applies to the given system as well; I have obtained 5 different trajectories and drawn the phase diagram for the system