Hello dear all,

I use maple 16, x64. When I run this code:

Student[Calculus1][ApproximateInt](cos(y/(-1+y)), y = 0 .. 1, method = lower, iterations = 1)

it results in "0.0667344650", exactly equal with the result of executing

Student[Calculus1][ApproximateInt](cos(y/(-1+y)), y = 0 .. 1, method = lower, iterations = 10000000000)

Any idea?

Best regards

i understand quotient group is

G/(normal subgroup)

= G composite with inverse permutation group of normal subrgoup

is this understanding correct?

If do not have subgroup or normal subgroup, how to do quotient group?

if i shift second row many times in order to find Subgroup satisfy G*Subgroup = Subgroup*G

after find Subgroup then test

inverse(g)*Subgroup*g = Subgroup

how to test whether inverse(g)*Subgroup*g belong to Subgroup?

or just use equal in inverse(g)*Subgroup*g = Subgroup?

a*b - b*a    where a , b are permutation group

how to minus this?

if a + b , then how to plus permutation group

assume the word equation is

a_i *a_j - a_j *a_i = 0

how to find which permutation group is a_i and a_j

my understanding is to try all rotations

a book use underscript i and j

can i see them as upper script for i rotations which is shift i times to left for second row

and try all combination and composite them in two for loop? 

Given a 2x2 matrix I am struggling to write a function that would return a list (a,b, a1, a2) of 2 complex numbers followed by 2 vectors such that the set of the 2 vectors is a basis for CxC and also Ab1=ab1, Ab2=Bb2 if these exist

Any ideas would be greatly appreciated

Good afternoon sir.

I am working on problems related to functions which require dynamic geometry program or

the Geometers sketch pad. I request to you to kindly suggest me with regard to the above cited query.

With thanks & Regards

M.Anand

Assistant Professor in Mathematics

SR International Institute of Technology,

Hyderabad, Andhra Pradesh, INDIA.

Dear all;

Thanks ifor looking and help me in my work. Your remarks are welcome.Description:
 This routine uses the midpoint method to approximate the solution of
     the differential equation $y'=f(x,y)$ with the initial condition $y = y[0]$
     at $x = a$ and recursion starting value $y = y[1]$ at $x = a+h$.  The values
     are returned in $y[n]$, the value of $y$ evaluated at $x = a + nh$.       
                                                                          
Arguments:     
\begin{itemize}
\item  $f$  the integrand, a function of a two variables
                
                \item $y[]$ On input $y[0]$ is the initial value of $y$ at $x = a$, and $y[1]$
                is the value of $y$ at $x = a + h$,
                \item on output for $i \geqslant 2$
             $$ y[i] = y[i-2] + 2h f(x[i],y[i]); \quad \quad x[i] = a + i h.$$
             \end{itemize}

 
CODE USING MAPLE

 Midpoint-Method=proc(f,a,b, N)

h:=(b-a)/N;
x[0]:=a;
y[0]:=1:

 for n from 2 to N do
    x[n] := a+n*h;
    y[n+1] = y[n-1] +  2h f( x[n], y[n] );
od:
// Generate the sequence of approximations for the Improved Euler method
data_midpoint := [seq([x[n],y[n]],n=0..N)]:
//write the function;
F:=(t,y)-> value of function ;

//Generate plot which is not displayed but instead stored under the name out_fig for example
out_fig := plot(data_midpoint,style=point,color=blue)

Your remarks.

Thanks

Let a(1)=916 , a(2)=935 , a(3)=713  , a(4)=845  , a(5)=274  , a(6)=914 ,a(7)=255 . Find formula a(n)= ? ,n=1,2,3,....

I am a new user of Maple. Could anyone help me to know how to call a Maple function/procedure from a Matlab program with a simple example? And conversely, how to call a Matlab function from Maple.

Say we solve numerically and ODE using Maple. Say ode1:= { diff(Q(x),x)= Q(x)/3x , Q(1)=1 }

The solution is a procedure so now suppose we have another ODE where the solution appears.Say  ode2:= { diff(f(x),x)= Q(x)*x , f(1)=4}.

To extract the solution of the first ODE I set sol1:=dsolve(ode1,numeric) and Q:=proc(x) local s: return rhs(sol(x)[2]): end proc:

But now I got an error message when I trying sol2:=dsolve(ode2,numeric).

Is it possible to use a procedure in the definition of the ODE one wants to solve?

I am trying to create a procedure that can solve integrals using the Composite Simpson's 3/8 rule. However when I test my procedure against maple's ApproximateInt I am getting the wrong results.

Here is my attempt:

restart;

f:= x -> exp(x)*sin(4*x); # function I am using

simp := proc(a, b, n)
  local h, sum, i, single:
  h := (b-a)/n:
  sum := 0:
  single := (3*h/8) * (f(a) + f(b)): # this is the end points
    for i from a+h by h to b-h do
       sum := sum + (3*h/8) * (3*f(i)):
    end do:
print(evalf(sum + single));
end proc:

simp(0,1,12);
                                                                                0.6224486445
evalf(Student:-Calculus1:-ApproximateInt(f(x), 0..1, method = simpson[3/8], partition=12));

                                                                                0.5323516717

As you can see my answer is not very close to the answer given by Maple. I am not sure why my procedure simp is wrong.

If i use expression with function add() it runs normaly, but if I use expression with Threads:-Add (parallel implementation) it causes error "Error, continuation task already created for the current task" or "Kernel connection has been lost"

Expression:

Array(1 .. N,1 .. 1/2*N-NR-1,(i, m) -> evalf(Add(cosArr2[modp(k*i,N)]/kl[k],k = 1 .. NR+m-1)+Add(cosArr2[modp(k*i,N)]*alpha[k],k = NR+m .. 1/2*N)))

What am I doing wrong? Can I use two Add in one evalf?

How can I create a new object from a stanrd, defined in a given metric? For example I want to define an object by convolution of two indices of the Christoffel symbols? I cannot even to see components of such object.

Many thans for an explanation

Leonid

Composite1:=proc(g,f)
Flist := indets(f): Glist := indets(g): gof:=g:
Subslist1 := [seq( Flist[i]=q, i=1.. nops(Flist))]:
return subs(q=f,subs(Subslist1, gof)): # g(f)
end proc:
#F(g o f) = F(g) o F(f) = F o g o f = (F o g) o (F o f)
Functor := (1/2)*(-y*t2-x*t1-y*t3+sqrt(y^2*t2^2+2*y*t2*x*t1+2*y^2*t2*t3+x^2*t1^2+2*x*t1*y*t3+y^2*t3^2-4*x*t4*y*t9-4*x*t4*y*t8-4*x^2*t4*t7-4*y^2*t5*t9-4*y^2*t5*t8-4*y*t5*x*t7-4*y^2*t6*t9-4*y^2*t6*t8-4*y*t6*x*t7))/(x*t4+y*t5+y*t6);
F1:=x+2;
G1:=3*x+5;
gof:=subs(x=F1, G1);
osys := Composite1(gof, Functor) = Composite1(Composite1(G1, Functor),Composite1(F1, Functor));
sys1 := subs(x=3,subs(y=2, osys));sys2 := subs(x=5,subs(y=1, osys));
sys3 := subs(x=1,subs(y=5, osys));sys4 := subs(x=1,subs(y=2, osys));
sys5 := subs(x=2,subs(y=5, osys));sys6 := subs(x=5,subs(y=2, osys));
sys7 := subs(x=2,subs(y=1, osys));sys8 := subs(x=3,subs(y=5, osys));
sys9 := subs(x=5,subs(y=3, osys));
res:=solve([sys1, sys2, sys3, sys4, sys5, sys6, sys7, sys8, sys9], {t1,t2,t3,t4,t5,t6,t7,t8,t9});
simplify(%);
`~`[lhs](select(evalb, res));

alpha:= (1/2)*(-y*t2-x*t1-y*t3+sqrt(y^2*t2^2+2*y*t2*x*t1+2*y^2*t2*t3+x^2*t1^2+2*x*t1*y*t3+y^2*t3^2-4*x*t4*y*t9-4*x*t4*y*t8-4*x^2*t4*t7-4*y^2*t5*t9-4*y^2*t5*t8-4*y*t5*x*t7-4*y^2*t6*t9-4*y^2*t6*t8-4*y*t6*x*t7))/(x*t4+y*t5+y*t6);
g := -y/x;
f := (-x+sqrt(x^2-x*y-2*y^2))/(2*y+x);
subs(p=f,subs(q=f,subs(x=p,subs(y=q,g))));
g := (1/2)*(-x+sqrt(x^2-4*y*x-4*y^2))/(x+y);
f := x*y;
gof := subs(p=f,subs(q=f,subs(x=p,subs(y=q,g))));
lhsgofoalpha := subs(q= alpha,subs(p=alpha, subs(x=p,subs(y=q,gof))));
foalpha := subs(p= alpha,subs(q=alpha,subs(x=p,subs(y=q,f))));
rhsgofoalpha := subs(x= foalpha,subs(y= foalpha, g));
osys := lhsgofoalpha = rhsgofoalpha;
sys1 := subs(x=3,subs(y=2, osys));
sys2 := subs(x=5,subs(y=1, osys));
sys3 := subs(x=1,subs(y=5, osys));
sys4 := subs(x=1,subs(y=2, osys));
sys5 := subs(x=2,subs(y=5, osys));
sys6 := subs(x=5,subs(y=2, osys));
sys7 := subs(x=2,subs(y=1, osys));
sys8 := subs(x=3,subs(y=5, osys));
sys9 := subs(x=5,subs(y=3, osys));
res:=solve([Re(sys1)=0, Re(sys2) =0, Re(sys3) =0, Re(sys4) =0, Re(sys5) =0, Re(sys6) =0, Re(sys7) =0, Re(sys8) =0, Re(sys9) =0], {t1,t2,t3,t4,t5,t6,t7,t8,t9});