A new algorithmic scheme for computing characteristic sets

DOI10.1016/J.JSC.2012.04.004MaRDI QIDQ1930182zbMATH OpenOpenAlexFDO

Authors Meng Jin, Xiaoliang Li, Dongming Wang

Publication date 10 January 2013

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1108.1486

zbMATH Keywords

reductioneliminationcharacteristic setsubresultanttriangular set

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

Abstract: Ritt-Wu's algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for computing generalized characteristic sets by introducing other admissible reductions than pseudo-division. A concrete subalgorithm is designed to triangularize polynomial sets using selected admissible reductions and several effective elimination strategies and to replace the algorithm of basic sets (used in Ritt-Wu's algorithm). The proposed algorithm has been implemented and experimental results show that it performs better than Ritt-Wu's algorithm in terms of computing time and simplicity of output for a number of non-trivial test examples.

Recommendations

• scientific article; zbMATH DE number 1795751
• Characteristic sets verses generalized characteristic sets
• scientific article; zbMATH DE number 16648
• Characteristic decomposition: from regular sets to normal sets
• Algorithm for computing differential char sets efficiently

Cited in

(12)

• A strategy for speeding-up the computation of characteristic sets
• scientific article; zbMATH DE number 1795751 (Why is no real title available?)
• scientific article; zbMATH DE number 16648 (Why is no real title available?)
• Matrix solving process of characteristic series for polynomial systems
• Algorithm for computing differential char sets efficiently
• Characteristic sets verses generalized characteristic sets
• Finding solutions of fuzzy polynomial equations systems by an Algebraic method
• Chordal graphs in triangular decomposition in top-down style
• Resultant elimination via implicit equation interpolation
• Some Properties of Triangular Sets and Improvement Upon Algorithm CharSer
• A test for monomial containment
• Finding Fuzzy Inverse Matrix Using Wu’s Method

Describes a project that uses

Uses Software

• Groebner
• Maple

This page was built for publication: A new algorithmic scheme for computing characteristic sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1930182)