Items tagged with polynomial polynomial Tagged Items Feed

 Let M be a matrix with polynomial array f_i's such that any array is in K[a_1,..,a_m][x_1,..,x_n] where a=a_1,,,a_m are sequence of parameters and x=x_1,..,x_n are sequense of variables. Now, I want to extract the coefficients of  f_i that are in K[a_1,a_2,..,a_m]. For example if M=Matrix([[ax-bxy],[cx^2-dy]]) how can I extract the matrix coefficint C=Matrix([[a,-b],[c,-d]])?

Please note that a,b,c,d are parameters and x,y are variables.

Problem: I have two polynomials with arbitrary coefficients. I set them both to 0 and I used the 'map' , as well as 'coeffs' command to make the coefficients equal to 0.

Now for some reason, Maple does not print in order for one of the polynomials and it does for the other.

 

Note that 'order' refers to the coefficients attached to the powers of the variable.

 

Quick example: (this one actually works on Maple, but just not the one I have)

 

e1:= ax + (b + c)x^2 = 0

e2:= (c + d)x + (a + c)x^3 = 0

 

After applying map and coeff, one expects it to output

 

a = 0, (c + d) = 0, (b + c)=0, (a + c) = 0

 

instead I got

 

a = 0, (c + d) = 0, (a + c) = 0,(b + c)=0

 

Here is the problematic file

OutOfOrder.mw

Here we have a very brief introduction to the use of embedded components, but effective for the study of the polynomials in operations and some products made with maple 2015 to strengthen and raise the mathematics today.

 

Operaciones_con_Polinomios.mw

(in spanish)

Atte.

L.AraujoC.

This question is 99% similiar to an previously posted question, but this one has a little twist(s).

 

http://www.mapleprimes.com/questions/200101-Solving-For-Coefficients-Of-Polynomial-Equations

 

Here is the sample problem. Let's say I have the following equations

 

e1:=(a+b+1)x^2 + (a+1)*x^4 = 0;

e2:=(a-b)*x+ (a^2 - 1)*x^3 = 0;

 

One can immediately tell the system is inconsistent because on x^3, we have a = -1,1 but on x and x^2 we have a = -1/2

This is precisely the problem I am facing, my e1 and e2 will eventually get bigger (bigger as in the order of the polynomial will increase) and I keep facing inconsistencies.

However if I could find a way to code it so that I can ask Maple to solve only up to a certain degree it would be great. This will eliminate any inconsistency

 

For example, using the system I have here, the system is consistent up to order 2 (it will always start from constants and up to a certain power). So I will ask Maple to solve the above system up to order 2.

Here is a pseudocode I have been working on.

 

For i = 1..2 //this might be increased, but it will of course be finite and probably won't go past 10.

For j = 0..N


//N is the degree of polynomial

f[i]:= coeff(e[i],x,j);

end

end

 

//the above generates the equations, below will solve it

 

solve( { f[i], i=1..?} ,{a,b})

 

Note that the pseudocode assumes e[i] are expressions and not equations set to 0 (which is what I have). Is there an "un"unapply on maple?

 

edit1: have to sleep  (late where I am! Will check for responses tomorrow) thank you

Here we have an application to understand how algebraic expressions, calculating degrees relative abosulutos polynomial operations and introduction to work.Here we have an application to understand how algebraic expressions, calculating degrees relative abosulutos polynomial operations and introduction to work.

 

Grados_de_Polinomios.mw

(in spanish)

Atte.

L.AraujoC.

 

 

Hello,

 

I wonder if it is possible to create standalone executables in Maple that would run in a  computer without Maple. Also if it is possible can we do that with Matlab code in it too?  

 

Matlab does not allow to create standalone executable is you use symbolic toolbox and I want to find a solution for that. What I will need to take second derivatives and get the coefficients of polynomials. 

How to find (i. e. to evaluate) the positive root of the polynomial equation

mul(x+j, j = 0 .. 2015)=1?

The command

RootFinding:-NextZero(x-> mul(x+j, j = 0 .. 2015)-1 , 0);

outputs

                              FAIL
The same with Digits:=100.

Hi EveryOne!

I have polynomial: p(x) = x^4 + 27x^3 + x^2 + 16x +1 over finite field F=GF(2^8)/f(x)=x^8 + x^4 +x^3 +1

The factors of this polynomial are: (x + 37)(x + 217)(x^2 + 213x +30) (in maple)

Hence there two roots of p(x): x = 37 and x = 217 in GF(2^8). The factor x^2 + 231x +30 is of degree 2. There are not roots in F. But in extension field GF((2^8)^2) of F, also there are two roots of factor x^2 + 213x + 30 (for example: x = 256 and x = 256^256 = 487).

How to find these roots of p(x) in extension field GF((2^8)^2) by maple? Please help me! Thanks a lot.

I have two polynomials, say

 

x(t) = a[0] + a[1]t + a[2]t^2

y(t) = b[0] + b[2]t + b[3]t^2

 

with the following conditions, x(0) = 2 and y(0) = 1. The polynomial are related by

 

x'(t) = y(t)

y'(t) = x(t)

 

and x(0) = 2, y(0) = 1.

 

One can show that the solution is x(t) = 2 + t + t^2 + O(t^3) and y(t) = 1 + 2t + 0.5t^2 + O(t^3).

 

I am trying to write something so that it works on a larger system. I have a set of nonlinear DEs which i want to solve this way. Here is a sample code of a much simplifed problem.

 

See the uploaded file for details.

 

edit: link is reparied. I uploaded the wrong file initially

 

edit2: Some improvements were made, but Maple still not returning.

 

 

 

2-2_tests_01.mw

hi everyone.how can i write a function or procedure or summation so that i can write down the following polynomial ? i just want to create a set of polynomials which their summation of power ( power of x + power of y ) be less than three or equal to three ? the coefficients priority is not important , for example it is not important that a1 multiplies to x or y , i just want to create this polynomial with some coeeficients. tnx for help

``

restart:

a[9]*y^3+x^3*a[8]+x^2*y*a[5]+x*y^2*a[7]+x^2*a[2]+x*y*a[4]+y^2*a[6]+x*a[1]+y*a[3]+a[0];

x^3*a[8]+x^2*y*a[5]+x*y^2*a[7]+y^3*a[9]+x^2*a[2]+x*y*a[4]+y^2*a[6]+x*a[1]+y*a[3]+a[0]

(1)

 

``

 

Download problem.mw

OK, what am I doing wrong here?

This polynomial can be factored by almost anyone who knows algebra:

factor(x^2+y^2+2*xy);

but Maple refuses:

 x2  + y2  + 2 xy

but if I pose the question this way:

ans := expand((x+y)^2);

factor(ans);

(x + y)2

I get the expected result.  What is wrong with how I am using the factor?

I am trying to simplify sums of a few LaguerreL polinomials of different n using the identities in the function advisor such as recurrsion relations. How does one go about in using the FunctionAdvisor identities when trying to simplify expressions containing orthogonal polynomials? 

 

 

(http://imgur.com/SDBP0sw)


Hello, everyone!


I was given this week's Maple assignment in my class and I've come across a problem. I'll say this now so I don't get sent away, I am NOT asking for the answer. For this question there is a part A and part B, but also a preliminary check to make sure our code is wokring (as seen in the picture link). The issue I'm here for is that I can't figure out the code for the preliminary check... I've been here for hours and I'm stumped.

 

This is my attemp so far; 

 

f := x^(6*ln(x))

Digits:=15;

T2 := convert(%, polynom)

f_value := evalf(subs(x = 5, T2))

 

I'm very confused what to do next in order to get that preliminary test amount of 5121425.461.

Thanks in advance! :)

I am fitting polynomial differential equations to data, and I came across some troubling behavior. I have sets of coordinates in x, y, z, and values w at these coordinates. The x,y,z coordinates and the data at these coordinates are concatenations of three subsets of data each, and depending on the order of the concatenation, I get different polynomials from the stats fit command. The difference is not trivial -- it makes a huge differentce in the stability of the differential equations. I have written a demonstration worksheet to show this problem.

John Starrett

http://en.wikipedia.org/wiki/Hypersurface

http://people.cs.uchicago.edu/~niyogi/papersps/surfacesampling.pdf

hypersurface is a homogenous polynomial

f(x,y) = 0

i do not understand how sampling hypersurface can generate this kind of polynomial

 

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