| Title | Computing Grobner Bases within Linear Algebra |
| Author(s) | Akira Suzuki |
| Type | Book, Chapter in Book, Conference Proceeding |
| Abstract | In this paper, we present an alternative algorithm to compute Grobner 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 Grobner basis along with the corresponding term order appropriately.
|
| URL |
http://dx.doi.org/10.1007/978-3-642-04103-7_27 |
| Language | English |
| Series | Lecture Notes in Computer Science |
| Volume | 5743 |
| Pages | 310-321 |
| Publisher | Springer Berlin / Heidelberg |
| Year | 2009 |
| Note | 10.1007/978-3-642-04103-7_27 |
| Editor | Gerdt, Vladimir and Mayr, Ernst and Vorozhtsov, Evgenii |
| Translation |
No |
| Refereed |
Yes |
| Book | Computer Algebra in Scientific Computing |
