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

Details:

   
TitleComputing border bases without using a term ordering.
Author(s) Stefan Kaspar
TypeArticle in Journal
Abstractorder bases, a generalization of Gröbner bases, have actively been researched during recent years due to their applicability to industrial problems. Kehrein and Kreuzer (J Pure Appl Alg 205:279295, 2006) formulated the so called Border Basis Algorithm, an algorithm which allows the computation of border bases that relate to a degree compatible term ordering. In this paper we extend the original Border Basis Algorithm in such a way that also border bases that do not relate to any term ordering can be computed by it.
KeywordsBorder basis, Term ordering, Marked polynomials, Symbolic computation
ISSN0138-4821; 2191-0383/e
URL http://link.springer.com/article/10.1007%2Fs13366-011-0070-6
LanguageEnglish
JournalBeitr. Algebra Geom.
Volume54
Number1
Pages211--223
PublisherSpringer, Berlin/Heidelberg
Year2013
Edition0
Translation No
Refereed No
Webmaster