Search Results

Search found 89 results on 4 pages for 'polynomial'.

Page 1/4 | 1 2 3 4  | Next Page >

• Polynomial division overloading operator

  - by Vlad

  Ok. here's the operations i successfully code so far thank's to your help: Adittion: polinom operator+(const polinom& P) const { polinom Result; constIter i = poly.begin(), j = P.poly.begin(); while (i != poly.end() && j != P.poly.end()) { //logic while both iterators are valid if (i->pow > j->pow) {…

  Read the article

• Why isn't my operator overloading working properly?

  - by Mithrax

  I have the following Polynomial class I'm working on: #include <iostream> using namespace std; class Polynomial { //define private member functions private: int coef[100]; // array of coefficients // coef[0] would hold all coefficients of x^0 // coef[1] would hold all x^1 // coef[n] = x^n ... int deg; // degree of…

  Read the article

• Small-o(n^2) implementation of Polynomial Multiplication

  - by AlanTuring

  I'm having a little trouble with this problem that is listed at the back of my book, i'm currently in the middle of test prep but i can't seem to locate anything regarding this in the book. Anyone got an idea? A real polynomial of degree n is a function of the form f(x)=a(n)x^n+?+a1x+a0, where an,…,a1,a0 are real numbers. In computational…

  Read the article

• Algorithm for computing the inverse of a polynomial

  - by Neville

  I'm looking for an algorithm (or code) to help me compute the inverse a polynomial, I need it for implementing NTRUEncrypt. An algorithm that is easily understandable is what I prefer, there are pseudo-codes for doing this, but they are confusing and difficult to implement, furthermore I can not really understand the procedure from…

  Read the article

• NTRU Pseudo-code for computing Polynomial Inverses

  - by Neville

  Hello all. I was wondering if anyone could tell me how to implement line 45 of the following pseudo-code. Require: the polynomial to invert a(x), N, and q. 1: k = 0 2: b = 1 3: c = 0 4: f = a 5: g = 0 {Steps 5-7 set g(x) = x^N - 1.} 6: g[0] = -1 7: g[N] = 1 8: loop 9: while f[0] = 0 do 10: for i = 1 to N do 11: …

  Read the article

• Polynomial.Net

  Polynomial Class Library - An easy way to working with polynomials

  Read the article

• Polynomial division overloading operator (solved)

  - by Vlad

  Ok. here's the operations i successfully code so far thank's to your help: Adittion: polinom operator+(const polinom& P) const { polinom Result; constIter i = poly.begin(), j = P.poly.begin(); while (i != poly.end() && j != P.poly.end()) { //logic while both iterators are valid if (i->pow…

  Read the article

• Polynomial operations using operator overloading

  - by Vlad

  I'm trying to use operator overloading to define the basic operations (+,-,*,/) for my polynomial class but when i run the program it crashes and my computer frozes. Update3 Ok i successfully done the first two operations(+,-). Now at multiplication, after multiplying each term of the first polynomial with each of the second i…

  Read the article

• polynomial surface fit numpy

  - by user288558

  I have had that problem before and I couldn't solve it how do I fit a 2d surface z=f(x,y) with a polynomial in numpy (full crossterms). Thanks in advance, Wolfgang

  Read the article

• Good Package for Fitting Polynomial Trend Lines

  - by Rev316

  Given a simple data set, I would like to be able to calculate a trending formula given it's a second order polynomial regression. In fact, it would be great if one could even forecast X periods during calculation (similar to what Excel does). I'm looking for a portable C/C++ package that's relatively easy to use, and allows it…

  Read the article

• polynomial projection

  - by padmapriya

  how to project polynomial wih binary value example,if the polynomialis p(x)=c4x^4+c3x^3+c2x^2+c1x+c0 and x=111111111 then what will be the p(x).

  Read the article

• Java Polynomial Multiplication with ArrayList

  - by user1506919

  I am having a problem with one of my methods in my program. The method is designed to take 2 arraylists and the perform multiplication between the two like a polynomial. For example, if I was to say list1={3,2,1} and list2={5,6,7}; I am trying to get a return value of 15,28,38,20,7. However, all I can get is an error message…

  Read the article

• Java and junit: derivative of polynomial method testing issue

  - by Curtis

  Hello all, im trying to finish up my junit testing for finding the derivative of a polynomial method and im having some trouble making it work. here is the method: public Polynomial derivative() { MyDouble a = new MyDouble(0); MyDouble b = this.a.add(this.a); MyDouble c = this.b; Polynomial poly = new Polynomial…

  Read the article

• polynomial multiplication using fastfourier transform

  - by mawia

  i am going through the above topic from CLRS(CORMEN) (page 834) and I got stuck at this point. Can anybody please explain how the following expression, A(x)=A^{[0]}(x^2) +xA^{[1]}(x^2) follows from, n-1 ` S a_j x^j j=0 Where, A^{[0]} = a_0 + a_2x + a_4a^x ... a_{n-2}x^{\frac{n}{2-1}} A^{[1]} =…

  Read the article

• Python fit polynomial, power law and exponential from data

  - by Nadir

  I have some data (x and y coordinates) coming from a study and I have to plot them and to find the best curve that fits data. My curves are: polynomial up to 6th degree; power law; and exponential. I am able to find the best fit for polynomial with while(i < 6): coefs, val = poly.polyfit(x, y, i, full=True) …

  Read the article

• Octave / Matlab: How to plot the roots of a polynomial

  - by Tom

  Hi everyone, Im trying to plot the roots of a polynomial, and i just cant get it. First i create my polynomial p5 = [1 0 0 0 0 -1] %x^5 - 1 r5 = roots(p5) stem (p5) Im using the stem function, but I would like to remove the stems, and just get the circle around the roots. Is this possible, is stem the right command? …

  Read the article

• Orcad / Matlab: How to plot the roots of a polynomial

  - by Tom

  Hi everyone, Im trying to plot the roots of a polynomial, and i just cant get it. First i create my polynomial p5 = [1 0 0 0 0 -1] %x^5 - 1 r5 = roots(p5) stem (p5) Im using the stem function, but I would like to remove the stems, and just get the circle around the roots. Is this possible, is stem the right command? …

  Read the article

• Define polynomial function

  - by user1822707

  How can I define a function - say, def polyToString(poly) - to return a string containing the polynomial poly in standard form? For example: the polynomial represented by [-1, 2, -3, 4, -5] would be returned as: "-5x**4 + 4x**3 -3x**2 + 2x**1 - 1x**0" def polyToString(poly): standard_form='' n=len(poly) - 1 …

  Read the article

• efficiently determining if a polynomial has a root in the interval [0,T]

  - by user168715

  I have polynomials of nontrivial degree (4+) and need to robustly and efficiently determine whether or not they have a root in the interval [0,T]. The precise location or number of roots don't concern me, I just need to know if there is at least one. Right now I'm using interval arithmetic as a quick check to see if I can…

  Read the article

• Traveling Salesman in polynomial time

  - by Andres

  Problem Description: Write a program in any language with the shortest number of characters that solves the following problem: Given a collection of cities and the cost of travel between each pair of them, find the cheapest way of visiting all of the cities and returning to your starting point. All solutions must take at…

  Read the article

• Create a polynomial object from a number using change-class

  - by charlieb

  I have written a polynomial class along the lines described in SICP 2.5.3 (except using defclass). I would like to be able to seamlessly add and multiply polynomials and regular numbers but I can't make change-class accept a number. I tried to simplify the problem by changing class from an integer to a float: …

  Read the article

• Modular Reduction of Polynomials in NTRUEncrypt

  - by Neville

  Hello everyone. I'm implementing the NTRUEncrypt algorithm, according to an NTRU tutorial, a polynomial f has an inverse g such that f*g=1 mod x, basically the polynomial multiplied by its inverse reduced modulo x gives 1. I get the concept but in an example they provide, a polynomial f = -1 + X + X^2 - X4 +…

  Read the article

• Resultant of a polynomial with x^n–1

  - by devin.omalley

  Resultant of a polynomial with x^n–1 (mod p) I am implementing the NTRUSign algorithm as described in http://grouper.ieee.org/groups/1363/lattPK/submissions/EESS1v2.pdf , section 2.2.7.1 which involves computing the resultant of a polynomial. I keep getting a zero vector for the resultant which is obviously…

  Read the article

• Extracting the fitted terms in the local polynomial of a loess (in R)

  - by Tal Galili

  Hi all, How can I extract what the loess function has fitted for the polynomial function, for a particular x of my data? Thanks, Tal

  Read the article

• how can i calculate the polynomial that has the following asymptotes

  - by joshs

  how can i calculate the polynomial that has the asymptotes (1) y = x where x = 1, and (2) y = 1 where x = 365 I realize this may not be the proper forum but I figured somebody here could answer this in jiffy. Also, I am not looking for an algorithm to answer this. I'd just like like to see the process. …

  Read the article

1 2 3 4  | Next Page >