Maple Questions and Posts

These are Posts and Questions associated with the product, Maple

Suppose that I have the equation x=1. I want to manipluate it. For example, I want to multiply by 2. Then, Take the power of two. Next, take a cubic root. How can I do this in Maple?

 

Qu_in_maple.mw

How to compute the  n component of U[i] even to reach the exact solution?

 

``

k := proc (t) options operator, arrow; t end proc:

U[0] := f(x):

for i to N do U1[i-1] := subs(x = t, U[i-1]); U[i] := (1/2)*x^2*(int(t*U1[i-1], t = a .. b)) end do:

Parse:-ConvertTo1D, "first argument to _Inert_ASSIGN must be assignable"

cos(x)+x^2+(1/2)*x^2*(-2+(1/4)*Pi^4)+(1/8)*x^2*(-1+(1/8)*Pi^4)*Pi^4+(1/64)*x^2*(-1+(1/8)*Pi^4)*Pi^8

 

cos(x)+(1/512)*x^2*Pi^12

(1)

Exact := proc (x) options operator, arrow; cos(x) end proc

``

 

 

``

 

 

 

 

 

 

 

 

 

 

 

 
 

 

``

 

Download Qu_in_maple.mwQu_in_maple.mw

How to find the  n component of U[i] even to reach the Exact solution cos(x)

I am trying to solve 4 nonlinear equations for four variables using fsolve  and the output that i am getting is basically the same equations repeated after some time.  I even tried reducing one of the equations using assumptions from my side but it results in same behaviour..  Quite new to maple, would like some advice as to this behaviour. Thanks

 Here's the file

fsolve_1.mw

 

PS- using do loop is part of the solving so i cannot remove that

I am not seeing any reference in help to TRDPolynomial_ring in PolynomialRing function in RegularChains. Though if I debug it, I can get in it. Is it that it is part of kernel ?

Hi all

I need to convert int matrix into matrix over finite field.

E.g: Convert inform integer number

      A := <140, 155, 162, 64;

               218, 12, 245, 50;

                36, 251, 34, 253;

                171, 251, 184, 37>;

 into B = <x^7+x^3+x^2,x^7+x^4+x^3+x+1,x^7+x^5+x, x^6;

             x^7+x^6+x^4+x^3+x, x^3+x^2, x^7+x^6+x^5+x^4+x^2+1, x^5+x^4+x;

            x^5+x^2, x^7+x^6+x^5+x^4+x^3+x+1, x^5+x, x^7+x^6+x^5+x^4+x^3+x^2+1;

            x^7+x^5+x^3+x+1, x^7+x^6+x^5+x^4+x^3+x+1, x^7+x^5+x^4+x^3, x^5+x^2+1>;

 

(Matrix B over finite field GF(2^8)/f(x) =x^8 + x^6 +x^5 +x^3 +1) 

Thanks alot.

Dear all,

I like to plot a function, let's say x^2 in a boxed axis mode; i.e. 

plot(x^2,axis=boxed)

 

Howeve, I want the plot to have tickmarks on all four axises, and not only the normal x and y axis.

Can anyone help me with this please? 

 

 

 

plotpoints.mw

I want to plot points when it =1,2,3,..,11,12 instead of a continous line displayed in the worksheet I uploaded. How to modify the function? Thank you for helping:)

 

How to  compute the recurrence relation and I find the problem when the summation of U because appear noise term self-canceling and I can not find the nth component of U?Mixed_volterra_-Fredholm_(278)_Ex(8.17).mw

"this program is solving Mixed Fredholmvolterra integral equation using modified decomposition method  page 278 Example(8.17) by    Creation date : (9\3\1437)   ------------------------------  u(x)=f(x,t)+(&int;)[0]^(t)(&int;)[0]^(1)F(x,t,r,s)*u(r,s) &DifferentialD;r ds.  -----------------------------"

restart

f := proc (x, t) options operator, arrow; exp(-t)*(cos(x)+t*cos(x)+(1/2)*t*cos(x-1)*sin(1)) end proc:

U[0] := f1(x, t):

for i from 2 to 5 do U1[i-1] := subs({r = x, s = t}, U[i-1]); U[i] := simplify(-(int(int(F(x, t, r, s)*U1[i-1], r = 0 .. 1), s = 0 .. t))) end do:

``

``

 

Download Mixed_volterra_-Fredholm_(278)_Ex(8.17).mwMixed_volterra_-Fredholm_(278)_Ex(8.17).mw

 

thank you for helping:)

The well known William Lowell Putnam Mathematical Competition (76th edition)  took place this month.
Here is a Maple approach for two of the problems.

1. For each real number x, 0 <= x < 1, let f(x) be the sum of  1/2^n  where n runs through all positive integers for which floor(n*x) is even.
Find the infimum of  f.
(Putnam 2015, A4 problem)

f:=proc(x,N:=100)
local n, s:=0;
for n to N do
  if type(floor(n*x),even) then s:=s+2^(-n) fi;
  #if floor(n*x) mod 2 = 0  then s:=s+2^(-n) fi;
od;
evalf(s);
#s
end;

plot(f, 0..0.9999);

 

min([seq(f(t), t=0.. 0.998,0.0001)]);

        0.5714285714

identify(%);

So, the infimum is 4/7.
Of course, this is not a rigorous solution, even if the result is correct. But it is a valuable hint.
I am not sure if in the near future, a CAS will be able to provide acceptable solutions for such problems.

2. If the function f  is three times differentiable and  has at least five distinct real zeros,
then f + 6f' + 12f'' + 8f''' has at least two distinct real zeros.
(Putnam 2015, B1 problem)

restart;
F := f + 6*D(f) + 12*(D@@2)(f) + 8*(D@@3)(f);

dsolve(F(x)=u(x),f(x));

We are sugested to consider

g:=f(x)*exp(x/2):
g3:=diff(g, x$3);

simplify(g3*8*exp(-x/2));

So, F(x) = k(x) * g3 = k(x) * g'''
g  has 5 distinct zeros implies g''' and hence F have 5-3=2 distinct zeros, q.e.d.

 

Hello,

I have an non coupled non linear oscillator.

I notice that, if I try to plot for a time too big, my plot doesn't converge anymore and didn't keep an elliptic trajectory. In other words, the plot didn't stay in the limit cycle.

Do you know why, if tmax is too big, the solution is no longer stable ? Do you have ideas so that I can keep a stable limit cycle even if I increase tmax ?

My code is the following :

r:=sqrt((x(t)/a)^2+(z(t)/b)^2);
eqx:=diff(x(t),t)=alpha*(1-r^2)*x(t)+w*a/b*z(t);
eqz:=diff(z(t),t)=beta*(1-r^2)*z(t)-w*b/a*x(t);
EqSys:=[eqx,eqz];

params := alpha=1, beta=1, a=0.4, b=0.2, w=1;

EqSys := eval([eqx,eqz], [params]);
xmax := 0.8; zmax := 0.4;
tmax := 400;
ic:=[x(0)=0.4, z(0)=0];
DEplot(EqSys, [x(t),z(t)], t= 0..tmax, [ic],linecolor=black, thickness=1,x(t)=-xmax..xmax, z(t)=-zmax..zmax, scaling=constrained,arrows=none);

Thanks a lot for your help.

I want to plot the curve of a pythagorean quadruple. Any suggestions? I think I have to use space curve. I never liked the options for color on those though. I'm guessing it's just a single curve based on what I know about these things. I have no idea what to expect but I'm sure it will please me no matter what.

X=2*m*p/(m^2+n^2+p^2)

y=2*n*p/(m^2+n^2+p^2)

z=(p^2-(m^2+n^2))/(m^2+n^2+p^2)

 

 

using FDM or FEM rather than dsolve?

ode.docxode.docx

Occasionally I have need to import 1D Maple expressions into Mathematica, because I believe mma has superior simplify functionality (sorry Maple). Mathematica has its own syntax which (of course) differs to maple.  eg sin(x) in maple is Sin[x] in mma ; ln(x)=Log[x] ;....... I'm aware of the package MmaTranslator, but I think it only converts mma to maple.

so i need some code pls.

(i have bolded the functions which need to be converted)

eg: i/p:

(1/365)*(365*B21*EP*ln(1+i)*(1+i)^B21*hr*kw*p-365*EP*hr*kw*p*(1+i)^(-1+B21)*i-365*EP*hr*kw*p*(1+i)^(-1+B21)+365*EP*hr*kw*p+SC*i)/(hr*kw*(EP*ln(1+i)*(1+i)^B21*p-FIT*i*p+cos(omega)))

o/p:

(1/365)*(365*B21*EP*Log[1+i]*(1+i)^B21*hr*kw*p-365*EP*hr*kw*p*(1+i)^(-1+B21)*i-365*EP*hr*kw*p*(1+i)^(-1+B21)+365*EP*hr*kw*p+SC*i)/(hr*kw*(EP*Log[1+i]*(1+i)^B21*p-FIT*i*p+Cos[omega]))

 

I ran into a problem with define that I traced to the 'linear' option in the define statement, and I would like to know whether this is my lack of understanding define, or a bug.

I want to define a function called avg(parm) (which I never will need to use explicitly but  I need to be able to manipulate). This function has the property of being linear, and terms not depending on x can be pulled out. Also, avg(parm)=parm unless parm depends on x. (Yes, it stands for a kind of averaging, but that is not relevant here).

So I programmed it in this way:

define(avg,'linear','conditional'(avg(a::algebraic) = a, _type(a, freeof(x))),\
'conditional'(avg(a::(nonunit(algebraic))*b::(nonunit(algebraic))) = a*avg(b), _type(a, freeof(x))));

For the heck of it I could not get it to work. Basically, none of the equations in the definition were ever used, except that constant numeric factors were pulled out, as they should.

Eventually I found that the 'linear' option was the culprit. Once I got rid of that, the definition of avg did what I wanted it to do (like avg(a*x) => a*avg(x); avg(a) => a). The reason a constant numeric factor was pulled out before is because the 'linear' option does that; it never gets to my definitions (one can see that when printing avg).

Am I missing something fundamental here, or is define not working right?

For the record, I did this in Maple 15 on a PPC Mac. I don't have my Maple 2015 handy to test on that version.

Any insights?

Mac Dude

Hi,

I'm null in statistic. I'm doing a calculation to calculate a set of parameter. By example:

I have to calculate 5 parameters x1,x2,x3,x4,x5 from 7 equations f1,f2,f3,f4,f5,f6,f7. Because it is difficult to calculate directly 5 parameters, I used chisquare to minimize the difference between experimental and theorical data. Then, I can get the results. After that, I used these 5 parameters to back-calculate the data using 7 equations above. My question is about how to calculate the error bar (or standard error) of the back-calculate datato add to the plot.

Thank you  for helping me,

Best regards.

 

First 1163 1164 1165 1166 1167 1168 1169 Last Page 1165 of 2224