Back to Forum | View unanswered posts | View active topics





Post a reply
Username:
Note:If not registered, provide any username. For more comfort, register here.
Subject:
Message body:
Enter your message here, it may contain no more than 60000 characters. 

Smilies
:D :) :( :o :shock: :? 8) :lol: :x :P :oops: :cry: :evil: :twisted: :roll: :wink: :!: :?: :idea: :arrow: :| :mrgreen:
Font size:
Font colour
Options:
BBCode is ON
[img] is ON
[flash] is OFF
[url] is ON
Smilies are ON
Disable BBCode
Disable smilies
Do not automatically parse URLs
Confirmation of post
To prevent automated posts the board requires you to enter a confirmation code. The code is displayed in the image you should see below. If you are visually impaired or cannot otherwise read this code please contact the %sBoard Administrator%s.
Confirmation code:
Enter the code exactly as it appears. All letters are case insensitive, there is no zero.
   

Topic review - Modular methods for standard bases
Author Message
malex
  Post subject:  Re: Modular methods for standard bases  Reply with quote
Dear Daniel,

dmurfet wrote:
I just ran across a paper by Pfister "On modular computation of standard basis" and I am completely stunned by the timings given there; so here's my question: can someone tell me whether there is a way to run modStd on a module?


please note that 'modStd' is implemented in "modstd.lib".
at the moment it seems to work with ideals only...

dmurfet wrote:
A second question: I tracked down the implementation of minbase in the Singular source to idMinBase in ideals.cc (for ideals), but I failed to find how minbase for modules is implemented. Hints?


in Singular's "poly" is either polynomial or vector while "ideal" is either module or ideal.

in "idMinBase" the GB is computed by "kStd"

Regards,
Oleksandr
Post Posted: Thu Oct 07, 2010 3:30 pm
dmurfet
  Post subject:  Modular methods for standard bases  Reply with quote
Hi all,

My collaborator and I are trying to compute some link invariants using Singular, and long standard basis computations seem to be the main holdup. These arise from running minbase on some module with complicated coefficients in the vectors. Everything is happening over QQ with ordering dp.

I just ran across a paper by Pfister "On modular computation of standard basis" and I am completely stunned by the timings given there; so here's my question: can someone tell me whether there is a way to run modStd on a module?

A second question: I tracked down the implementation of minbase in the Singular source to idMinBase in ideals.cc (for ideals), but I failed to find how minbase for modules is implemented. Hints?

Thanks,

Daniel.
Post Posted: Thu Oct 07, 2010 5:38 am


It is currently Fri May 13, 2022 11:07 am
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group