Items tagged with math math Tagged Items Feed

Hi All. Hope all is well.

Assume that we have partitioned [0,a], into N equidistant subintervals and in each subinterval we have M sets of polynomials of arbitrary form[say bij(t)](a.e Taylor series, or Bernstein series,…)

for Example with N=4, M=3 and by Taylor series 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: How can  we find L and Z matrices using maple? Is it any way? (or other softwares?)

Regards

 

Mahmood   Dadkhah

Ph.D Candidate

Applied Mathematics Department

 

Take a look at this link.

This is the first presentation of updates for the DE and Mathematical Functions programs of Maple 18. It includes several improvements, all in the Mathematical Functions sector, as well as some fixes. The update and instructions for its installation are available on the Maplesoft R&D webpage for DEs and mathematical functions. Some of the items below were mentioned here in Mapleprimes - you are welcome to present suggestions or issues; if possible they will be addressed right away in the next update.

  • Filling gaps in the FunctionAdvisor regarding all the 6 complex components: abs, argument, conjugate, Im, Re, signum, as well as regarding Heaviside (step function), Dirac, min and max.
  • Fix the simplification and differentation rule for doublefactorial
  • Make convert(..., hypergeometric) work the same way as convert(blabla, hypergeom)
  • Implement integral forms for Heaviside(z) and JacobiAM(z, k) via convert(..., Int)
  • Implement appropriate display for the inert %intat function as well as its conversion to the inert Int
  • Make the FunctionAdvisor/DE return not just the PDE system satisfied by f(z, k) = JacobiAM(z, k)and also (new) the ODE satisfied by f(z) = JacobiAM(z, k)
  • Fix conversion rule from Heaviside(z) to Sum
  • Fix unexpected error interruption when differentiating min(...) and max(...) containing more than three arguments
  • Fix issue in simplify/conjugate
  • Improvement in expand/int: factors in disguise are put outside the integration sign
  • Various improvements in the case of multiple integrals involving the Dirac function
  • Make Intat fully inert (before it was evaluating its arguments)
  • Make value of inert indexed objects work

Edgardo S. Cheb-Terrab
Physics, Differential Equations and Mathematical Functions, Maplesoft

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

I have just begun thinking of trying to make some mathematically defined objects using a 3d printer. I would be happy to hear from anyone who has done this using Maple to prepare input. Pointers for a novice in 3d printing would be appreciated.  I have access to a MakerBot Replicator 2. But the people who have it have only used it to scan objects and make 3d copies of them. 

---Edwin

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 all 

I have the following segment of maple program which belongs to time delay systems dynamic. here C=X-X0-G.Z-X.Dtau.P+X.Dtau.Z-U.P, is a matrix(vector) which comes from reordering the system terms and my goal is to minimizing J:=X.E.Transpose(X)+U.E.Transpose(U), subject to constraint C=0, but i don't know how to do so.

I will be so grateful if anyone can guide me

best wishes

Mahmood   Dadkhah

Ph.D Candidate

Applied Mathematics Department


restart:
with(Optimization):
with(LinearAlgebra):
macro(LA= LinearAlgebra):
L:=1:  r:=2:  tau:= 1:
interface(rtablesize= 2*r+1):

Z:= Matrix(
     2*r+1, 2*r+1,
     [tau,
      seq(evalf((L/(2*(iz-1)*Pi))*sin(2*(iz-1)*Pi*tau/L)), iz= 2..r+1),
      seq(evalf((L/(2*(iz-1-r)*Pi))*(1-cos(2*(iz-1-r)*Pi*tau/L))), iz= r+2..2*r+1)
      ],
     scan= columns,
     datatype= float[8]
);
                        
Dtau00:= < 1 >:
Dtau01:= Vector[row](r):
Dtau02:= Vector[row](r):
Dtau10:= Vector(r):
Dtau20:= Vector(r):

Dtau1:= LA:-DiagonalMatrix([seq(evalf(cos(2*i*Pi*tau/L)), i= 1..r)]):
Dtau2:= LA:-DiagonalMatrix([seq(evalf(sin(2*i*Pi*tau/L)), i= 1..r)]):
Dtau3:= -Dtau2:
Dtau4:= copy(Dtau1):

Dtau:= < < Dtau00 | Dtau01 | Dtau02 >,
         < Dtau10 | Dtau1  | Dtau2  >,
         < Dtau20 | Dtau3  | Dtau4  > >;
 
P00:= < L/2 >:
P01:= Vector[row](r):
P02:= Vector[row](r, j-> evalf(-L/j/Pi), datatype= float[8]):
P10:= Vector(r):
P20:= Vector(r, i-> evalf(L/2/i/Pi)):
P1:= Matrix(r,r):
P2:= LA:-DiagonalMatrix(P20):
P3:= LA:-DiagonalMatrix(-P20):
P4:= Matrix(r,r):

P:= < < P00 | P01 | P02 >,
      < P10 | P1  | P2  >,
      < P20 | P3  | P4  > >;

interface(rtablesize=2*r+1):    # optionally
J:=Vector([L, L/2 $ 2*r]):      # Matrix([[...]]) would also work here

E:=DiagonalMatrix(J);

X:=  Vector[row](2*r+1,symbol=a);
U:=Vector[row](2*r+1,symbol=b);

X0:= Vector[row](2*r+1,[1]);
G:=Vector[row](2*r+1,[1]);
C:=simplify(X-X0-G.Z-X.Dtau.P+X.Dtau.Z-U.P);

Z := Matrix(5, 5, {(1, 1) = 1., (1, 2) = 0., (1, 3) = 0., (1, 4) = 0., (1, 5) = 0., (2, 1) = 0., (2, 2) = 0., (2, 3) = 0., (2, 4) = 0., (2, 5) = 0., (3, 1) = 0., (3, 2) = 0., (3, 3) = 0., (3, 4) = 0., (3, 5) = 0., (4, 1) = 0., (4, 2) = 0., (4, 3) = 0., (4, 4) = 0., (4, 5) = 0., (5, 1) = 0., (5, 2) = 0., (5, 3) = 0., (5, 4) = 0., (5, 5) = 0.})

Dtau := Matrix(5, 5, {(1, 1) = 1, (1, 2) = 0, (1, 3) = 0, (1, 4) = 0, (1, 5) = 0, (2, 1) = 0, (2, 2) = 1., (2, 3) = 0, (2, 4) = 0., (2, 5) = 0, (3, 1) = 0, (3, 2) = 0, (3, 3) = 1., (3, 4) = 0, (3, 5) = 0., (4, 1) = 0, (4, 2) = -0., (4, 3) = -0., (4, 4) = 1., (4, 5) = 0, (5, 1) = 0, (5, 2) = -0., (5, 3) = -0., (5, 4) = 0, (5, 5) = 1.})

P := Matrix(5, 5, {(1, 1) = 1/2, (1, 2) = 0, (1, 3) = 0, (1, 4) = -.318309886100000, (1, 5) = -.159154943000000, (2, 1) = 0, (2, 2) = 0, (2, 3) = 0, (2, 4) = .1591549430, (2, 5) = 0, (3, 1) = 0, (3, 2) = 0, (3, 3) = 0, (3, 4) = 0, (3, 5) = 0.7957747152e-1, (4, 1) = .1591549430, (4, 2) = -.159154943000000, (4, 3) = 0, (4, 4) = 0, (4, 5) = 0, (5, 1) = 0.7957747152e-1, (5, 2) = 0, (5, 3) = -0.795774715200000e-1, (5, 4) = 0, (5, 5) = 0})

E := Matrix(5, 5, {(1, 1) = 1, (1, 2) = 0, (1, 3) = 0, (1, 4) = 0, (1, 5) = 0, (2, 1) = 0, (2, 2) = 1/2, (2, 3) = 0, (2, 4) = 0, (2, 5) = 0, (3, 1) = 0, (3, 2) = 0, (3, 3) = 1/2, (3, 4) = 0, (3, 5) = 0, (4, 1) = 0, (4, 2) = 0, (4, 3) = 0, (4, 4) = 1/2, (4, 5) = 0, (5, 1) = 0, (5, 2) = 0, (5, 3) = 0, (5, 4) = 0, (5, 5) = 1/2})

X := Vector[row](5, {(1) = a[1], (2) = a[2], (3) = a[3], (4) = a[4], (5) = a[5]})

U := Vector[row](5, {(1) = b[1], (2) = b[2], (3) = b[3], (4) = b[4], (5) = b[5]})

X0 := Vector[row](5, {(1) = 1, (2) = 0, (3) = 0, (4) = 0, (5) = 0})

G := Vector[row](5, {(1) = 1, (2) = 0, (3) = 0, (4) = 0, (5) = 0})

C := Vector[row](5, {(1) = 1.500000000*a[1]-2.-.1591549430*a[4]-0.7957747152e-1*a[5]-.5000000000*b[1]-.1591549430*b[4]-0.7957747152e-1*b[5], (2) = a[2]+.1591549430*a[4]+.1591549430*b[4], (3) = a[3]+0.7957747152e-1*a[5]+0.7957747152e-1*b[5], (4) = a[4]+.3183098861*a[1]-.1591549430*a[2]+.3183098861*b[1]-.1591549430*b[2], (5) = a[5]+.1591549430*a[1]-0.7957747152e-1*a[3]+.1591549430*b[1]-0.7957747152e-1*b[3]})

(1)

J:=X.E.Transpose(X)+U.E.Transpose(U);

J := a[1]^2+(1/2)*(a[2]^2)+(1/2)*(a[3]^2)+(1/2)*(a[4]^2)+(1/2)*(a[5]^2)+b[1]^2+(1/2)*(b[2]^2)+(1/2)*(b[3]^2)+(1/2)*(b[4]^2)+(1/2)*(b[5]^2)

(2)

Minimize(J,{C=0});






Error, (in Optimization:-NLPSolve) invalid arguments

 

#XP:=-.015+X[1]+add(X[l+1]*f1(l)+X[r+l+1]*f2(l), l= 1..r):
#plot([XP,T1], t= 0..1);#,legend= "Solution Of x(t) with r=50"):

 

 

 

 

 

 

Download work1.mwswork1.mws

I am new user of Maple. I have an expression like f(x,y)/g(x,y) and I want to have Maple name f(x,y) as something simple like "h" so that later equations write h/g(x,y) instead of the complete f(x,y)/g(x,y), and also to be able to simplify other equations in terms of h.

For example, a=(x+1)(y-5)^2/(x+y-3). Can I get Maple to let h=(x+1)(y-5)^2, so that I get h/(x+y-3) when I ask for a?

Sorry if this question is basic (and my math terminology incorrect), but I have been trying for a while.

Hi all

In matlab software we have a command namely fmincon which minimizes any linear/nonlinear algebric equations subject to linear/nonlinear constraints.

Now my question is that: what is the same command in maple?or how can we minimize linear/nonlinear function subject to linear/nonlinear constraints in maple?

thanks a lot

Mahmood   Dadkhah

Ph.D Candidate

Applied Mathematics Department

Does anyone has any maple worksheet that generate surface using the PDE method described in this article?  I am trying to learn this method but I am not familiar with the mathematics to do it although the paper gives some description of it.  I hope someone can demonstrate the procedure in Maple.  Thanks

http://www.researchgate.net/publication/259095177_Automatic_shape_optimisation_of_pharmaceutical_tablets_using_Partial_Differential_Equations/file/72e7e52a87ed129d4a.pdf

Is there any simple way to print the sum of a series with exceptions?

For example, the following works (sort of), but its not consistent with mathematical notation, where one would expect to see something like a Sigma^' printed out, and the condition, alongw ith ther limits appear under the Sigma sign:

[Sum(1/(k^2-p),k=0..infinity),And(k<>p)]

restart;
g:=0.88641:
e:=2.53128:
eq:=tan(g)= e*sin(f)/(1+e*cos(f)):
fsolve(eq,f);

gives  1.19749

What command/option do I need to get both solutions like with Mathematica:

g = 0.886461;
e = 2.53128;
eq = Tan[g] == (e Sin[f])/(1 + e Cos[f]);
NSolve[eq, f]

  (*   {{f -> -2.56623}, {f -> 1.19756}} *)

thanks

In physics as in math, we often use delta to indicate a (small but finite) variation in a parameter (e.g. delta x). Sometimes Delta (capital delta) is used for a larger variation, and there are even constructs like delta Delta x (a small variation of a larger variation in x). (Don't laugh or frown, this is being done & makes sense in certain situations.)

How do I write this best in Maple, esp. when I use 2-d math and am working on a (live-) script that may be handed out to others incl. students,? I.e. the appearance matters. Just writing delta x is interpreted (in 2-d input) as delta*x which is not what is meant (and leads to funny effects after the first simplify). If I write deltax (one word) then delta does not typeset in its proper greek form, which becomes an issue if you have many of these. I can write delta(x) and that often works (as long as you don't try to differentiate by x), but the typeset equation does not look right either (delta is not a function of x).

Is there a god way of doing this, or am I hitting a wall here?

TIA,

Mac Dude

 

I am trying to illustrate the chain rule for multivariet functions

 

diff(f(u(x,y),v(x,y),x)

 

The Maple responce is D1(f)(u(x,y),v(x,y)*(partial of u(x,y) wrt x) +..etc

 

I would like to replace the D- notation with the standard notation for the "partial of f wrt u" for obvious reasons - this is what students are familar with. The convert cmnd Doe Not Work in this case.

 

Similarly the cmnd diff(u(x,y),v(x,y),x,x) gives rise to D1,D11, D12 symbols which I would likee to convert to standard partial notation.

 

All this is a BIG DEAL when trying to illstrate the chain rule in Cal III.

 

Joe Salacuse

Mathematics

Kettering University

Slides of the presentation at the VII Workshop Fast Computational and Applied Mathematics developed in graduate school at the National University of Trujillo. January 8, 2014.

 

Visualización_Geomét.pdf

 

L. Araujo C.

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