Re: [Bug-gsl] [bug #34361] gsl_bspline_knots_greville needs inequality constrained linear least squares

[Brian Gough]

At Mon, 26 Sep 2011 17:41:37 -0500,
Rhys Ulerich wrote:
> The Fortran 77 kernels from Netlib run to about 550 lines.  The
> published algorithm
> from Lawson and Hanson contains the bare bones details but only hints at
> some improvements and defers to their source for full details.  The f2c route
> (along with refactoring and portability fixes) was more straightforward.
> I have reimplemented functionality above those kernels in C using regular GSL
> APIs.

Just wanted to check that the algorithm wouldn't produce degenerate
results - e.g. separated by the epsilon cutoff - before spending time
thinking about how it would be implemented.