Feature #144
Feature #143: Buchberger-Moeller (parent task)
Buchberger-Moeller: generic impl
Description
Implement generic BM algorithm over any field.
Aim is to make impl clean rather than fast.
Each input ideal is represented as a set of commuting matrices (one for each indet).
Related issues
History
#1
Updated by John Abbott over 11 years ago
Updated by - Priority changed from Normal to Urgent
#2
Updated by John Abbott over 11 years ago
- Status changed from New to Resolved
- Priority changed from Urgent to Normal
- % Done changed from 0 to 30
It works on two simple examples. Still need to:
- make it accessible from CoCoA-5
- write manual for CoCoALib
- write manual for CoCoALib
- refine the code to make it cleaner/more efficient (avoid wasteful copies)
The code is very simplistic, probably too simplistic (e.g. it cannot produce the separators).
The public interface is probably too simplistic too.
#3
Updated by John Abbott about 11 years ago
- Category set to New Function
- Status changed from Resolved to Feedback
- Assignee set to John Abbott
- Target version set to CoCoALib-0.99534 Seoul14
- % Done changed from 30 to 60
Improved impl to handle case where NumPts differs from NumIndets.
Added IdealOfPoints to CoCoA-5.
Added a test (a bit too simple really).
Added doc (both for CoCoALib and CoCoA-5).
Decided to leave code as is (simple but inefficient) because it is so simple that there are obviously no bugs (but don't mention "bus error"). It will be a good reference impl.
#4
Updated by John Abbott almost 11 years ago
- Status changed from Feedback to Closed
- % Done changed from 60 to 100
This has been in feedback for 2 months without problems (and it has been used).
It may well become largely obsolete when the new impl has been completed, but it is always a good reference (and fall-back impl when some niftier impl cannot be used).
#5
Updated by Anna Maria Bigatti over 10 years ago
Updated by - Target version changed from CoCoALib-0.99534 Seoul14 to CoCoALib-0.99531