[GiNaC-devel] [SCM] GiNaC -- a C++ library for symbolic computations branch, master, updated. release_1-4-0-174-gb9dc3d7

[Jens Vollinga]

This is an automated email from the git hooks/post-receive script. It was
generated because a ref change was pushed to the repository containing
the project "GiNaC -- a C++ library for symbolic computations".

The branch, master has been updated
       via  b9dc3d71083fe1a2f90a34db24b57b06ad51ebde (commit)
       via  45b1e47372090352ac5af655b32473df2abab23b (commit)
       via  3f0b0165865bbb297901e9542fced88a0e32298e (commit)
       via  e79c1f6f914b7be886a19c8d7cdd3603405cda2a (commit)
      from  38f3143eee71d942f40ab47f5a561dc9736203fc (commit)

Those revisions listed above that are new to this repository have
not appeared on any other notification email; so we list those
revisions in full, below.

- Log -----------------------------------------------------------------
commit b9dc3d71083fe1a2f90a34db24b57b06ad51ebde
Author: Jens Vollinga <jensv at balin.nikhef.nl>
Date:   Tue Feb 3 13:50:33 2009 +0100

    Fixed compile errors introduced in previous commit
    45b1e47372090352ac5af655b32473df2abab23b.

commit 45b1e47372090352ac5af655b32473df2abab23b
Author: Alexei Sheplyakov <varg at metalica.kh.ua>
Date:   Mon Jan 19 08:45:38 2009 +0200

    Implement modular multivariate GCD (based on chinese remaindering algorithm).
    
    Both algorithm and implementation are a bit inefficient:
    
    * algorithm does not make use of sparseness of inputs (and most of
      multivariate polynomials are quite sparse)
    * GiNaC's expressions are essentially immutable. Thus some simple
      operations (i.e. multiplying a polynomial by an element of the base ring)
      are prohibitively expensive.
    * All numbers (i.e. GiNaC::numeric objects) are heap allocated.
    
    Still it's much faster (~5x on bivariate polynomials, ~100x on 3-variate
    ones) than (subresultant) PRS algorithm, so gcd() uses modular algorithm
    by default.

commit 3f0b0165865bbb297901e9542fced88a0e32298e
Author: Alexei Sheplyakov <varg at metalica.kh.ua>
Date:   Mon Jan 19 08:44:36 2009 +0200

    Improve (fix?) smod: now it really converts into symmetric representation...
    
    ... instead of clumsy convention inspirited by some proprietary CAS.

commit e79c1f6f914b7be886a19c8d7cdd3603405cda2a
Author: Alexei Sheplyakov <varg at metalica.kh.ua>
Date:   Mon Jan 19 08:43:50 2009 +0200

    Fix copy-paste error in GINACLIB_MICRO_VERSION.

-----------------------------------------------------------------------

Summary of changes:
 configure.ac                             |    2 +-
 doc/tutorial/ginac.texi                  |    2 +-
 ginac/Makefile.am                        |   18 +++
 ginac/normal.cpp                         |   10 ++-
 ginac/normal.h                           |   17 +++-
 ginac/numeric.cpp                        |   19 ++--
 ginac/polynomial/chinrem_gcd.cpp         |   14 +++
 ginac/polynomial/chinrem_gcd.h           |   19 ++++
 ginac/polynomial/collect_vargs.cpp       |  167 ++++++++++++++++++++++++++++++
 ginac/polynomial/collect_vargs.h         |   34 ++++++
 ginac/polynomial/debug.hpp               |    1 +
 ginac/polynomial/divide_in_z_p.cpp       |   90 ++++++++++++++++
 ginac/polynomial/divide_in_z_p.h         |   27 +++++
 ginac/polynomial/euclid_gcd_wrap.h       |   60 +++++++++++
 ginac/polynomial/eval_point_finder.h     |   51 +++++++++
 ginac/polynomial/mgcd.cpp                |   97 +++++++++++++++++
 ginac/polynomial/newton_interpolate.h    |   36 +++++++
 ginac/polynomial/optimal_vars_finder.cpp |  134 ++++++++++++++++++++++++
 ginac/polynomial/optimal_vars_finder.h   |   20 ++++
 ginac/polynomial/pgcd.cpp                |  136 ++++++++++++++++++++++++
 ginac/polynomial/pgcd.h                  |   27 +++++
 ginac/polynomial/poly_cra.h              |   38 +++++++
 ginac/polynomial/primes_factory.h        |   60 +++++++++++
 ginac/polynomial/primpart_content.cpp    |   78 ++++++++++++++
 ginac/polynomial/smod_helpers.h          |   72 +++++++++++++
 25 files changed, 1215 insertions(+), 14 deletions(-)
 create mode 100644 ginac/polynomial/chinrem_gcd.cpp
 create mode 100644 ginac/polynomial/chinrem_gcd.h
 create mode 100644 ginac/polynomial/collect_vargs.cpp
 create mode 100644 ginac/polynomial/collect_vargs.h
 create mode 100644 ginac/polynomial/divide_in_z_p.cpp
 create mode 100644 ginac/polynomial/divide_in_z_p.h
 create mode 100644 ginac/polynomial/euclid_gcd_wrap.h
 create mode 100644 ginac/polynomial/eval_point_finder.h
 create mode 100644 ginac/polynomial/mgcd.cpp
 create mode 100644 ginac/polynomial/newton_interpolate.h
 create mode 100644 ginac/polynomial/optimal_vars_finder.cpp
 create mode 100644 ginac/polynomial/optimal_vars_finder.h
 create mode 100644 ginac/polynomial/pgcd.cpp
 create mode 100644 ginac/polynomial/pgcd.h
 create mode 100644 ginac/polynomial/poly_cra.h
 create mode 100644 ginac/polynomial/primes_factory.h
 create mode 100644 ginac/polynomial/primpart_content.cpp
 create mode 100644 ginac/polynomial/smod_helpers.h


hooks/post-receive
--
GiNaC -- a C++ library for symbolic computations