i want to add the polynomials with the coeff getA(),getB() and getC() with the +ve or -ve signs. and remove the terms with zero coff like 2x^2+5 not 2x^2+0x+5 in general like (+/-)ax^2(+/-)bx(+/-)c.
I want to开发者_开发技巧 compare two MyDouble values with zero. if(getA()>(MyDouble.zero)) //where getA() is MyDouble
Am trying to generate the value of a 10 order polynomial with 11 coefficients. Am also trying to generate its derivative. i have written a three functions shown below.
I need to make a recursive method Polynomial add(Polynomial p) that add this to p using recursion. I read that java has the add(Polynomial p) method, but that\'s not recursive.
I\'m writing a Raytracer in C, and to draw a sphere I\'m using the Cartesian equation: x^2 + y^2 + z^2 = R^2.
I have been trying to figure tis ou for 3 days and have not gotten anywhere. I have to implement polynomial multiplication (multiply 2 quadratic equations). They look like:
Which of the following is the most precise classification of a problem X? X is in NP X is in P X is in O(n2)
Given a cubic polynomial estimated using least-squares regression, I am interested 开发者_运维技巧in a simple algorithm that rasterizes the curve to display in an image. My initial intuition is to sam
I\'m looking for a non-iterative function that finds the real roots开发者_开发百科 of cubic polynomials. So, an implementation of something like this.
lets say i have an expression: (n)+((n-1)*2)+((n-2)*3)+((n-3)*4)+...+(3*(n-2))+(2*(n-1))+(1*(n)) what is 开发者_StackOverflow社区the tight bound of this? or the upper bound? is this n^3? is this n^
加载中,请稍侯......