search

mschlund / FPsolve

FPsolve: solver for polynomial equations over omega-continuous semirings
BSD 2-Clause "Simplified" License
11 stars 5 forks source link

Commutative Case: Compute J* over commutative RegExp instead of FreeSR #30

Closed mschlund closed 10 years ago

mschlund commented 11 years ago

For commutative Newton we can possibly speed up the evaluation of J* in every step by computing J* over the commutative+idempotent "free" semiring (i.e. comm. RegExps).

This requires to introduce an analoge to the make_free function in polynomials! In this new function it is important to map ALL semiring-constants to DIFFERENT fresh variables, so 0.5XX + 0.5 gets mapped to aXX+b !

mschlund commented 10 years ago

It is fine the way it is... the optimization potential of commutative RegExps is not very high.