Hello, everybody!

If it is convenient for you, I wish you can help me review the following program. Thank you very much in advance. I want to obtain the coefficient values of c0, n, s0, ks, h1, h2, kp, A, B for the ODE system.

restart;
cdm_ode := diff(y1(t), t) = c0*(y6(t)*(1-y3(t))/(s0*(1-y4(t)*(1-y5(t)))))^n/(1-y2(t)), diff(y2(t), t) = ks*y2(t)^(1/3)*(1-y2(t)), diff(y3(t), t) = h1*(1-y3(t)/h2)*c0*(y6(t)*(1-y3(t))/(s0*(1-y4(t)*(1-y5(t)))))^n/(sigma*(1-y2(t))), diff(y4(t), t) = (1/3)*kp*(1-y4(t))^4, diff(y5(t), t) = A*B*y1(t)^(B-1)*c0*(y6(t)*(1-y3(t))/(s0*(1-y4(t)*(1-y5(t)))))^n/(1-y2(t)), diff(y6(t), t) = y6(t)*c0*(y6(t)*(1-y3(t))/(s0*(1-y4(t)*(1-y5(t)))))^n/(1-y2(t));

tol_t := 3600;


sol := dsolve([cdm_ode, y1(0) = 0, y2(0) = 0, y3(0) = 0, y4(0) = 0, y5(0) = 0, y6(0) = 175], numeric, range = 0 .. tol_t, output = listprocedure, parameters = [c0, n, sigma, s0, ks, h1, h2, kp, A, B]);

err := proc (c0, n, s0, ks, h1, h2, kp, A, B) local st1, st2, sv1, sv2, sv; sol(parameters = [c0, n, 175, s0, ks, h1, h2, kp, A, B]); st1 := subs(sol, y1(t)); sv1 := [st1(1), st1(100), st1(210), st1(2500), st1(2800), st1(3000)]; sol(parameters = [5.7/10^6, 10.186, 175, 200, 1/20000000, 10000, .269, 1.5/10^7, 1.5, 2]); st2 := subs(sol, y1(t)); sv2 := [st2(1), st2(100), st2(210), st2(2500), st2(2800), st2(3000)]; sv := add((sv1[i]-sv2[i])^2, i = 1 .. 6); sv end proc;

with(GlobalOptimization);
GlobalSolve(err, c0 = 0 .. 1, n = 1 .. 20, s0 = 150 .. 250, ks = 0 .. 1, h1 = 100 .. 15000, h2 = 0 .. .5, kp = 0 .. 1, A = .5 .. 2, B = 1 .. 5);

Error, (in GlobalOptimization:-GlobalSolve) `InertForms` does not evaluate to a module

Hello
Is there a Maple-function that returns a number of transpositions needed to transform a list into a list with some particular order? Actually, I need just a parity of a number of transpositions. All elements of a list are different.

For example, one needs 4 (even) transpositions to transform a list [w,x,y,z] into a list [y,x,z,w]:
[w,x,y,z]->[w,y,x,z]->[y,w,x,z]->[y,x,w,z]->[y,x,z,w]

Thank you

Please I need someone to help out with how to solve the below ODE numerically using finite difference method with the necessary maple code:

█( S〗_h〗^' (t)=Λ_h-αβ_m I_v S_h-μ_h S_h+πI_m,  

〖I_m〗^' (t)=αβ_m I_v S_h-(σ_m+π+μ_h ) I_m

〖 S〗_v〗^' (t)=Λ_v-αβ_v I_m S_v-μ_v S_v

〖I_v〗^' (t)=αβ_v I_m S_v-μ_v I_v )

The initial conditions can be assumed. Suppose i want to include controls, how do I solve the problem and equally plot the graph.

Thank you.

ADENIYI MICHAEL

http://i.imgur.com/JGObjn5.png

I tried with and without evalf. Do I need to import something? or something like with Linear Algebra? 

i am solving 3 ODE question with boundary condition. when i running the programm i got this error.. any one could help me please.. :)

Download tyera(a).mw

I'm using maple to write text to an external text file. My code is

f := x-> arcsin(x);

file := "C:\\example.txt":

fopen(file,WRITE,TEXT):

fprintf(file,"%a",f(1)):

fclose(file):

The problem is that the output in my file example.txt reads "1/2*Pi" and I'd like it to be "1/2*pi". In other words, is it possible to have maple scan my file and replace the occurances of "Pi" with "pi"?

Is there a way to do the following on Maple:

I want Maple to use Jacobi's method to give an approximation of the solution to the following linear system, with a tolerance of 10^(-2) and with a maximum iteration count of 300.

The linear system is

x_1-2x_3=0.2

-0.5x_1+x_2-0.25x_3=-1.425

x_1-0.5x_2+x_3=2

Thanks.

Hello,

I'd like to clean up my project a bit. In a chapter of a project I made lots of calculations and declared a many (30) variabeles (Table, Numeric, Formula, ..)

Is there a way to remove all variable's except specified one's? (If it is possible I don't want to use an external file to write it to and read it back after a restart)

Is there a way to do a "restart" and preserve only the one's (2) that I need for my next chapter?
Or if not, without a "restart" and remove all variables except specified one's?

Thanks for your help, 

What’s the simplest way to solve an algebraic equation in the complex domain?

For example,

I*(a+3*b)+2*b+5*a = 3+2*I

where a and b are real numbers.

One of my post graduate students chose the theme "Discrete Wavelet analysis of medical signals with Maple" for her thesis. I test, is it possible to support such reearch be Maplesoft &  what may be the form of such support, if it is possible?

• here is an exercise I got from a text book                                                                                                              calculate the first 10 terms of the following sequence :                                                                                              

                                                                                                                                                             u[n+1]=1/2(u[n]+2/u[n]) n>=0                                                                                                                          

• estimate the differences u[3]-sqrt(2) , u[4]-sqrt(2), u[5]-sqrt(2), and u[6]-sqrt(2) with a precision of 50 numbers                                    
• what can we conjecture about the sequence ?
• how to prove that conjecture with MAPLE ?

This is pretty similar to my last question. but I found this maple code on a website that is suppose to find a vertex coloring of a graph G. The output is is supposed to be a list for example like [3, table([y = 1, k = 2, c = 2, m = 3, h = 1, x = 1] where the first part (in this case 3) is the number of colors and 1,2,3 in the second part are the colors to which each vertex is assigned.  However, no matter what graph I run this on I get everything equal to 1. such as [1, table([y = 1, k = 1, c = 1, m = 1, h = 1, x = 1])]. Why is this happening?  

color:=proc(G)
  local i, j, C, U, V, total_used;
  V:=Vertices(G); total_used:=1;
  C[V[1]]:=1;

  for i from 2 to nops(V) do
    C[V[i]]:=0;
  end do;

  for i from 2 to nops(V) do
    U:={};
      for j from 1 to nops(neighbors(V[i], G)) do
      U:=U union C[neighbors(V[i], G)[j]];
       end do;
    j:=1;
    while member(j, U) do
      j:=j+1;
     end do;

    C[V[i]]:=j;
    if j>total_used then
      total_used:=j;
    end if;
   end do;
  [total_used, eval(C)];
end:

Maplesoft regularly hosts live webinars on a variety of topics. Below you will find details on upcoming webinars we think may be of interest to the MaplePrimes community.  For the complete list of upcoming webinars, visit our website.

Creating Questions in Maple T.A. – Part #1

This webinar will demonstrate how to create questions in Maple T.A., Maplesoft’s testing and assessment solution for any course involving mathematics. The presentation will begin with an overview of the basic types of questions available, and then delve into how to create various types of questions in Maple T.A. Incorporating algorithms and feedback directly into questions will also be touched on. Finally, the session will wrap up with an explanation and several examples of how to create better questions using the question designer.

This first webinar in a two part series will cover true/false, multiple choice, numeric, mathematical formula, fill in the blank, sketch, and FBD questions. A second webinar that demonstrates more advanced question types will follow.

To join us for the live presentation, please click here to register.

Clickable Calculus: Linear Algebra

In this webinar, Dr. Robert Lopez will apply the techniques of “Clickable Calculus” to standard calculations in Linear Algebra.

Clickable Calculus, the idea of powerful mathematics delivered using very visual, interactive point-and-click methods, offers educators a new generation of teaching and learning techniques. Clickable Calculus introduces a better way of engaging students so that they fully understand the materials they are being taught. It responds to the most common complaint of faculty who integrate software into the classroom – time is spent teaching the tool, not the concepts.

To join us for the live presentation, please click here to register.

Hi, I'm trying to write a maple procedure to differentiate a function from first principles and so far I have

First_Principle := proc (f); for f do A := simplify((f(x+h)-f(x))/h); Limit(A, h = 0) = limit(A, h = 0) end do end proc

and from there I have no idea where to go. Does anybody have any ideas? Thanks!

How to solve the inequality

with Maple?

My attempts were the following.

Warning, solutions may have been lost

Of course, this works

f(1);
,

but one wishes to describe the solutions in the dependence on the parameter a. Unfortunately, both

and

produce wrong outputs(An SCR has been submitted by me.).