Maple 17 Questions and Posts

These are Posts and Questions associated with the product, Maple 17

Dear all

I have a non continuous function at 0,  how can I use the deifnition of Borel measurable funciton, to show that f is Borel measurable function

borel_M_fct.mw

thank you for your help 

Dear all

I have an equation, I would like to introduce a variable R[0], how can I use subs in my equaiton 

subs_equation.mw

Thank you

Dear all

Can I compute using maple intersection between discrete sets

intersection_sets.mw

thank you for your help 

Dear all

How can I determine a positive constant M such that the following inequality hold for any positive values of a, b,c. 

More precisley, I determine M such that  f(a,b,c) greater or equal M a^2 

The constant M is a positive constant depend only on alpha 

find_positive_constant_M.mw

thank you for your help 

Dear all

I would like to compute Hardy−Littlewood maximal function : we use polar coordinate for a radial function  and then evalaute integral with respect the radius r 

Hardy_maximal_function.mw

Thank you for your help 

What is the result of the following?

solve((4*t1+4*sqrt(t1^2-4*t2))>0,{t2});
 

Dear all

I  have a PDE, I would like to substitute the funciton T by another funciton 

How transform the old PDE to a new PDE

transfirm_equation_using_change_variable.mw

thank you

Dear all

I have an equation obtained from partial derivable of some functions, I would like to compute the limit when my variable named Pe goes to infinity. 

I hope to get a more appreciate presentation of my code to obtain the limit (  Pe -> + infty)

limit_infinity.mw

All derivative are well compute, but How can I add the limit as Pe goes to infinity

Thank you 

I am trying to obtain the solution of the differential equation f'''+ff''-f'^2-Mf'=0, with f(0)=0, f'(0)=1, and f'(5)=0 with M=0.5 using finite element method

But got this error. I attached the file also.

restart

with(LinearAlgebra):

with(plots):

M := .5;

.5

(1)

a := 0;

0

(2)

b := 5;

5

(3)

N := 50;

50

(4)

h := (b-a)/N;

1/10

(5)

nodes := [seq(h*i+a, i = 0 .. N)];

[0, 1/10, 1/5, 3/10, 2/5, 1/2, 3/5, 7/10, 4/5, 9/10, 1, 11/10, 6/5, 13/10, 7/5, 3/2, 8/5, 17/10, 9/5, 19/10, 2, 21/10, 11/5, 23/10, 12/5, 5/2, 13/5, 27/10, 14/5, 29/10, 3, 31/10, 16/5, 33/10, 17/5, 7/2, 18/5, 37/10, 19/5, 39/10, 4, 41/10, 21/5, 43/10, 22/5, 9/2, 23/5, 47/10, 24/5, 49/10, 5]

(6)

elements := [seq([i, i+1], i = 0 .. N-1)];

[[0, 1], [1, 2], [2, 3], [3, 4], [4, 5], [5, 6], [6, 7], [7, 8], [8, 9], [9, 10], [10, 11], [11, 12], [12, 13], [13, 14], [14, 15], [15, 16], [16, 17], [17, 18], [18, 19], [19, 20], [20, 21], [21, 22], [22, 23], [23, 24], [24, 25], [25, 26], [26, 27], [27, 28], [28, 29], [29, 30], [30, 31], [31, 32], [32, 33], [33, 34], [34, 35], [35, 36], [36, 37], [37, 38], [38, 39], [39, 40], [40, 41], [41, 42], [42, 43], [43, 44], [44, 45], [45, 46], [46, 47], [47, 48], [48, 49], [49, 50]]

(7)

bilinear := proc (u, v, w) options operator, arrow; int(diff(u(x), `$`(x, 3))+u(x)*(diff(u(x), `$`(x, 2)))-(diff(u(x), x))^2-M*u(x)*(diff(u(x), x)), x = w[1] .. w[2])+int((diff(u(x), x))*(diff(v(x), x)), x = w[1] .. w[2]) end proc;

proc (u, v, w) options operator, arrow; int(diff(u(x), `$`(x, 3))+u(x)*(diff(u(x), `$`(x, 2)))-(diff(u(x), x))^2-M*u(x)*(diff(u(x), x)), x = w[1] .. w[2])+int((diff(u(x), x))*(diff(v(x), x)), x = w[1] .. w[2]) end proc

(8)

Llinear := proc (v, w) options operator, arrow; v(a)*(diff(w(x), x)) end proc, x = a;

proc (v, w) options operator, arrow; v(a)*(diff(w(x), x)) end proc, x = 0

(9)

K := CreateMatrix(N+1, N+1, 0);

CreateMatrix(51, 51, 0)

(10)

F := CreateVector(N+1, 0);

CreateVector(51, 0)

(11)

for e in elements do x1 := nodes[e[1]]; x2 := nodes[e[2]]; h := x2-x1; Ke := bilinear(proc (x) options operator, arrow; piecewise(x < x1+(1/2)*h, 1-(x-x1)/h, (x2-x)/h) end proc, proc (x) options operator, arrow; piecewise(x < x1+(1/2)*h, (x-x1)/h, (x2-x)/h) end proc, [x1, x2]); Fe := Llinear(proc (v) options operator, arrow; v(x)*piecewise(x = x1, 1, x <> x1) end proc, [x1, x2]); for i in [e[1], e[2]] do for j in [e[1], e[2]] do K[i, j] := K[i, j]+Ke[i-e[1]+1, j-e[1]+1] end do; F[i] := F[i]+Fe[i-e[1]+1] end do end do

Error, invalid subscript selector

 

K[1, 1] := 1;

1

 

0

 

0

(12)

K[N+1, N+1] := 1;

1

 

0

(13)

u := LinearSolve(K, F)

Error, (in LinearAlgebra:-LinearSolve) invalid input: LinearAlgebra:-LinearSolve expects its 1st argument, A, to be of type {Matrix, list({Matrix, Vector})} but received K

 

f := unapply(u(x), x);

proc (x) options operator, arrow; u(x) end proc

 

Warning, unable to evaluate the function to numeric values in the region; see the plotting command's help page to ensure the calling sequence is correct

 

 

``

``

Download FEM.mw

Dear all

I have a third order equations, I would like to know the sign of its roots, not necessary to find the roots since the equations contains some parameters. All parameters used are positives. 

roots.mw

thank you

Dear all

have a nice time. 

I have a system of nonlinear differential equation with continuous delay.  I tried to find some books that define a strategy to compute the characteristic equation but unfortunattely the most of papers or books give directly the formula without any proof. 

I tried with maple, but unfortunattely no solution up to now. 

I hope find the strategy how find the characteristic equation of the attached system.

characteristic_equation.mw

thanks 

Dear all 
For n geater or equal 2, I would like to solve to find an integrer n that such satisfy an inequality. 

I would like to see how large does n have to be for  the following ineqlaity satisfied. 
But, unfortunattely Maple return 
Warning, solutions may have been lost

restart;
epsilon:=0.001;
solve(10^n /factorial(n) <= epsilon, n);

thank you 

Dear all

I would like to expand x^m using JacobiP  ( jacobi polynomials), with the two parameter alpha  and alpha +2, I have a result in my book using alpha and alpha+1 but i would like to get a similar result using alpha and alpha+2 

Inverse_formula_jacobi_polynomials.mw

Thank you 

An example of uniform motion along a generalized coordinate using the Draghilev method. (This post was inspired by school example in one of the forums.)
The equations used in the program are very simple and, I think, do not require any special comments. DM is a procedure that implements the Draghilev method with "partial parameterization".

DM_V.mw

When K = 1, parameterization is carried out by changing the angle of rotation of the wheel. That is, uniform rolling is carried out.

For K = 4, the coordinate corresponding to the position of the slider is parametrized.

 

When K = 6, the slider moves with acceleration, according to a given equation. Hence, we have carried out the parameterization with respect to “time”.



With the help of such techniques, we can obtain the calculation of the kinematics of both lever mechanisms and various types of manipulators.

Dear all

I have a function F(x,t) , I would like to get the first asymptotic approximations of this function when t goes to infinity for fixed x

But maple return 

Error, (in asympt) unable to compute series

series.mw

Thank you 

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