I need to unpack this function f(x)=2*x in Fourier on segment [0,1]...help me,I don't know how...

Hi guys, i wrote this fairly simply routine, to basically generate n equations, generate relations between those equations, then attempt to solve them by comparing coeffients, upon which i group together the information about the coefficients, for example i could have the equation ax+by=4x, so from that x=4,b=0 The equations in question are Dx=[x,Dy]+[Dx,y], when D is a map which maps x and y to A, where x and y span A's basis. so Dx and Dy would be a linear combination of x and y. This would be for the 2 dimensional case, for the n dimensional case x and y would extend to n variables.

Hi, I am trying to create a multi-linear procedure with a memory (remember). I would like the function to implement (x,y)-> int(int(x*y),t=0..tf),tf=0..T) where x and y would normally be functions of t. I don't seem to be able to figure out how make this happen. The above function is effectively an inner product. I would like to calculate the inner product for the basis functions and remember their values. This will speed up my future computations drastically. If I just define the function without the multilinear property, the function does recognize the linear combinations with the remember. That is if I compute f(a,c) and f(b,c), the lookup table does not know how to process f(a+b,c). It should just equal f(a,c)+f(b,c).

I am looking for some lecture notes covering 'the' 'elementary' properties of the Laplace transform, preferable (but not already written) using Maple for the proofs. What I would like to see is L(f, s) = Int(f(t)*exp(-t*s),t = 0 .. infinity) where s may be _complex_ and is not assumed to be real.

Hi guys, I've forgotten how to count down in a for loop, so something like for i from 4 to 1 do i; end for: Any advice??

Hello Maple experts, during my studies, I have developed a number of Maple procedures that deal with quantum information/quantum computation. This means I use excessively the Matrix data structure and the LinearAlgebra package. Given the fact that I'm not the most talented programmer in general and also that I had no experience with Maple before, I have now a Maple package that is sometimes really slow. Especially when working numerically, I'm often jealous about the performance I could have achieved with Matlab. This is although I already try to use Digits=14 (which should, in principle, enable hardware floating point operations). However, procedures involving Matrix objects are mostly not supported by evalhf (and cannot be compiled, right?). In order to improve that I want to do a profiling. One way of doing that is using

Hi, I am trying to solve a time dependent partial differential equation using pdsolve in maple 11, but when I try to plot the solution I get the following error message: Error, (in pdsolve/numeric/plot) unable to compute solution for t>.200000000000000011: unable to store Float(undefined)+Float(undefined)*I when datatype=float[8] I am new to Maple and I don't know what that error message really means. Can someone please help me? Thanks

how to forcely or better say conditionally stop a "for" loop at a specific reached value without completing the rest of the loop, in other words I have such loop : for i from 0 to 100 do x[i+1]=f(x[i]) end do , I want this loop to stop at i where x[i+1]=x[i] (the fixed point) this can be at i=40 (for example) then I dont need to complete the iteration until i=100, which means how to let maple determine the number of iterations needed. and I need : if x[i+1]=x[i] k:= i: g:=x[i] to use these valuse later on in the program. if I somehow can stop the loop at i where x[i+1]=x[i] then I will absolutely not need the if statement. Can you please tell me how to perform this task?

can anyone solve me this problem in maple? i have a homework for tuesday i have to make a graph for a laplace function: 1/sqrt(2*Pi)*Int( e^(-x^2/2),x=0..x; can anyone help me??? please!

Hello all. I am working with simple algebraic expressions with numerous assumptions on the various constants that appear. One such expression, an entry of a matrix, is > M[1,1]; 2 (beta~ h0~ + h0~^4 - beta~ h0~ - 3 h0~^2 + 2) h0~ ----------------------------------------------- h0~^4 - 3 h0~^2 + 2 Note that the beta h0 terms do not cancel. > simplify(%,symbolic); 2 (beta~ h0~ + h0~^4 - beta~ h0~ - 3 h0~^2 + 2) h0~

A,B,C,D,E,F are known numerical values I want to find x and y such that Signum (-x+A).B +(y+C).D = -1 AND x.E-y.F=G AND |G| minimised I think I can see how to write a routine to do this. However, do any of the commands do this? All help much appreciated.

Hi, i am trying to use assign in this seemingly simple situation output=op restart: s:=k[1][1]*x[1]+k[2][2]*x[1]; op k[1][1] x[1] + k[2][2] x[1] s1:=k[1][1]*x[1]+k[1][2]*x[2]; op k[1][1] x[1] + k[1][2] x[2] l:=solve({coeff(s,x[1])=coeff(s1,x[1])},{k[1][1],k[2][2],k[1][2],k[2][1]}); op {k[2][2] = 0, k[1][1] = k[1][1], k[1][2] = k[1][2], k[2][1] = k[2][1]} p:=solve({coeff(s,x[2])=coeff(s1,x[2]),k[1][2]=0},{k[1][2],k[2][2],k[1][1],k[2][1]}); [] {k[1][1] = k[1][1], k[2][1] = k[2][1], k[1][2] = 0, k[2][2] = k[2][2]} assign(p); Error, (in assign/internal) invalid left hand side of table reference

Hi, i have been fighting with Maple 11 for a long time and i would like to know if i am doing something wrong or the integral is so complex for the program... I really need to solve this problem soon if i would like to have a successfully Master Thesis :) During the degree i study Maple but i forgot a lot :( Here is the issue: I am working in telecommunication issues and calculating the output power i get this integral: P[through] := int(2.000000000*10^8*(.51-1.428285686*10^(-0.1600000000e-1*Pi)*sqrt(1-k[2]^2)*cos(0.2473600e-2*Pi^2/lambda)+(10^(-0.1600000000e-1*Pi))^2*(1-k[2]^2))/((1-.7141428429*10^(-0.1600000000e-1*Pi)*sqrt(1-k[2]^2))^2*(1+2.856571372*10^(-0.1600000000e-1*Pi)*sqrt(1-k[2]^2)*sin(0.1236800e-2*Pi^2/lambda)^2/(1-.7141428429*10^(-0.1600000000e-1*Pi)*sqrt(1-k[2]^2))^2)), lambda = 6.30*10^(-7) .. 6.35*10^(-7))

For some work I am doing with matrices with polynomial entries in certain parameters, I need to know for which values of the parameters there is a possibility that the rank of the matrix drops down. I tried using fraction free Gaussian elimination in both linalg and LinearAlgebra. The two methods do not always give the same resulting matrix. Moreover, the matrix is not as simple as it should be. I understand that a Gauss-Bareiss algorithm produces a result which I would be happier with. Does anyone know of such an implementation for Maple? I have been having some difficulty finding an explicit form for the algorithm on the net.

i have a laplace function. this function contains a integral. how can i use maple to find the fisth 10 terms of a maclaurin series. please, i really need help