This is my code for the Extended Euclidean Algorthim which should return integer l, polynomials pi,ri,si,ti for 0<=i<=l+1. And polynomial qi for 1<=i<=l such that si(f)+ti(g) = ri and sl(f)+tl(g)=rl=GCD(f,g).
The problem is, I keep getting division by zero. Also it evaluates pi = lcoeff(ri-1 - qiri) to be zero, everytime. Even when I remove this it still says there is a division of zero, which must be coming from qi:=quo(ri-1,ri, x); however I do not know why considering the requirements for the loop are that r[i] not equal zero. I really could use a fresh pair of eyes to see what I've done wrong. Any help would be greatly appreciated!!

Hi there,

Is there a way in which i can solve the following optimal control problem numerically with Maple?

 dH/dt=λ-µ H-(1-u1)β H V+δ I,

dI/dt=(1-u1)β H V-σ I,

‎dV/dt=(1-u2)k I-γ‎V,

dλ1/dt=-1+λ1µ+β‎‎V(1-u1)(λ1-λ2),‎

dλ2/dt=λ1δ+λ2σ-λ3(1-u2)k‎,‎

‎dλ3/dt=β H(λ1-λ2)(1-u1)‎‎+λ3γ.

where

u1=βHV(λ1-λ2)/A1,

u2=-λ3kI/A2,

σ = α + δ,

and

H(0)=1.7*10^8,    I(0)=0,    V(0)=400.

λ=5*10^5,    µ=0.003,     β=4*10^(-10),    α=0.043,    δ= 0.2                  k=6.24,       γ‎=0.65.

A1=900, A2=1000.

Answers and advice are very appreciated. 

Thank you all for reading.

Aylin

Hello, I'd like to use Maple to use Newton's Method in an interval to find multiple roots of 4xcos(3x)+(x-2)^2-2=0. What I have so far is:

with(Student[NumericalAnalysis]):
f := 4*x*cos(3*x)+(x-2)^2-2:
Newton(f,x=2,tolerance=10^(-4));

Other than trying out different initial guesses is there a way to do this?

Hi everyone!

I wrote simple program which fits experimental result. I know that experimental points should be fitted with this function — Te=exp(a*X+b), where "a" and "b" are parameters. "X" — vector of independent variable, "Te" — vector of dependent variable.

My question is: can maple estimate error of my fitting? I want to obtain "a±Δa" and "b±Δb".

My program: Profile.mw

P.S. Excuse me, for my english. It isn't my native language.

I got a problem with a difficult ode,the commands are below.

restart;
sys := 1.*(diff(x(t), t, t)) = piecewise(b(t) = 1, 0, 1003.0-1000.*x(t)-30.*(diff(x(t), t))-25.*signum(diff(x(t), t)-.1)-.3*signum(diff(x(t), t))*exp(-2*abs(diff(x(t), t)))), x(0) = 1, (D(x))(0) = 0;
mu := 100;
stick := [diff(x(t), t) = .1, b(t) = piecewise((1000.-1000.*x(t))^2 < 10000, 1, 0)];
slip := [[0, 10000 < (1000.-1000.*x(t))^2], b(t) = 0];
sol:=dsolve({sys,b(0)=0},numeric,discrete_variables=[b(t)::float],events=[stick,slip],event_maxiter=1000000,output=listprocedure,maxfun=0,range=0..8);

any advice is appreciated.

In Maple 16  (obviously, the result must be positive):

VectorCalculus:-int(x+y, [x, y] = Sector(Ellipse((1/4)*x^2+(1/9)*y^2-1), 0, (1/2)*Pi));

                                                                        -2

Probably, this error occurs only in the latest versions, as in Maple 12 the output is correct. It would be interesting to know the reason for this behavior.

I have to calculate the data in JSON format and export the result back to JSON.

It would be greate if there is any JSON package for Maple.
---

Also, I use`ExportMatrix` to export the result to CSV format.

But there are some comma (`,`) in the result content and `ExportMatrix` does not handle it well.
Is there any solution for export data to CSV file in my situation?

Thanks.

Hi,

i need to remove all the elements from a matrix that are almost zero, for example, from this matrix:

i need to remove the smallest element, so the final matrix will be like:

Is there a simple way to do that? Maybe forcing Maple to use number above a threshold?

Thanks

the following program dont work

a := 1;
b := 2;
c := 3;
d := 4;
eq1 := a*x[1]-b*x[2] = 0;
eq2 := c*x[2]-d*x[1] = 3;
dd := fsolve({eq1, eq2}, {x[1], x[2]});
evalf(sin(dd[1]));

wouldyo please help me?

Hi,

This may be just my lack of maple syntax, however I cannot seem to find a way to add upper indicies in tensors (without first converting them to some other object, array, matrix etc)

In the physics package an example is just the metric tensor. 

I am trying to do something like this:

with(Physics);

add(g_[~mu,2], mu=1..2) 

Is there an easy way of summing upper indicies? Obviously lower indicies work, because the add/sum command recognizes the variable to iterate. 

Thanks in advance,

Age

 1) find  the direction in which f(x,y) increases most rapidly at the point P(1,2), and find the maximum rate of increase
of f at P.

Interpret 1) using the graph of f.

Let f(x,y) = 2+x^2 +1/4*(y^2)

Having solution of an inequations system, is there a way/function/algorithm to find a particular numeric solution (as simplex[minimize] can do) ?

ex:

Q := {1 < x - y, x + y < 1};

R := solve(Q);

      { x < 1 - y, y < 0, y + 1 < x }

manually it's easy to find some numeric solutions:

      y = -1, x = 1
      y = -2, x = 0

but I need an automatic way.

Thank you for your help
s.py

This Maple 13 so maybe things have been fixed. Here are four points whose convex hull consists of three points. Sometimes the result comes out correct, more often it does not. With numbers this small it shouldn't be an issue of roundoff. But changing digits changes the result!

Hi all

kx,ky is the wavenumber, how can I get the 4 cases of piecewise function according to kx=0,kx≠0 and ky=0,ky≠0. Thanks

J := `assuming`([4*(int(int(JJ*exp(-I*(kx*x+ky*y))*sin(2*l*pi*x/a)*sin(2*k*pi*y/b), x = 0 .. a, AllSolutions), y = 0 .. b, AllSolutions))/(a*b)], [k::posint, l::posint, a > 0, b > 0, JJ > 0])

Let a planar polygon P without selfintersections be given through the plottools:-polygon command.
How to find its triangulation as a set of triangles (The indication of common sides is desired too.) in an optimal way with Maple? This is used in the finite element method.