
From:  Olumide 
Subject:  [Helpgsl] One or Multidimensional Root Finding? 
Date:  Sat, 27 Sep 2008 18:36:02 +0100 
Useragent:  Thunderbird 2.0.0.16 (Windows/20080708) 
Hello,I'm trying to find the point p(x,y,z) on an (nonlinear) implicit surface F(x,y,z) = 0 closest that is nearest to a given initial point q(x,y,z), the problem is that my reading of the docs makes the choice the class of root finding algorithm a bit difficult. According to the manual, multidimensional rootfinding algorithms are for "solving nonlinear systems with n equations in n unknowns", while one dimensional RootFinding algorithms are for "finding roots of arbitrary onedimensional functions". The problem is that I have one equation F(x,y,z) = 0, with whose solution is a tuple or vector or group of 3 numbers p(x,y,z). Which algorithm should I use to solve such a problem? A one dimensional or a multidimensional root solver?
Thanks,  Olumide
[Prev in Thread]  Current Thread  [Next in Thread] 