Non-commutative Computer Algebra for polynomial algebras: Gröbner bases, applications and implementation

V Levandovskyy - 2005 - kluedo.ub.rptu.de
Non-commutative polynomial algebras appear in a wide range of applications, from
quantum groups and theoretical physics to linear differential and difference equations. In the …

[PDF][PDF] Index concepts for differential-algebraic equations

V Mehrmann - Encyclopedia of Applied and Computational …, 2015 - core.ac.uk
Index concepts for differential-algebraic equations Page 1 Index concepts for differential-algebraic
equations Volker Mehrmann∗ January 23, 2012 Abstract We discuss several of different index …

Involutive algorithms for computing Gröbner bases

VP Gerdt - arXiv preprint math/0501111, 2005 - arxiv.org
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of
polynomial ideals. The algorithm is based on the concept of involutive monomial division …

A combinatorial approach to involution and δ-regularity II: structure analysis of polynomial modules with pommaret bases

WM Seiler - Applicable Algebra in Engineering, Communication …, 2009 - Springer
Much of the existing literature on involutive bases concentrates on their efficient algorithmic
construction. By contrast, we are here more concerned with their structural properties …

A combinatorial approach to involution and δ-regularity I: involutive bases in polynomial algebras of solvable type

WM Seiler - Applicable Algebra in Engineering, Communication …, 2009 - Springer
Involutive bases are a special form of non-reduced Gröbner bases with additional
combinatorial properties. Their origin lies in the Janet–Riquier theory of linear systems of …

[HTML][HTML] Term-ordering free involutive bases

M Ceria, T Mora, M Roggero - Journal of Symbolic Computation, 2015 - Elsevier
In this paper, we consider a monomial ideal J◃ P:= A [x 1,…, xn], over a commutative ring A,
and we face the problem of the characterization for the family M f (J) of all homogeneous …

A novel linear algorithm for P5P problem

J Tang, WS Chen, J Wang - Applied Mathematics and Computation, 2008 - Elsevier
Perspective-five-point (P5P) problem is a classical problem in applied mathematics, pattern
recognition and computer vision. We briefly survey several existing algorithms for the …

Solving local equivalence problems with the equivariant moving frame method

F Valiquette - SIGMA. Symmetry, Integrability and Geometry: Methods …, 2013 - emis.de
Given a Lie pseudo-group action, an equivariant moving frame exists in the neighborhood of
a submanifold jet provided the action is free and regular. For local equivalence problems the …

Solving polynomial systems via symbolic-numeric reduction to geometric involutive form

G Reid, L Zhi - Journal of Symbolic Computation, 2009 - Elsevier
We briefly survey several existing methods for solving polynomial systems with inexact
coefficients, then introduce our new symbolic-numeric method which is based on the …

Computing the multiplicity structure from geometric involutive form

X Wu, L Zhi - Proceedings of the twenty-first international symposium …, 2008 - dl.acm.org
We present a method based on symbolic-numeric reduction to geometric involutive form to
compute the primary component and the differential operators f solution of a polynomial …