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 - Limiting computation
Author Message
hannes
  Post subject:  Re: Limiting computation  Reply with quote
Currently, you cannot specify arbitrary conditions for that,
but in this case degBound may help
(see http://www.singular.uni-kl.de/Manual/3-0-2/sing_325.htm)
Post Posted: Mon Apr 23, 2007 2:41 pm
Guest
  Post subject:  Limiting computation  Reply with quote
I would like to run a limited groebner basis-type algorithm, where whenever an S-polynomial is generated it is discarded if it does not satisfy some property (typically the total degree of the leading term is higher than some constant).

Is this possible in Singular?
Post Posted: Fri Apr 20, 2007 2:55 pm


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