Hi everyone,

In MapleSim, I know that after running a model simulation, one can save the data via 'export data in excel or csv' format...

But is it possible to automate this process via a script? For example, if I wanted to see what the model data looks like by varying one parametere between 10 to 50?

Example:

for i = 1:50

   variable_in_model = i;

   run MapleSim model;

   save MapleSim model data;

Hello, I've got a simple question in Maple7. I tried to fill the array "intXdA()" in the for-loop but I failed. How I have to declare it after "global" in the beginning? Is it possible to declare it after "n" is determined - so that it has n elements?

restart:
with(plots):


> flsp:= proc(f,ug,og) global i,n,intXdA()
   y:=unapply(f,x):
   if  ug<0 and og=0 then n:=1 end if:
   if ug<0 and og>0 then n:=2 end if:

Hi,

I would like to discribe the following function.

w(ξ,s):=N(s)*w(ξ)

N(s) and w(ξ) are both matrix. I have defined N(s) but will be searching for w(ξ) much later in the process. Why does it not allow me to define a partial derivative of w(ξ) now for future use? d/dξ(w(ξ)) is not allowed. it says that "Error, invalid input: w uses a 2nd argument, s, which is missing". But my w(ξ) only depends on the variable ξ.

2nd question, how do i tell maple that x...

Hello,

I am trying to run maple file for k=1, k=2 ....

My do-loop did not work. What I would like to do is to solve the ODE then have new inc and solve it again.

I should have U(405) then U(770) ....

> restart;

> with(DEtools); with(plots);

> lambda := 0.1; delta := .5;

tau := 40;

> for k to 3 do 365*k end do;

> ode := diff(U(t), t) = -lambda(t)*U(t)*U(t);

> inc1 := U(0) = 100;

Need to do in maple smth like that:

I am searching for an analytical solution, if one exists, of a first-order differential equation of the Chini type, which is a generalization of the Abel type. The equation I'm trying to solve is very closely related to one presented in Maple's help files and which does admit an integral representation, namely the equation reported by Kamke as number 152 (according to the reference given in Maple). The equation I'm grappling with is similar to Kamke152 but with the forcing...

Let A(2;-2;3), B(4;-5;6) and (M(1;2;3) be three points. Write the equation of the plane (P) passing through two points A and B 

Problem: Write the equation internal bisector and external bisector of a triangle ABC with A(1,2,-7), B(3,-1,-1), C(-5,14,-3). This is my code.

restart;
> with(LinearAlgebra):
> A:=: B:=: C:=: M:=:

>v:=1/Norm(A-B,2)*(A - B) + 1/Norm(A-C,2)*(A - C): M=A + v*t;

>u:= 1/Norm(A-B,2)*(A - B) - 1/Norm(A-C,2)*(A - C): M=A + u*t;

in the commands M = A + v*t and M = A + u*t, please comment for me. Thank you.

Hello everybody,

I represented a polynomial P type:
P := a + b*x + c*x^2-d*y + e*y^2 + f*x*y
(where a, b, c, d, e, d, are real)

using fucntion pointplot3D
G1 := plot3d(P, x = 0 .. 5, y = -0,5 .. 1);
display(G1);

I represented this polynomial which look like a paraboloid.

I'm just wondering if I can animate continuously...

Have s:={'a', 'b'};

a:=4;

naturally s[1] resolves to 4. Moreover, eval(s[1],1)=4, so s successfully should forget about a.

But...

a:='a'; and s[1] returms... again a.

So, why dereferencing of pointers  is not the same as 'eval 1-level' resolving?

How actually can i unassign 'a' having s only?

Or (not obviously, but same!) related question:

how to obtain s1:={'a', 'b'} having s={a,b} with nonresolvable a and b .i.e. eval(smth, -1)?

Is there any command in Maple 15 to linearize an PDE non-linear? Or or there is a package or help file to do so?

I'm handling with Non-linear PDEs in my work and I would like to solve them by these methods.

Thank You

Washington Inacio

It's possible to define a field in Maple 15 with 2 kinds of indices, say type spacetime μ,ν,ρ... and one of the type integer, i,j,k varying from 1 to n?

I would like to define a field like A_μⁱ where:

A_μ¹=A_μ

A_μ²=B_μ 

and so on.  

Thank you Washington Inacio

I expected

int(x^(-13/10), x):
eval(%,x=1000)-eval(%,x=1/1000);

but i get

int(x^(-13/10), x=1/1000..1000);

Write a procedure, primesum, whose input is a positive integer n and whose output is the sum of all primes p such that p is less than or equal to n. You may use th built-in procedure isprime.

Bonjour

Je n'arrive pas à faire fonctionner un montage simple.

J'ai un message d'erreur : (in dsolve/numeric/RunSimulation) unable to compile, please check your options by running with infolevel [ToExternal]:=1; simulation failed.

Que dois-je faire ?

Windows 7  64bits / Maple 61bits

Merci