Results 1 to 3 of 3
  1. #1
    gberg927 is offline Member
    Join Date
    Apr 2011
    Posts
    1
    Rep Power
    0

    Default Intersection of 2 Polynomials Algorithm

    I have a problem where I want to find where 2 1 dimension polynomials intersect.

    Any ideas on a good algorithm to perform this task?

    Thanks,

  2. #2
    ozzyman's Avatar
    ozzyman is offline Senior Member
    Join Date
    Mar 2011
    Location
    London, UK
    Posts
    797
    Blog Entries
    2
    Rep Power
    6

    Default

    More of a question for a maths forum I think! When you get an algorithm but can't write it in java then you should write it here

  3. #3
    JosAH's Avatar
    JosAH is offline Moderator
    Join Date
    Sep 2008
    Location
    Voorschoten, the Netherlands
    Posts
    14,315
    Blog Entries
    7
    Rep Power
    25

    Default

    Quote Originally Posted by gberg927 View Post
    I have a problem where I want to find where 2 1 dimension polynomials intersect.

    Any ideas on a good algorithm to perform this task?

    Thanks,
    A Newton/Raphson on bisection method for P1(x)-P2(x) == 0 where P1 and P2 are the polynomials?

    kind regards,

    Jos
    The only person who got everything done by Friday was Robinson Crusoe.

Similar Threads

  1. orthogonal polynomials
    By yemsy in forum Threads and Synchronization
    Replies: 1
    Last Post: 02-17-2011, 11:40 AM
  2. Volume of Intersection
    By afifi in forum Advanced Java
    Replies: 0
    Last Post: 01-07-2011, 11:42 AM
  3. gcd of two polynomials
    By mcherkao in forum Advanced Java
    Replies: 1
    Last Post: 09-24-2010, 11:51 PM
  4. Polynomials Arithmetic
    By thisisIT in forum New To Java
    Replies: 3
    Last Post: 03-09-2010, 02:27 PM
  5. Rectangle Intersection
    By Gwindow in forum Java 2D
    Replies: 1
    Last Post: 04-24-2008, 03:53 PM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •