in

.NET Opensource

Community for opensource projects by Christoph Rüegg

Polynomial intersection and solving Quadratic

Last post 04-01-2009 14:17 by Christoph Rüegg. 1 replies.
Page 1 of 1 (2 items)
Sort Posts: Previous Next
  • 03-27-2009 16:26

    Polynomial intersection and solving Quadratic

    I have been using Math.net library in a heavily math intensive application.  A lot of the application involves solving for values on a second order polynomial.  I have 2 questions..

    Does Math.net have facilities to solve a quadratic.  I have a polynomial and I'm able to solve for Y when given X, but I need to also get the roots of x when given Y.  I've got self written code to do this currently, but I'd much prefer to use the library's implimentaion if it has one.

    Does Math.net have the ability find intersection of 2 polynomials.  Again I have the code that I've written to do this already, but if the library has the feature I'd much rather use that.

     Thanks

     

  • 04-01-2009 14:17 In reply to

    Re: Polynomial intersection and solving Quadratic

    Interesting that you should ask that, since I was actually working on root finding algorithms, including the quadratic case explicitely.

    Since this is one of those classic cases where there exists a well known explicit school book formula, but which is unfortunately numerically not the most robust one, there will be an explicit algorithm available in one of the next releases.

    Of course it would also be interesting to compare my approach with yours, so we end up with the better algorithm in the end.

Page 1 of 1 (2 items)
Powered by Community Server (Non-Commercial Edition), by Telligent Systems