Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Numerical methods to find parameter set with N intersections of 2 implicit functions

  1. Sep 8, 2010 #1
    Sorry for the wordiness of the thread title.

    Basically I'm wondering, if you have two implicit functions, F(x,y)=0 and G(x,y)=0 (typically rational functions with numerator and denominator very high degree polynomials), both dependent upon the same K (in my case > 34) dimensional set of parameters - a for i = 1 to K; are there any established numerical techniques to speed up a search of the parameter space to find a set of parameters for which the 2 curves in the x-y plane (defined by the functions F and G) have a given number of intersections, say N?

  2. jcsd
Share this great discussion with others via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?