0.90.0 is released

Dear users,

Today, we released NZMATH 0.90.0. It is the first release of pre-1.0
beta series.


Download
========
You can download it from sourceforge:
http://downloads.sourceforge.net/nzmath/NZMATH-0.90.0.tar.gz
http://downloads.sourceforge.net/nzmath/NZMATH-0.90.0.zip
http://downloads.sourceforge.net/nzmath/NZMATH-0.90.0.win32Install.exe
http://downloads.sourceforge.net/nzmath/NZMATH-test-0.90.0.tar.gz
http://downloads.sourceforge.net/nzmath/NZMATH-test-0.90.0.zip

The files are available also on our university server:
http://tnt.math.metro-u.ac.jp/nzmath/download/NZMATH-0.90.0.tar.gz
http://tnt.math.metro-u.ac.jp/nzmath/download/NZMATH-0.90.0.zip
http://tnt.math.metro-u.ac.jp/nzmath/download/NZMATH-0.90.0.win32Install.exe
http://tnt.math.metro-u.ac.jp/nzmath/download/NZMATH-test-0.90.0.tar.gz
http://tnt.math.metro-u.ac.jp/nzmath/download/NZMATH-test-0.90.0.zip


What's new
==========
The most significant new feature is the algebraic numbers and the
algebraic number fields. You can define algebraic numbers and add
them, multiply them, etc. You can define an algebraic number field and
obtain its integral basis.

From this release, NZMATH requires Python 2.5 (or higher). NZMATH up
to 0.7.0 had required only Python 2.3, but we decided to move to Python
2.5 for its advanced features. The (pre-)1 series will certainly
stay using Python 2.5, as 0 series has stayed using 2.3.

Other news from CHANGES are following.

version 0.7.0 to 0.90.0
-----------------------
* change required Python version to 2.5.
* many changes in matrix.
* add new modules algfield, round2 and squarefree.
* add a new module factor in poly sub-package.
* add a new function map_choice in bigrandom.
* add a new function euler in combinatorial.
* add a method getRing to imaginary.Complex to fix sf bug # 1852828.
* add a new class Real in real.
* add a new method generate to factor.util.FactoringMethod.
* add a new method total_degree to classes in poly.multivar.
* add new methods resultant, discriminant and subresultant_extgcd to poly.uniu
til.SubresultantGcdProvider.
* add a new class IntegerPolynomial in poly.uniutil.
* add a new method resultant to poly.multiutil.UniqueFactorizationDomainPolyno
mial.
* change LLL into a function in lattice.
* fix a few bugs in elliptic including sf bug #1913999.
* fix a few bugs in gcd including sf bug #1924839.
* fix a bug in prime._lucas_test_sequence.
* change inplementation of polynomial.resultant.
* a few minor modifications in rational.


Roadmap
=======

0.91.0
------
In 3 months, maybe finitefield and elliptic will change.

1.0
---
In 2008, some more enhancements will be made in several other modules.

3.0
---
Around 2010(?), migrate to Python 3.
(No concrete plans, now.)


Thank you for using NZMATH. Have fun!