Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleComputing Gr\"obner bases within linear algebra.
Author(s) Akira Suzuki
TypeBook, Chapter in Book, Conference Proceeding
AbstractIn this paper, we present an alternative algorithm to compute Gröbner bases, which is based on computations on sparse linear algebra. Both of S-polynomial computations and monomial reductions are computed in linear algebra simultaneously in this algorithm. So it can be implemented to any computational system which can handle linear algebra. For a given ideal in a polynomial ring, it calculates a Gröbner basis along with the corresponding term order appropriately.
ISBN978-3-642-04102-0/pbk
URL http://link.springer.com/chapter/10.1007%2F978-3-642-04103-7_27
LanguageEnglish
Pages310--321
PublisherBerlin: Springer
Year2009
Edition0
Translation No
Refereed No
Webmaster