Items tagged with polynomial polynomial Tagged Items Feed


Dear Colleagues,


I am not sure if there exist a simple way to handle the issues I am facing. I am trying to obtain numeric roots for a polynomial f(x,a). I know for sure that there can be many roots depending on the value of parameter a. However, I cannot say for sure how many roots are possible for each value of parameter a. Some of these roots are complex numbers. Also, I need to choose only those roots that have following properties:

1. They are real.

2. f(x*,a) i.e., function value at a root is positive. 


How do I solve f(x,a)=0 to store all roots in a set? Furthermore, how do I select and print roots that have the properties mentioned above? Is there a way to do filtering of a set specifying properties of the members of the set? Please suggest. Your help is highly appreciated.







how to count how many terms or items are equal when compare two lists of polynomial terms when length of two list may not be equal

If an expression is of the form x^3 + x^2 + x + z + y^3 + y^2 + y + xy=0 ,

How to represent it in the following form,

           x^3 + y^3 + x^2 + y^2 + xy + x + y + z=0 ?

 Hi all,

 Is there anyone who could help me with this error? I am sure there is at least one solution for the equation.


Maple Worksheet - Error

Failed to load the worksheet /maplenet/convert/ .


I am trying to simplify the following polynomial.

> R1 := collect(((3*d1^2-2*d1-d1^3)*r-3*d1^2+d1^3+2*d1)*R^3+((-6*d1+7*d1^2-d1^3)*r^2+(d1-d1^3-3*d1^2+2)*r)*R^2+((-6*d1+6*d1^2)*r^3+(-4*d1^3+6-7*d1+2*d1^2)*r^2)*R+(2*d1^2-2*d1)*r^4+(-2*d1^2-4*d1+4)*r^3,[R,r,d],recursive);


With the "collect along with rucursive" unable to give compact version. In the above polynomial most of the bracket terms will have factors([3*d1^2-2*d1-d1^3]=-d1*(d1-1)*(d1-2)), but the collect command unable give these factors, doing such manual simplification in bigger polynomial case is complex. Is there any way to represent above polynomial in compact form.


Thanking you in advance.





In my study, I often need to verify that two operator is symmetric i.e. [P,Q]=PQ-QP=0, where A and D are operator polynomial such like  D2+4u+uxD-1 multiply with D3+uD+ux,where D is differential operator.

I tried to use the Ore_package which can easily deal with the operator polynomial without integral(i.e. D-1 term), so in my case , how to deal with operator with both differential and integral?

I have the following multi-variable polynomial:


Here my question is how to (i) generate "F" in the following form-> F:=k1*C+k2*L+k3*x1; (ii) How to find the coeficient terms of  "C", "L", "x1".


Thanking you in advance.



I am having 26th degree polynomial univariate equation , I used Isolate to get the roots. but I am getting some extra roots which are not true they I even tried to substitute those roots in original equation then I got non zero answer instead of getting nearly zero answer.How is it possible??


equation looks like:


Solutions i got:

[t = -4.162501845, t = -2.295186769, t = -1.300314688, t = -.8048430445, t = -0.6596008501e-1, t = -0.4212510777e-1, t = 0.4212510777e-1, t = 0.6596008501e-1, t = .8048430445, t = 1.300314688, t = 2.295186769, t = 4.162501845]

t=4.162501845 give me non zero answer when I substitute it in the equation given above:

I got this answer: 4.750212083*10^39


Hello Mapleprime users

I am having an issue with a numerical integration calculation. I have a large(ish) polynomial integrand and need to apply two integrations which I am using the _cuhre method for. See attached the minimum working example file.

Firstly some simplifications are done to the integrand and then a basic for loop which calculates the integration for r from 0 to 20 in steps of 0.1. The issue occurs when the loop hits r~2.5 (on my machine, Maple 2015, i5, 16GB ram). Up to that point the calculation is steady with the following stats per point calculated:

memory used=87.59MiB, alloc change=0 bytes, cpu time=3.45s, real time=3.15s, gc time=439.16ms

Then when the calculation gets to ~2.5 it just hangs and will not calculate past it. Any ideas as to what is going on here?

Any help would be appreciated with this issue.

Thank you in advance




Round := proc(x,n::integer:=1)
end proc:

roundcoeffs1:=proc(p,x,n:=1) local t,c;
c:=map(Round, [coeffs(p,x,t)],n);
add(i, i = zip(`*`, c, [t]));


roundcoeffs1(ggg, [y^3, c*A*y^3, c*A*y^2, c*y*B, c*A*y, c*B, y^2, y, c*A, c*B*y^3, c*B*y^2], 4);

Error, (in sprintf) number expected for floating point format

Hello everyone,
I would like to get a symbolic result of each variable x,y and z for the following 3 nonlinear equations. Maple does not respond to the following code at all. (Not even an error report.)


eq1 := x^2+y^2+z^2-134*x+800*y-360*z+31489, 2;
eq2 := x^2+y^2+z^2-934*x+900*y-370*z+321789, 2;
eq3 := x^2+y^2+z^2-614*x+1350*y-1110*z+70048, 97;
solve({eq1, eq2, eq3}, {x, y, z});

Thanks in advance.

P.S: Afterwards my intention is to solve these equaitons numerically for different variable values, and transfer to MatLab in order to plot animations and graphs. 

how i can calculate roots of the characteristic polynomial equations {dsys and dsys2}
and dsolve them with arbitrary initial condition for differennt amont of m and n?

restart; a := 1; b := 2; Number := 10; q := 1; omega := 0.2e-1

Q1 := besselj(0, xi*b)*(eval(diff(bessely(0, xi*r), r), r = a))-(eval(diff(besselj(0, xi*r), r), r = a))*bessely(0, xi*b):

J := 0:

m := 0:

U1 := (int(r*K1[m]*(diff(K_01[m], r)+K_01[m]/r), r = a .. b))/(int(r*K1[m]^2, r = a .. b)); -1; U2 := -(int(r*K_01[m]*(diff(K1[m], r)), r = a .. b))/(int(r*K_01[m]^2, r = a .. b)); -1; U3 := (int(r^2*omega^2*K_01[m], r = a .. b))/(int(r*K_01[m]^2, r = a .. b))



Q2 := besselj(1, eta*b)*(eval(diff(bessely(1, eta*r), r), r = a))-(eval(diff(besselj(1, eta*r), r), r = a))*bessely(1, eta*b):

E2 := unapply(Q2, eta):

m := 0:

dsys := {diff(S_mn(t), t, t, t)+xi[m]^2*(diff(S_mn(t), t, t))+(-U1*U2+eta__n^2)*(diff(S_mn(t), t))+xi[m]^2*eta__n^2*S_mn(t) = -(2*U2*b_m/(Pi*xi[m])*(-besselj(0, xi[m]*b)/besselj(1, xi[m]*a)))*q+xi[m]^2*U3}; 1; dsolve(dsys)

{S_mn(t) = (3111111111/5000000000000)/(K_01[12]*eta__n^2)+_C1*cos(eta__n*t)+_C2*sin(eta__n*t)+_C3*exp(-xi[12]^2*t)}


dsys2 := {diff(Q_mn(t), t, t, t)+xi[m]^2*(diff(Q_mn(t), t, t))+(-U1*U2+eta__n^2)*(diff(Q_mn(t), t))+xi[m]^2*eta__n^2*Q_mn(t) = -2*besselj(0, xi[m]*b)*U1*U2*b_m*(1-exp(-xi[m]^2*t))/(besselj(1, xi[m]*a)*Pi*xi[m]^3)}; 1; dsolve(dsys2)

{Q_mn(t) = _C1*exp(-xi[12]^2*t)+_C2*sin(eta__n*t)+_C3*cos(eta__n*t)}







Hello guys,

I was just playing around with the Shanks transformation of a power series, when I noticed that polynomials aren't evaluated as I would expect.
I created this minimal working example; the function s should evaluate for z=0 to a[0], however it return simply 0.
Is there something I messed up?


s := proc (n, z) options operator, arrow; sum(a[k]*z^k, k = 0 .. n) end proc;

proc (n, z) options operator, arrow; sum(a[k]*z^k, k = 0 .. n) end proc


series(s(n, z), z = 0)



The value of s in z=0 should be a[0], however it returns 0:

s(n, 0)



s(1, 0)





Thanks for your help,


I am trying to simplify the square of a parameterized polynomial mod 2. My parameters are intended to be either 0 or 1. How do I accomplish this?

For example:


alias(alpha = RootOf(x^4+x+1))



z := alpha^3*a[3]+alpha^2*a[2]+alpha*a[1]+a[0]``



z2 := collect(`mod`(Expand(z^2), 2), alpha)








I would like to simplify the squared parameters modulo 2. a[3]^2=a[3], etc.

Any help would be appreciated. Elegant methods even more so!






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