Re: Algorithm for distance from point to function
- From: harper@xxxxxxxxxxxxx (John Harper)
- Date: 17 Jul 2006 10:10:12 +1200
In article <qtfjb25k3ea0cvq344c9heq5lamcvq50dd@xxxxxxx>,
Mike.Prager <mike.prager¿@noaa.gov> wrote:
Terry wrote:
The minimum distance is the length of the shortest line from the point
x1y1 to a tangent to the line y=f(x).
Thanks to all who posted hints. We had indeed been planning
to use an optimization in finding the shortest distance. The
function to which we are finding distance is monotonic, and I
think that will simplify things a bit. It may even be
possible that we can use the derivative of the distance --
we'll have to examine that closely.
If you only use derivatives you'll miss any maxima/minima that are
either at end-points of the curve or at points where f(x) is not
differentiable, which can of course happen even if f is monotonic.
-- John Harper, School of Mathematics, Statistics and Computer Science,
Victoria University, PO Box 600, Wellington 6140, New Zealand
e-mail john.harper@xxxxxxxxx phone (+64)(4)463 5341 fax (+64)(4)463 5045
.
- Follow-Ups:
- Re: Algorithm for distance from point to function
- From: Michael Prager
- Re: Algorithm for distance from point to function
- References:
- Algorithm for distance from point to function
- From: Mike . Prager
- Re: Algorithm for distance from point to function
- From: glen herrmannsfeldt
- Re: Algorithm for distance from point to function
- From: Terry
- Re: Algorithm for distance from point to function
- From: Mike . Prager
- Algorithm for distance from point to function
- Prev by Date: Re: I/O reading formated files
- Next by Date: Re: recl on g95 and gfortran
- Previous by thread: Re: Algorithm for distance from point to function
- Next by thread: Re: Algorithm for distance from point to function
- Index(es):
Relevant Pages
|