Items tagged with function function Tagged Items Feed

Dear all,

Please, I need help to remplace in the procedure in the code attached,  addadd(beta[i]*u(x+[i]*h),i=0..N)+Error; 
by add(beta[i]*u(x+alpha[i]*h),i=0..N)+Error;  I see, that we must add a function, alpha, but how.

Question2.mw

 

Many thinks

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

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:

If we have:

(Tau is a constant number)
then: can we find L and Z matrices using maple? I have found it manualy but for large M and N this procedure is longsome.

I used Inverse command in maple but the vector's inverse is wrong(operation not defined for Vectors)

Best Wishes

Mahmood   Dadkhah

Ph.D Candidate

Applied Mathematics Department

Hi,

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.

Sol_animation.mw

 

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 (" http://www.mapleprimes.com/questions/201278-Fix-A-Syntax-Error-In-My-Simple-Function-please-Help")  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 ...

fuction_A.docx

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?

:(

 

Hi,

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

Hi,

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.

 

Fred.mw

Hello,

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
restart:
Mf(x):=piecewise(x<=L/2,1/2*x*F,x>1/2*L,1/2*x*F-F*(x-1/2*L));
# Make a dimensionless function:
# -    Mf(x):= Mf(xi)*F*L
# -    variable ξ  ( xi:=x/L )
eq[1]:=Mf(xi)*F*L=Mf(x);
Mf(xi):=solve(eq[1],Mf(xi));
Mf(xi):=subs(x=xi*L,Mf(xi));
# 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");
Mf(xi):=piecewise(xi<=1/2,1/2*xi,xi>1/2,-1/2*xi+1/2);




Hi all,

I will use the following dummy example.

with function,f

f:=(xid,yid)->sum(x[i],i=1..xid)*sum(y[i],i=1..yid);

 

and a complicated term, myterm


myterm:=(f(3,4)+f(2,2))*f(1,1):
myterm:=expand(myterm);

 

'if' i have some previous knowledge, or know a bit of the term, i can find the structure by doing this


repar:=[f(1,1),f(2,2),f(3,4)];  # Or with more f(xid,yid) terms

tmp:=seq(repar[i]=ff[i],i=1..3);
simplify(myterm,{tmp});          # This is fine, gives me what i want

 

But, can we go further, and more 'obvious'

 

Given the fucntion f, same as before, and the same 'myterm'

can I have this
restart:
iwant:=(f(3,4)+f(2,2))*f(1,1);  # as a result, straightforward

so I dont have to go back to 'repar' and find that the terms exactly are.

 

Thanks,

 

Hi say I have the vector V1.

V1:=Vector([a,b,c,d,e,f,g]):

and function myfun.

 

how do i use it as the input to the function my fun, by taking away each element in turn?
myfun(V1[2..]);              # 1st element removed
myfun(V1[[1,3..]]);         # 2nd element removed
myfun(V1[[1,2,4..]]);      # 3rd element removed

and so go

is there a more efficient way?

 

Many thanks,

This has been buggin me all day, but if i define a variable with an expresion say "a:=3 x+5" and i then want to assign this expression to a function like so "f:=x->a". if i then call f(7), maple return with "3 x+5" so just returning the value of a without substituting x with 7.

Is there any way in which i can define a function this way?

1 2 3 4 5 6 7 Last Page 1 of 19