summaryrefslogtreecommitdiff
path: root/gsl-1.9/poly/ChangeLog
diff options
context:
space:
mode:
Diffstat (limited to 'gsl-1.9/poly/ChangeLog')
-rw-r--r--gsl-1.9/poly/ChangeLog72
1 files changed, 72 insertions, 0 deletions
diff --git a/gsl-1.9/poly/ChangeLog b/gsl-1.9/poly/ChangeLog
new file mode 100644
index 0000000..87b227d
--- /dev/null
+++ b/gsl-1.9/poly/ChangeLog
@@ -0,0 +1,72 @@
+2005-07-03 Brian Gough <bjg@network-theory.co.uk>
+
+ * test.c (main): added tests for linear case
+
+ * zsolve_quadratic.c (gsl_poly_complex_solve_quadratic): handle
+ the linear case
+
+ * solve_quadratic.c (gsl_poly_solve_quadratic): handle the linear
+ case
+
+2005-05-19 Brian Gough <bjg@network-theory.co.uk>
+
+ * Makefile.am (noinst_HEADERS): removed norm.c (unused)
+
+Sun Dec 2 22:02:31 2001 Brian Gough <bjg@network-theory.co.uk>
+
+ * dd.c: added divided differences code from Dan, Ho-Jin
+
+Wed Oct 31 18:42:10 2001 Brian Gough <bjg@network-theory.co.uk>
+
+ * qr.c (qr_companion): increased maximum number of iterations from
+ 30 to 60
+
+Thu Jun 28 11:24:51 2001 Brian Gough <bjg@network-theory.co.uk>
+
+ * test.c (main): fixed a subtle bug in the test where the array
+ for the complex results was too small by a factor of two
+
+Mon Apr 30 12:36:08 2001 Brian Gough <bjg@network-theory.co.uk>
+
+ * eval.c (gsl_poly_eval): added eval function from specfunc
+
+Tue Aug 24 12:02:47 1999 Brian Gough <bjg@network-theory.co.uk>
+
+ * zsolve.c: added general solver using QR method
+
+1999-08-22 Mark Galassi <rosalia@lanl.gov>
+
+ * Makefile.am (libgslpoly_a_SOURCES): for now commented out
+ zsolve.c, since it has some strange errors that make it look like
+ it was not committed.
+
+Tue Aug 17 14:23:47 1999 Brian Gough <bjg@network-theory.co.uk>
+
+ * zsolve_cubic.c (gsl_poly_complex_solve_cubic): compute the
+ discriminant without division so that it is exact for exact inputs
+
+ * solve_cubic.c (gsl_poly_solve_cubic): compute the discriminant
+ without division so that it is exact for exact inputs
+
+ * changed the way roots are counted to make all the routines
+ consistent. Conincident roots are no longer a special case, now
+ they are made up of separate roots which happen to have the same
+ values.
+
+ * zsolve_quadratic.c (gsl_poly_complex_solve_quadratic): in the
+ case of a multiple root set all the returned values r0 = r1 =
+ root, rather than just setting one and leaving the others
+ potentially unset.
+
+ * solve_quadratic.c (gsl_poly_solve_quadratic): ditto
+
+Tue Aug 3 19:36:26 1999 Brian Gough <bjg@network-theory.co.uk>
+
+ * gsl_poly.h: changed all functions to take separate variables for
+ roots (z0, z1, z2) of variable-length arrays
+
+Sat Feb 20 12:13:46 1999 Brian Gough <bjg@netsci.freeserve.co.uk>
+
+ * split out polynomial root finding algorithms into a new poly/
+ directory
+