# Items tagged with homeworkhomework Tagged Items Feed

### how to witre package for quaternion polynomials ？...

March 11 2014
0 0

write a maple package for quaternion polynomials.it must include the following procedures:

1) for quaternion polynomials f, g:  find degree of f , compute f +g ,f-g, fg.

2)for matrices over quarternion polynomials A,B: compute A+B,A-B, AB.

hint using records to represent quaternions.

### Substrat using Maple ...

March 05 2014
0 4

Dear All;

Happy, to discuss with you these lines, and thank you to help me.

My goal is:

ode := D(y)(x) = f(x,y(x));

In this expression, is assumed to be a known function of the independant variable
x
and the function that we are trying to solve for
y(x)
.  The simplest numerical stencils to solve this equation will give us an approximation to
y
at some point
x = X + h
given some knowledge of
y
at
x = X
.  All of these stencils are based on the Taylor series approximation for
y(x)
x = X
to linear order:
eq1 := y(x) = series(y(x),x=X,3);

eq2 := h = x - X;
eq3 := subs(isolate(eq2,x),eq1);

Now, we can remove the first derivative of y

by making use of the differential equation:
eq4 := subs(x=X,ode);
eq5 := subs(eq4,eq3);

Now we must compute the same for y(x-h)  and then make.  How can I do this please

### explicit Runge-Kutta method with one-step...

March 04 2014
0 0

(a) Design your own 3-stage explicit Runge-Kutta method with one-step error O(h4).

(b) Test your method by solving y= −y. Confirm that the global error in your numerical solution

is O(h3).

### Numerical Method ...

March 04 2014
0 1

Write a Maple procedure that solves for y(1) in the initial value problem

y= f(y),     y(0) = 1,

using a numerical stencil based on the nth order Taylor series expansion of y. The procedure’s arguments should include an arbitrary function f, an integer n representing the accuracy of the Taylor series expansion, another integer N representing the number of steps between x = 0 and x = 1. Pick a test problem and compare your results with the output of dsolve/numeric.

### Midpoint method ...

March 03 2014
1 9

Question_.pdf

this question about midpoint method I need help with the part c

thanks

### Taylor series: plot and check...

February 28 2014
1 3

i wanted a taylor series  of the expression sin(xy) my code;

mtaylor(sin(x*y),[x=1,y=2],6); and it worked like a charm

sin(2)+2*cos(2)*(x-1)+cos(2)*(y-2)-2*sin(2)*(x-1)^2+(-2*sin(2)+cos(2))*(y-2)*(x-1)-(1/2)*sin(2)*(y-2)^2-(4/3)*cos(2)*(x-1)^3+(-2*sin(2)-2*cos(2))*(y-2)*(x-1)^2+(-sin(2)-cos(2))*(y-2)^2*(x-1)-(1/6)*cos(2)*(y-2)^3+(2/3)*sin(2)*(x-1)^4+(-2*cos(2)+(4/3)*sin(2))*(y-2)*(x-1)^3+(-2*cos(2)+(1/2)*sin(2))*(y-2)^2*(x-1)^2+(-(1/2)*cos(2)+(1/3)*sin(2))*(y-2)^3*(x-1)+(1/24)*sin(2)*(y-2)^4+(4/15)*cos(2)*(x-1)^5+((4/3)*sin(2)+(2/3)*cos(2))*(y-2)*(x-1)^4+(-(1/3)*cos(2)+2*sin(2))*(y-2)^2*(x-1)^3+(-(1/6)*cos(2)+sin(2))*(y-2)^3*(x-1)^2+((1/12)*cos(2)+(1/6)*sin(2))*(y-2)^4*(x-1)+(1/120)*cos(2)*(y-2)^5

now i need to plot the darn thing. so i tried to use tayplot function but i get nothing. is there a special package i need to use tayplot etc..?

February 27 2014
0 2

im trying to input a number between 0-100 and have the operation return the grade a,b,c,d,f. etc though long i though this might work.

local a,b,c,d,f;
a:=(100..89.5);
b:=(89.4..79.5);
c:=(79.4..69.5);
d:=(69.4..59.5);
f:=(59.4..0);
if x=(100..89.5) then
display(a);
else
if x=(89.4..79.5)then
display(b);
else
if x=(79.4..69.5) then
display(c);
else
if x=(69.4..59.5) then
display(d);
else
if x=(59.4..0) then
display(f)
end;
end;
end;
end;
end;
end;

### if then statement problem...

February 27 2014
0 2

count the number of primes less than using an if-then statement.  Implement your code where j goes from 2 to 15.

im at a loss i need a little nudge in the right direction.

### how to computer GSO in maple?...

February 25 2014
1 2

we use modern computer algebra books

i) computer the GSO of (22,11,5),(13,6,3),(-5,-2,-1) belong to R^3.

ii)trace algorithm 16.10 on computer a reduced basis of the lattice in Z^3 spanned by the vectors form(i).

trace also the values of the d_i and of D, and compare the number of exchange steps to the theoretical upper bound from section 16.3

### how to solve hensel lifting algorithm in maple?...

February 25 2014
0 0

we use Modern Computer Algebra

let f=x^15-1 belong to Z[x]. take a nontrivial factorization f≡gh mod 2 with g,h belong to Z[x] monic and of degree at least 2. computer g*,h* belong to Z[x] such that   f≡g*h* mod 16 ,deg g*=deg g, g*≡g mod 2.

show your  intermediate. can  you guess some factors of f in Z[x]?

### how to slove a factoring algorithm in maple?...

February 25 2014
0 0

we use Modern Computer Algebra book

trace algorithm 15.2 on factoring f=30x^5+39x^4+35x^3+25x^2+9x+2 belong to Z[x].choose the prime p=5003 in step.

### Taylor Expansion using Maple...

February 25 2014
0 7

Dear all;

Special thanks for all the member who help me in Maple.

My last question is:

Write a maple procedure that solves for y(1) in the initial value problem y'(x)=f(y), y(0)=1

using a Numerical stencil based on the n^{th] order taylor series expansion of y.

The procedure arguments include an arbitrary function f, an integrer n, representing the accuracy of the taylor series expansion, and N representing the number of steps between x=0 and x=1.

### Function that diagonalises a 2x2 complex matrix...

February 25 2014
0 1

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

### error between exact and approximation...

February 24 2014
0 6

Dear all,

I need to compute the error, How to define the error between the exact and approximation.

d
--- y(x) = -y(x)
dx
y(x) = exp(-x)

I have a problem in this code, my goal is to compute the error between the approximate solution obtained by RK3 and Exact  and E ( approximation by RK3).

How to definie the error and prouve that the error is O(h^4)  ( with one step) and the global error is O(h^3).

Thank you  for helping me.

### Solve by Newton Raphson Method...

February 24 2014
0 4

hi everybody

I want to solve this system of equations

t*((p-.764*z-2.194768)^2-1.170308549+.529948*(z-.382)^2)-(1-t)*p
t*((p+.382*z+.661624*y-1.907568)^2-1.018097144+.529984*(-.866*y-.5*z-.382)^2)+(1-t)*y
t*((p+.382*z-.661624*y-2.470348)^2-1.31636154+.529984*(.866*y-.5*z-.382)^2)+(1-t)*z

while t varies from 0 to 1 by 0.0001 interval. Using newton raphson method, the inital value for each step is the result of the previous step for y,z,p. the very initial values are y=1,z=1,p=1