Hi!

I'm studying submanifolds of (semi)-riemannian and trying to look at some examples with Maple using it's great DifferentialGeometry package. But there's one thing I can't figure out. How can I define a pullbacked tangentbundle along the embedding map? Let me be more specific:

I have a manifold S, a manifold M and a map i: S -> M.

I realize this in Maple with: DGsetup( [...], M ); DGsetup( [...], S); i:=Transformation(S,M,[...]);

There...

Hi there,

I have a de that I have gotten maple to solve using dsolve (y'''+2y''-11y'-12y)=48-28exp(3t). When the solution comes up however, the particular solution is in an odd form: 

(-4*exp(3*t)+(11/28)*exp(6*t)-t*exp(6*t))*exp(-3*t)

+_C1*exp(-4*t)+_C2*exp(-t)+_C3*exp(3*t)

However, the particular solution here contains part of the homogeneous solution inside of it: namely the 11/28exp(3t) term. Is there any way to run a function on my solution...

Is there anyway to get Maple to solve for a limit of integration.  every time I try Maple gives me an error.

Sorry that this may not belong here but I thought I would ask, it is interesting. 

Now I'm not asking for the winning numbers list but rather the numbers chosen by people (the thousands of non winning ticket numbers per game)  Is there a database somewhere we can access that stores the list of picked numbers?  It would be interesting to find out how randomly people pick numbers, do people flock to certain numbers more often than others?

I...

Hi,

I have the following ODE:

dx/dtau=s-rx+x^2/(1+x^2)

Where r,s,x vary over an interval. 0<r<0.5 ; s and x any real value (positive). Our instructor wants us to numerically integrate this. He has a program available on his website but I would like to know how to do this in maple. I have the answers to the question already but I would like to use maple to find the answers. This is for a course in Nonlinear Dynamics and Chaos. I am not very proficient...

I am dissapointed. I recently upgraded to Maple 15 and I bought a license for the NAG libraries thinking that I could use NAG mark 8 chapter F12 to solve my Eigenvalue problem with large sparse matrix, in reality, there seems to be no implementation of these NAG routines in Maple. is there a way to get around this problem? I know I can also connect to MATLAB to take advantage of the integrated sparse handling but I want to avoid buying another piece of software(you know we scientist aren't millionaries).

I need a power regression function and I need it to be accurate, look what happens

> X := Vector([1, 2, 3, 4, 5, 6], datatype = float);

> Y := Vector([1, 4, 9, 16, 25, 36], datatype = float);
> PowerFit(X, Y, x);

                                            (1.9999999999999998)
      (1.0000000000000004) x                          
> f(x):=1.*x^2.;( using CTRL+L to get the result)

                                         1.9999999999999998

Is there a way to convert maple codes into Singular codes?

If not, Are there any Singular expert here?

Could someone please give me a screen shot and/or a copy-and-paste of the Singular codes that would do the following simple task done in maple:

Let me explain a bit:

The input is F, which is a set of 2 polynomials.

Hello,

I'm trying to increase the number of parameters in the maplesim optimization template (nowadays we have six parameters)

I have a problem where I need to tune a model and I have more parameters -

How can I increase the number above six?

restart;

P := proc (x, lambda) options operator, arrow; piecewise(x < 0, 0, lambda^x*exp(-lambda)/factorial(x)) end proc;

The upper confidence limit. When the confidence limit is 95%, e is 0.05

Lu := proc (a) options operator, arrow; sum(P(x, lambda), x = 0 .. a) = 0.5e-1 end proc

Lu(10)

exp(-lambda)+lambda*exp(-lambda)+(1/2)*lambda^2*exp(-lambda)+(1/6)*lambda^3*exp(-lambda)+(1/24)*lambda^4*exp(-lambda)+(1/120)*lambda^5*exp(-lambda)+(1/720...

This is the frame of the bike rear suspension i'm trying to calculate. Here is my maple sheet.

Download Maple-start.mw Maple-start.mw 

What i'm trying to achieve is a plot that would look a little like this:

hey,

i have a problem to get to the orthogonal point, but still there is a intersection and so should be as well a orthogonal point....

> S1 := proc (t) options operator, arrow; F[1](t)*m[1]*(1-F[2](t)) end proc;
> S2 := proc (t) options operator, arrow; F[2](t)*(m[2]+F[1](t)*m[1]) end proc;
> F[1] := proc (t) options operator, arrow; (1-exp(-(p[1]+q[1])*t))/(1+q[1]*exp(-(p[1]+q[1])*t)/p[1]) end proc;
> F[2] := proc (t) options operator, arrow; piecewise...

Hey everybody,

for some reason I dont get for the following problem any answer, with other data it worked, but not whit this!? and i know that there is a intersection point!!

> S1 := proc (t) options operator, arrow; F[1](t)*m[1]*(1-F[2](t)) end proc;
> S2 := proc (t) options operator, arrow; F[2](t)*(m[2]+F[1](t)*m[1]) end proc;
> F[1] := proc (t) options operator, arrow; (1-exp(-(p[1]+q[1])*t))/(1+q[1]*exp(-(p[1]+q[1])*t)/p[1]) end proc;

> m1 := 1000;
                              1000
> m2 := 250;
                              250
> m1A := .2;
          ...

In my class we need to know how we can double underline our answers and how we can use the ⇕ (DoubleUpDownArrow) in equations

We would be happy if you have the answers we are searching

Regards Henrk Sigsgaard