UncertaityofCalibrat.mw

within the attached document, is the idea that I would like to develop with the optimization package.

I want to calculate iterates for the Logistic map using the maple's symbolic computation. e.g., 

x1=a*x*(1-x):

a1=a+w:

x=x1:

a=a1:

In order to keep track of the error that builds up in each step.  But the main trouble is that it takes very long time to calculate the same even for 100 iterates. What could be the possible method to make my program efficient ? 

Please do not answer in terms of using high precision technique as I am more interested in doing it symbolically.

I have the following list, vector or set, I put it in a matrix

Hello,

Does any body know why the following code

A:=Matrix(3, 3, [[-1/23*(14+21*62^(1/2))^(1/3)-31/29/(14+21*62^(1/2))^(1/3)-13/107,0,0],[0,1/22*(14+21*62^(1/2))^(1/3)+15/29/(14+21*62^(1/2))^(1/3)-13/10-1/2*I*3^(1/2)*(-1/11*(14+21*62^(1/2))^(1/3)+31/29/(14+21*62^(1/2))^(1/3)),0],[0,0,1/22*(14+21*62^(1/2))^(1/3)+15/29/(14+21*62^(1/2))^(1/3)-13/10+1/2*I*3^(1/2)*(-1/11*(14+21*62^(1/2))^(1/3)+31/29/(14+21*62^(1/2))^(1/3))]]) ;

with(LinearAlgebra):
IsSimilar(AA,AA);

Hi,

I'm trying to use a simple DLL in maple, which I create based on Maple external linking examples..

int __stdcall mult( int a, int b )
    {
         return a * b;
    }

and I compiled it with Visual Studio 2010 compiler, but when I use it in Maple I recieve the error

"Error, external linking: error loading external library"

thanks

Hi.  I am supposed to sketch the set of points in the complex plane defined by

|z+2|<=|z-I|

where <= is less than or equal to and I is the complex number.

By hand, we simply substitute z=x+I*y into the above inequality, expand and simplify to get

y<=-2x-1.5

From here onwards, we sketch the straight line and shade the bottom region of the line.

In more challenging cases rather than getting a straight line, one...

r(t):= <t | t^(2) | (t^(2) )/(2) >

simplify(,symbolic)

diff(r(t),t)

The three lines above are part of a worksheet that computes unit tangent vector, unit normal vector and components of acceleration for a parametric curve r(t) ,  a standard Calc 3 lesson.

I am...

Hello,

I have one calculation and the result is "Length of output exceeds limit of 1000000"... What can I do with this error?

Thanks a lot.

Is it possible to specify tolerances such as +10,-5 instead of just +-10?  In other words, can the high and low limits be different?  Thanks, Ratch

As sometimes the question comes up "how to have a pdf documents for this?" here is a free way to such on Windows:

PDFCreator

Essentially by that you install a printer, which just does it. And as such allows to print threads here from the board, or Maple sheets or simply from any application.

After some configuration hanky-panky it is easy to use.

Let's compare the performance of two methods of computing the inverse of a large datatype=float[8] Matrix.

The two methods are that of calling `MatrixInverse`,...

I want to fill a matrix m by m with elements

1) the elements under the diagonal comes from the expression

Gama:=(i, k)→evalf(((x[k]-x[i])*xdot[k]-(y[k]-y[i])*ydot[k])*dtheta[i]/((x[k]-x[i])+(y[k]-y[i])^2))

2) the elements in the diagonal comes from Lambada:=(i)→-sum(Gama, k=1..M), where i<>k

I've tried to install maple 10 in windows vista but it seems imposible the setup keeps saying this.."please wait, maple 10 is being configured for your system, this make take a moment..." i've left my computer on all night but the installation doesn't end...any ideas on how to solve this problem? thank you.

My question is similar to the one referenced, but a bit more complicated.

Considering a PDE of order n, I would like it to be collected by the order of differentiation.

A simple example:

simplify(( (3+4*x)*diff(f(x), `$`(x, 2)))+(5+4*y+z)*(diff(f(x), x))+(1+r+y)*f(x))

where the idea is to return to the form prior to simplification, including the sort by differentiation order.

After it is simplified, I can get the coeff of only the highest order derivative, as

If you want better performance then don't use 2D Math mode to enter procedures which call  `.` (dot).

The following timings are not the result of the order in which the cases are performed. The timings stay roughly the same if the blocks delimited by restarts are executed out of order.