I've been poking around with convolutions on Maple, and some weird behavior came up---if I let it compute the convolution of a piecewise function, then take the convolution of that, it comes out differently than if I enter a function from scratch as the middle step---file attached (PiecewiseProblem.mw).  I'm not really a Maple pro, so am I'm doing something crazy here?

Thanks!

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.

Maple crashed while saving and now there is nothing in my file. Lost a bunch of work, any way to fix it?

Thanks
EquationSheet357.mw

(x+y)(x²+y²⁾ = 5500

(x-y)(x²-y²⁾ = 352

how to transform

Matrix([[1,0,0],[1,0,0],[0,0,0]])

to

Matrix([[0,0,0],[0,0,1],[0,0,1]])

(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).

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.

restart:

Eq1:=S*diff(f(x,t),x,t)+diff(f(x,t),x)^2-f(x,t)*diff(f(x,t),x$2)=diff(f(x,t),x$3);

BCs := {D[1](f)(0,t)=cos(t), f(0,t)=0,D[1](f)(L,t)=0};

ICs := {f(x,0)=0};

S:=10:L:=5:
smod3:= pdsolve(Eq1,ICs union BCs,numeric,range=0..L);

smod3:-plot(t=0,  color=red):

it seems to me that the problem is due to the mixed bcs. Any way around?

Cheers!

1.which rules or theorems can guide to generate relations for words in group theory?

2.Is topological method such as complexes the direction to answer Question 1?

I am running a set of diffrential equation , but i receive below error

"Error, (in LL) cannot evaluate the solution past the initial point, problem may be complex, initially singular or improperly set up"

I can't understand the problem

I suppose you would have to programme this, because I couldn't find anything relating to vector spaces in my Maplesoft Linear Algebra tutor or package.

My question really is, you have a problem like, the set of all pairs of real numbers of the form (1,x) with the operations (1,y)+(1,y')=(1,y+y') and k(1,y)=(1,ky) 

( ^ taken straight out of my homework haha)

and you run through the 10 vecctor space axioms to determine whether it fails and it not a vector space, or it passes all and it is a vector space.

Is there a way to do this in Maplesoft?

which method i input a series of random number it output a periodic waveform

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