1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
|
== 3.2.1 == 12/06/2020
- Released to fix some missing headers with interfaces for
the new functions in 3.2.0.
== 3.2.0 == 11/06/2020
- Added an interface to retrieve the current MPSolve version.
- Fixed a few bugs concerning precision handling in floating point
arithmetic.
- Improved implementation of the refinement strategy.
== 3.1.8 == 23/10/2019
- Fixed a bug in handling the floating point input with high precision.
== 3.1.7 == 25/02/2019
- Fixed a few bugs around the Python interface (thanks @DavidToneian and @kagalengo-m-b).
- Several fixes to the parser on corner cases.
- Minor fixes to the MATLAB interface.
== 3.1.6 ==
- Minor fixes
== 3.1.5 == 08/04/2017
- Added a mps_parse_string routine.
- Lot of fixes and redesign on xmpsolve.
- Various bug fixes inside MPSolve.
== 3.1.4 == 19/10/2013
- Fixed a lot of bugs in the parser.
- Improved support to Chebyshev polynomials.
- Added a python interface to MPSolve.
- Installation the Octave module as a package.
== 3.1.3 == 29/03/2013
- Rewritten from scratch the improvement engine, in a way more suitable
to be parallelized. This solve problems present in 3.1.2 and 3.1.1.
- Adjustment to documentation and the build system.
== 3.1.2 ==
- Various other fixes to the build system
- Review of the improvement routine
== 3.1.1 == 21/03/2013
- Fixes to the build system, to make sure that builds of some modules
are not tried if the libraries on the systems are too old.
== 3.1.0 == 20/03/2013
- Reworked the system of dealing with user polynomial, that is now
a lot more flexible.
- Introduction of an initial Aberth floating point packet in the algorithm
MPS_ALGORITHM_SECULAR_GA that gives performance boosts on easy polynomials.
- Reworked the regeneration of secular equations to be more performant.
- Various consintency fixes
- Introduced Jacobi-style iterations of Aberth, and allow the user to select
the desired one at runtime
- Small API changes to retrieve the results of a computation.
- Reworked improve routine that is more performant than the old one.
- Added a graphical debugger for the iterations.
- Added a graphical user interface for MPSolve, called xmpsolve.
- Added support for polynomials represented in the Chebyshev base.
- All the polynomial types (event secular equations) are now multithread, except
the Chebyshev polynomials.
- Modified the Octave module to be compilable under more architectures.
- Reworked the headers to make MPSolve usable directly from C++.
== 3.0.1 == 19/02/2013
- Fixed some bugs in unisolve that caused early exists
without full approximation of some roots.
- Correction in the Octave module to ease compilation
on all targets.
- Corrected a bug in the floating point shift
- Slight optimizations on algorithm MPS_ALGORITHM_SECULAR_GA.
- Corrections in the Matlab (TM) module.
== 3.0.0 == 03/12/2012
- First open source release of MPSolve
- Implemented the secular solver as an alternative to the classical one
- Support for solving secular equations
- Parallelization of most of the parts of the algorithm
|
