Opened 7 years ago

Last modified 5 years ago

#12786 new enhancement

solve_mod is horribly slow for linear systems

Reported by: zimmerma Owned by: burcin
Priority: minor Milestone: sage-6.4
Component: symbolics Keywords:
Cc: Merged in:
Authors: Reviewers:
Report Upstream: N/A Work issues:
Branch: Commit:
Dependencies: Stopgaps:

Description

consider the following with Sage 4.8:

sage: s
[69*a + b + 76*c == 59, 43*a + b + 5*c == 91, 69*a + b + 76*c == 42, 70*a + b + 26*c == 98, 65*a + b + 28*c == 65, 66*a + b + 60*c == 106, 84*a + b + 93*c == 1]
sage: time sol = solve_mod(s, 107)
Time: CPU 190.52 s, Wall: 366.98 s

I know the documentation of solve_mod says it uses exhaustive enumeration for small primes, however it would be easy to recognize linear systems and call corresponding routines for them.

Change History (5)

comment:1 Changed 6 years ago by jdemeyer

  • Milestone changed from sage-5.11 to sage-5.12

comment:2 Changed 5 years ago by vbraun_spam

  • Milestone changed from sage-6.1 to sage-6.2

comment:3 Changed 5 years ago by vbraun_spam

  • Milestone changed from sage-6.2 to sage-6.3

comment:4 Changed 5 years ago by jdemeyer

  • Component changed from linear programming to symbolics
  • Owner changed from ncohen to burcin

comment:5 Changed 5 years ago by vbraun_spam

  • Milestone changed from sage-6.3 to sage-6.4
Note: See TracTickets for help on using tickets.