[Gmp-commit] /home/hgfiles/gmp-5.0: 2 new changesets

[mercurial at gmplib.org]

details:   /home/hgfiles/gmp-5.0/rev/5626c939178b
changeset: 13437:5626c939178b
user:      Marco Bodrato <bodrato at mail.dm.unipi.it>
date:      Tue Jan 25 17:51:25 2011 +0100
description:
Removed two typos in documentation.

details:   /home/hgfiles/gmp-5.0/rev/3a42b9599311
changeset: 13438:3a42b9599311
user:      Marco Bodrato <bodrato at mail.dm.unipi.it>
date:      Tue Jan 25 18:07:23 2011 +0100
description:
Correct references.

diffstat:

 doc/gmp.texi               |  10 ++++++----
 mpn/generic/matrix22_mul.c |   4 ++--
 2 files changed, 8 insertions(+), 6 deletions(-)

diffs (55 lines):

diff -r a3091e12fad7 -r 3a42b9599311 doc/gmp.texi
--- a/doc/gmp.texi	Thu Nov 11 14:11:09 2010 +0100
+++ b/doc/gmp.texi	Tue Jan 25 18:07:23 2011 +0100
@@ -15,7 +15,8 @@
 arithmetic library, version @value{VERSION}.
 
 Copyright 1991, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
-2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 Free Software Foundation, Inc.
+2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011 Free Software
+Foundation, Inc.
 
 Permission is granted to copy, distribute and/or modify this document under
 the terms of the GNU Free Documentation License, Version 1.3 or any later
@@ -4114,7 +4115,7 @@
 @code{mp_bits_per_limb}.
 
 @item
- at code{mpz_mul}, @code{mpz_mul_ui} and @code{mpz_mul_ui} need room for the sum
+ at code{mpz_mul}, @code{mpz_mul_ui} and @code{mpz_mul_si} need room for the sum
 of the number of bits in their operands, but each rounded up to a multiple of
 @code{mp_bits_per_limb}.
 
@@ -8526,7 +8527,7 @@
 resulting matrix is applied to the inputs using @code{mpn_mul_1} and
 @code{mpn_submul_1}. Each iteration usually reduces the inputs by almost one
 limb. In the rare case of a large quotient, no progress can be made by
-examining just the most significant two limbs, and the quotient is computing
+examining just the most significant two limbs, and the quotient is computed
 using plain division.
 
 The resulting algorithm is asymptotically @math{O(N^2)}, just as the Euclidean
@@ -10471,7 +10472,8 @@
 
 @item
 Niels M@"oller and Torbj@"orn Granlund, ``Improved division by invariant
-integers'', to appear.
+integers'', IEEE Transactions on Computers, 11 June 2010.
+ at uref{http://gmplib.org/~tege/division-paper.pdf}
 
 @item
 Torbj@"orn Granlund and Niels M@"oller, ``Division of integers large and
diff -r a3091e12fad7 -r 3a42b9599311 mpn/generic/matrix22_mul.c
--- a/mpn/generic/matrix22_mul.c	Thu Nov 11 14:11:09 2010 +0100
+++ b/mpn/generic/matrix22_mul.c	Tue Jan 25 18:07:23 2011 +0100
@@ -95,8 +95,8 @@
 
   Note: the two matrices above are the same, but s_i and t_i are used
   in the same product, only for i<4, see "A Strassen-like Matrix
-  Multiplication suited for squaring and highest power computation" by
-  M. Bodrato (2008).
+  Multiplication suited for squaring and higher power computation" by
+  M. Bodrato, in Proceedings of ISSAC 2010.
 
     / r0 \   / 1 0  0  0  0  1  0 \ / s0*t0 \
     | r1 | = | 0 0 -1  1 -1  1  0 | | s1*t1 |