how i can solve equations and gain{p1,p2,q1,q2}?

thanks

solve.mw

Error, (in PolynomialSystemSolvers:-PseudoResultant) numeric exception: division by zero

Warning, computation interrupted

Download solve.mw

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:

Download Polynomial_Mod_2.mw

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!

Regards.

For solving polynomial systems I used RootFinding[Isolate]. But after discussing the question http://www.mapleprimes.com/questions/211774-Roots-Of--Expz--1I decided to compare Isolate and evalf(solve ([...], [...])). It seemed to me that solve some convenient. The only if in the equation there are integers as a real, they should be recorded with a decimal point. (For real solutions of this procedure should be used with (RealDomain).) Examples:

SOLVE_ISOLATE.mw I wonder why then the need Root Finding [Isolate]?

Dear all

I need a help to compute the integral from -1 to 1 of product of derivative of legendre polynomial

> restart;> with(orthopoly);P(n, x); # Designe the legendre polynomial of degree n I would like to compute

int(diff(P(n,x),x)*diff(P(m,x),x),x=-1..1) ;

In this previous formula when I put n=2 and m=3 I can get the result but in general case i cannot,

Many thanks

Hello,

Calculated a Grobasis basis. Used the 19 of the 29 equations to produce a Sylvester type matrix to get a univarite polynomial. The problem I am having is I can't produce a consistant matrix. I think the problem may lie in how I sort the equations. I have used this method once before and it worked to produce the result then. Run the worksheet and the run it again and most likely a different outcome occurs. I copy and pasted the polynmial list to make this worksheet. The coefficients are very long. Have annotated the worksheet to help explain.

Download Test_Equations_Matrix_Groebner.mw

I have a system of 16 polynomial equations in 15 variables. Independently I know there is at least a one parameter familiy of solutions to this system, so there is reason to think at least two of the equations are redundent. I would like to use Maple to decipher which of the equations are redundent, but I am unsure how to proceed.

So far I have looked at the Groebner package, and it seems like the Reduce and InterReduce commands will be useful. Say I call the set of 16 polynomials X and define a lexicographical order T on the variables. I then ask maple to compute

Reduce(X,X,T)

and receive a list with 7 zeroes and 9 polynomials. What exactly is this telling me? Does this mean that maple has used polynomial division and found that 7 of the equations are redundent?

Thanks for your help!

I have two polynomials f(x,y,z) and g(x,y,z) and ask MAPLE to find conditions on the coefficients of f and g such that the Jacobian determinant in x and y is purely a polynomial in z. MAPLE finds 4 solutions, one of which is g=0, but does not find the solution f=0. I attach the relevant MAPLE worksheet.

hi.

how i can select or chose proper polynomials or another functions that attached boundary conditions at points zero and one , weakly or strongly satisfy??polynomial.mw

Download polynomial.mw

thanks...

I have a polynomial with parameter. I hope to solve the equation that every coefficient of the polynomial is zero.

For example

f(t):=(a+b+1)t+(a-b-1)

then I use the function solve(f(t),{a,b}),

I hope to get the solution to a+b+1=0 and a-b-1=0. However the output of Maple is {a = -(b*t-b+t-1)/(t+1), b = b}. How could regard t as a variable?

Thank you very much.

Hey guys,

I want to fit experimental data and I was wondering if there is a special PolynomialFit function for a surface.

My data consist of a X,Y, Matrix of densities and I want to have a function describing the surface of the values. On matlab the following code will do so:

[x, y, z] = prepareSurfaceData(temps, concs, densities);ft = fittype('poly33');fitresult = fit([x, y], z, ft);

Maybe that gives you a better view of what I want.

Best regards

Let us consider the maximum value of the polynomial

x^4+c*x^2+x^3+d*x-c-1

on the interval x=-1..1 as a function g of the parameters c and d. General considerations suggest its continuity. However, a plot3d of g does not confirm it. Also the question arises "Is the function g(c,d) bounded from below?". Here is my try with the DirectSearch and NLPSolve:

DirectSearch:-GlobalOptima( (a, b) -> g(a, b), variables = [a, b])

Error, (in Optimization:-NLPSolve) invalid input: PolynomialTools:-CoefficientVector expects its 1st argument, poly, to be of type polynom(anything, x), but received HFloat(HFloat(undefined))*x^4+HFloat(HFloat(undefined))*x^3+HFloat(HFloat(undefined))*x^2+HFloat(HFloat(undefined))*x+HFloat(HFloat(undefined))

Download bound.mw

How can i find the critical points of any cubic polynomial in maple17? I want a general procedure

Assume we have a map f from a polynomial ring R to another polynomial ring S, I know how to compute kernel (a generator for the kernel ideal) of these maps by Singular, but I want to know can I do it with Maple too? Thanks.

An example;

Consider the homomorphism f:k[x,y]-->k[u,v] sending x to v and y to v^2 then using Singular;

ring r1=0,(x,y),lp;

ring r2=0,(u,v),lp;

ideal i=v,v2;

map f=r1,i;

setring r1;

kernel(r2,f);

_[1]=x2-y

So at above I took k a field of characteristic zero. The kernel is the ideal generated by x^2-y.

from determinant's polynomial?

What is the easiest way to ask roots of a polynomial on a finite field. For example asking roots of x^2+xy+y on GF(8)? I was thinking to run a two for on members of GF(8) and ask to check it but I couldn't do it using Galois package or maybe I couldn't use that package. Thanks for any help.

You must be logged into your Facebook account in order to share via Facebook.

Click the button below to share this on Google+. A new window will open.

You must be logged in to your Twitter account in order to share. Click the button below to login (a new window will open.)

Please log-in to your MaplePrimes account.

Wrong Email/Password. Please try again.

Error occurred during PDF generation. Please refresh the page and try again