Debian Codegraph @

doc/TODO

raw
1 List of things to be resolved or accomplished:
2
3 issues to consider:
4
5 - implement Berlekamp-Zassenhaus for modular factorization
6
7 - implement Musers multivariate factorization, evtl. with sparse Hensel lifting
8
9 - implement real roots with other methods, e.g. after Uspensky or Rolle
10
11 - implement complex roots with other methods, e.g. after Collins and Krandick
12
13 - implement involutive bases computation
14
15 - implement univariate power series composition and power
16
17 - setup unit tests for JRuby and Jython methods and examples
18
19 - make polynomial chinese remainder generic (?)
20
21 - check / test caching results of gcd computation
22
23 - algebraic number theory
24
25 - algebraic topology
26
27 - group theory, permutation groups
28
29 - use further util.concurrent algorithms where possible, e.g. in DHT
30
31 - remove unnecessary @see since JavaDoc 7
32
33 - implement matrices to vector
34
35 - refactor from BasicLinAlg to GenMatrix and GenVector
36
37 - implement Boolean with RingElem interface (?)
38
39 - refactor method names for groovy operator overloading, make examples for usage
40
41
42
43 partially resolved and completed issues:
44
45 - rework parallel GB algorithms
46
47 - rework distributed parallel GB algorithms
48
49 - parallel modular algorithms
50
51 - check solvable polynomials with integral domain coefficients
52
53 - implement quaternion integers for non-commutative coefficients
54
55 - implement other term orders for multivariate power series
56
57 - implement multivariate Hensel lifting for multivariate polynomial factorization
58
59 - implement 0-dim ideal complex root selection
60
61 - implement absolute polynomial factorization
62
63 - implement univaiate and multivariate polynomial factorization
64
65 - implement signature based GB computation, only iterative done
66
67 - implement Word ideal intersection, if possible
68
69 - provide all Jython examples also for JRuby
70
71 - provide a Sage Python like interface in Jython
72
73 - implement parallel proxys for GB computation
74
75 - refactor BigDecimal to RingElem and RingFactory, precision is now variable via context
76
77 - check the 693 exceptions (including 473 runtime exceptions) that are thrown,
78 reduce number of runtime exceptions
79
80 - check for safe publication in constructors, check wrt. the (new) Java memory model
81
82 - check and fix Findbugs warnings
83
84 - make use of gcd in pseudo reduction, needs other coefficient type
85
86 - add product category to applications
87
88 - implement direct products of ring elements
89
90 - define FieldElem and Field factory interfaces and use them for GB coefficients
91
92 - check correct term order in recursive algorithms,
93 in GCD ModEval only univariate cases are used, so term order is not a problem
94 in polynomial factorization we force / convert to invlex term order
95
96 - add assertions to check for number of polynomial variables and term order,
97 nvar in GenPolynomial and GenSolvablePolynomial, done
98
99 - use record classes and lambda expressions
100
101 - make final variables public (?)
102
103 - make hashCode to reuse computed value --> not immutable
104
105 - add method bitLength() to Element
106
107 - implement IDEALDIV2 with extGB
108
109 - use Maven/Gradle/Buildr configuration management, Ivy done
110
111 - make QuotSolvablePolynomial(Ring), LocalSolvablePolynomial(Ring)
112 and ResidueSolvablePolynomial(Ring) unsused, except self tests.
113 Only use QLRSolvablePolynomial(Ring) instead done
114
115 - rework SPIN model checking with TLA+ parallel model checker
116 https://en.wikipedia.org/wiki/TLA%2B
117 https://lamport.azurewebsites.net/tla/tla.html
118
119
120 resolved and completed issues:
121
122 - implement TOP term orders for module Gröbner bases, done for some combinations
123
124 - implement FGLM GB algorithm, done
125
126 - implement Groebner Walk GB computation, done
127
128 - implement squarefree decomposition over fields of characteristic p
129
130 - implement AlgebraicNumber primitive element computation, done
131
132 - design factories for (solvable) Gröbner bases, GCD computation,
133 squarefree decomposition, factorization, extension fields
134
135 - check inseparable field extension, done
136
137 - implement prime and primary ideal decomposition for non-zero-dimensional ideals, done
138
139 - implement prime and primary ideal decomposition for zero-dimensional ideals, done
140
141 - implement multivariate power series, done
142
143 - implement univariate power series, done
144
145 - implement d- and e-reductions and d-/e-Groebner bases, done
146
147 - implement Groebner bases for regular rings, done
148
149 - implement comprehensive GB, done
150
151 - refactor package structure to reduce circular dependences, done
152
153 - implement term order optimization from MAS, also for coefficients
154 and solvable polynomials, done
155
156 - implement complex roots, done
157
158 - implement construction of univariate polynomials in zero-dimensional ideals
159 done
160
161 - implement RealAlgebraicNumber and RealAlgebraicNumberRing, done
162
163 - implement real roots with Sturm sequence, done
164
165 - implement multivariate polynomial greatest common divisors, done
166
167 - design and implement free non-commuative polynomials GenWordPolynomial, done
168
169 - implement Mora's standard base algorithm for GenWordPolynomial
170
171 - add methods to GenPolynomialRing to construct x_i polynomials, done
172
173 - refactor univPoly in solvable implementations, done
174
175 - develop modifiable polynomial constructor or put method and iterators
176
177 - refactor unit tests to a different source code tree to avoid circular dependencies
178
179 - provide scripting interfaces for JAS, done
180
181 - rework junit tests to stop failing in case of zero polynomials
182
183 - using git to publish the repository, done
184
185 - rename divideAndRemainder to quotientRemainder
186
187 - refactor the Quotient class to edu.jas.ufd package, done
188
189 - implement ModLong for faster modular arithmetic, done
190
191 - implement a global variable name generator in edu.jas.kern
192 and use it in extend() and contract()
193 done in GenPolynomialRing,
194 undone in 2020 to avoid memory waste
195
196 - add missing comments in edu.jas.Algebra*, done
197
198 - let inverse() throw a runtime exception, done; throw a checked exception (?, no)
199
200 - refactor Power with Java 8 features, use lambdas and default implementations, done
201
202 - let arith implementations extend Power as abstract class
203 add divide, subtract, abs, remainder to Power,
204 name e.g RingElemAbstract
205 clean structure of compareTo, signum and equals
206 - is not possible -> but in Java 8 with default implentations, see next
207
208 - define power(n) in MonoidElem with default implementation in
209 edu.jas.structure.Power class, done
210
211 - split ModInteger to ModIntegerRing factory, done
212
213 - make logger variables also final, done
214
215 - rename getval() to getVal() in ExpVector, done
216
217 - refactor ExpVector for different array element types, done
218
219 - incorporate gcd() in the Quotient class in edu.jas.application
220
221 - implement BigDecimal with RingElem interface, done
222
223 - make examples with rational function field coefficients,
224 e.g. Raksanyi example
225
226 - replace thread-and-network-programming algorithms with
227 util.concurrent, done
228
229 - add version information in jas jar-file names, done
230
231 - split RingFactory to ElemFactory, done
232
233 - split AlgebraicNumber to AlgebraicNumberRing factory, done
234
235 - obsolete: check usage SDP (Socked Direct Protokol) with Java 7 and InfiniBand
236
237 - refactor Hensel lifting to ufd package, not possible because of
238 coefficient replacement trick
239 is now in ufd package (must be done some how)
240
241 - define quotientRemainder in MonoidElem interface with default implementation, done
242
243 - completely switch from svn to git
244
245 - remove @usage doc tag
246
247 - extend mod integer factory interface by Iterable
248
249
250 $Id$