Items tagged with function function Tagged Items Feed

Hello everybody, i need to graphic a couple of functions just like this one:

i have been watching this: VISUALIZATION --> Animation 2

i've tried with (plots) (plottools) animate, etc. but i can't figure out how to do it. 

It would be very helpful if someone explain me how to do this.

Thank you all!

Hello guys,


I think that the title explains the question very well. Is there any function in MAPLE that allows me to generate N random numbers considering a mean value, standard deviation and a percentile?


Thank you,


in my work i must use some parts of this piecewise function.

But i don't know how can i call the part that i will use.

How can i do that ?

Thanks for help



I have a code compute some function : 

         alpha1:(n, m,1) -> (n + 1) (int(K(|m h - y|), y = n h .. (n + 1) h))

              int(K(|m h - y|) y, y = n h .. (n + 1) h)
            - -----------------------------------------
         alpha2:  (n, m,2) -> -n (int(K(|m h - y|), y = n h .. (n + 1) h))

                int(K(|m h - y|) y, y = n h .. (n + 1) h)
              + -----------------------------------------
and  I have a Matrix "MatA" .



My aim, when I give the value of the Kernel K used in alpha1, and alpha2, like K(x,y)=ln|x-y| , I want a numerci Matrix.

How can I do it.

Many thinks.


assume f and g are unknown

and assume solve(f, x) = solve(g, x)

f -> a

g -> a

b -> f

b ->g

if assume f = (x+1)*(x+2), g = (x+2)*(x+3)

and a = (x+1)*(x+2)*(x+3)

would like to find map from (x+1)*(x+2) to (x+1)*(x+2)*(x+3)


is it the solution subs(x=(x+1)*(x+2),(x+1)*(x+2)*(x+3)) by composition?



subs(x=1, (x+1)*(x+2));
subs(x=2, (x+1)*(x+2));
subs(x=1, (x+1)*(x+2)*(x+3));
subs(x=2, (x+1)*(x+2)*(x+3));

6 -> 24
12 -> 60

subs(x=1, ((x+1)*(x+2)+1)*((x+1)*(x+2)+2)*((x+1)*(x+2)+3)); # not 24
subs(x=2, ((x+1)*(x+2)+1)*((x+1)*(x+2)+2)*((x+1)*(x+2)+3)); # not 60

it seems composition is wrong

more difficult and general case should be

f(x,t)  -> a(x,t)

g(x,t)  -> a(x,t)

b(x,t) -> f(x,t)

b(x,t) -> g(x,t)


solve(f(x,t), x) = solve(g(x,t), x) = in terms of t



R dJ(t)/dt+J(t)/C=f(t)

where f(t) is a driving electromotive force. Use the fourier transform to analyze this equation as follows.



Find the transfer function G(alpha)  then find g(t) .

 Thanks ....


I have a finite difference method used to solve my problem.  My unknown function u(x,y,t) is found using the finite difference method, i would like to plot the solution for different time, and I can do this...



Only I want to make an animation in time if it's possible, and someone can help me.


Thnaks for helping me.


Hi all.

Assume that we have partitioned [0,a], into N equidistant subintervals and in each subinterval we have M sets of poly nomials of the following form:

where Tm(t)=tm( namely Taylor Series) and tf is a(final point)
for Example with N=4, M=3 we have:

now we want to approximate a function, asy f(t), in this interval with following form:

How can we do this with maple????

how can we find the ci's?????

Thanks a lot

Mahmood   Dadkhah

Ph.D Candidate

Applied Mathematics Department

has anybody any idea for this?  been stuck on it for a while now.


let f0 € V be any given function and define a sequence (fn)n€(No) of functions fn € V by 

f:= f0 and fn+1 =Af for all n € (N0)        #A could be the average of the four surrounding points to (i,j) or it could be an N x N matrix with spectral radius less than 1.  not entirely sure. I dont know what it should be but im sure one of you guys know.

prove that this sequence converges pointwise,

 i.e that for all i,j €  [N] x [N], foo(i,j) := limn-> oo fn(i,j) exists.   and that Δfoo=0 


it  says to be in the notation of ("")  but it doesnt matter if its not.  I can adapt to what its meant to be if I can get any way to prove it

Thanks in advance.



Plz help me friends ...

I gave this function ...


i wanna extract coeffitions from this function ... for example what is the coeffition of phi(X)*psi(x)?

i used coeff ... but it had an error ..

unable compute coeff ...

i used collect ... but it had an error

what am i doing with this problem?




I open a discussion about convolution and Fourier coefficients in Fourier series.


I have a function defined by f(x)=0 if x in [-Pi,0[ and 1 if x in [0,Pi[, of course f 2*Pi periodic function.

My goal is compare the Fourier coefficients of f*f ( * convolution ) and The Fourier Coefficient of f.


Thanks for your help.




the question


I already finished part a, my question is how do i define the function g with the variable k being any real value so that maple will find <f,g> = 0 (using the inner product defined)?


Hi all;

Hope all of you  be in good health

I want to construct a special function b_{nm}(t) like:

with piecewise command i did it but the result is incorrect.

any one can help me to do it?

Best wishes


Mahmood   Dadkhah

Ph.D Candidate

Applied Mathematics Department


I open a new subject about Fredholm Integral equation. My code work correctly.

But, I need some modification to get a nice display of the matrix found using
MatA,Vectb := GenerateMatrix(convert(sys3,list),Sol_phi);

such as Sol_phi is my solution that I want to find.

I introduced two function alpha1 and alpha2 in the code  see Equation (9) can I write all the coeficient of my matrix using the two function alpha[1] and alpha[2], it's better to see and read the matrix form.


I have to simplify a piecewise function and Maple gets a more complicated solution than needed.

I don't know how to handle this kind of problems with Maple?
I don't understand why Maple doesn't see this?
Am I doing something wrong?

Thanks in advance for your help / advice.

# the code of my example
# Make a dimensionless function:
# -    Mf(x):= Mf(xi)*F*L
# -    variable ξ  ( xi:=x/L )
# F is the Force and L is the Length of the beam:
Mf(xi):=simplify(Mf(xi)) assuming F>0,L>0;
print("When I simplify this function by hand it will be");

4 5 6 7 8 9 10 Last Page 6 of 25