Computing Border Bases without using a Term Ordering
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2011
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912533286223872 |
|---|---|
| author | Kaspar, Stefan |
| author_facet | Kaspar, Stefan |
| contents | Border bases, a generalization of Groebner bases, have actively been researched during recent years due to their applicability to industrial problems. A. Kehrein and M. Kreuzer 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1104_2724 |
| institution | arXiv |
| publishDate | 2011 |
| record_format | arxiv |
| spellingShingle | Computing Border Bases without using a Term Ordering Kaspar, Stefan Commutative Algebra Symbolic Computation 13P10 Border bases, a generalization of Groebner bases, have actively been researched during recent years due to their applicability to industrial problems. A. Kehrein and M. Kreuzer 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. |
| title | Computing Border Bases without using a Term Ordering |
| topic | Commutative Algebra Symbolic Computation 13P10 |
| url | https://arxiv.org/abs/1104.2724 |