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

Details:

   
TitleComputation of Gr\"obner bases.
Author(s) Masayuki Noro
TypeBook, Chapter in Book, Conference Proceeding
AbstractIn Chap. 1, we presented the theoretical foundation of Gröbner bases, and many of our computations were carried out by hand. When we want to apply Gröbner bases to practical problems, however, in most cases, we will need the help of computers. There are many mathematical software systems which support the computation of Gröbner bases, but we will often encounter cases which require careful settings or preprocessing in order to be efficient. In this chapter, we explain various methods to efficiently use a computer to compute Gröbner bases. We also present some algorithms for performing operations on the ideals realized by Gröbner bases. These operations are implemented in several mathematical software systems: Singular, Macaulay2, CoCoA, and Risa/Asir. We will illustrate the usage of these systems mainly by example.
ISBN978-4-431-54573-6/hbk; 978-4-4
URL http://link.springer.com/chapter/10.1007%2F978-4-431-54574-3_3
LanguageEnglish
Pages107--163
PublisherTokyo: Springer
Year2013
Edition0
Translation No
Refereed No
Webmaster