Properties of regular systems and algorithmic improvements for regular decomposition
From MaRDI portal
Publication:971615
DOI10.1016/J.CAMWA.2008.12.002zbMATH Open1186.68583OpenAlexW2009491545MaRDI QIDQ971615FDOQ971615
Authors: Meng Jin 
Publication date: 16 May 2010
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2008.12.002
Recommendations
- scientific article; zbMATH DE number 1860738
- Regular Decompositions
- Generic regular decompositions for parametric polynomial systems
- scientific article; zbMATH DE number 1512671
- Regular finite decomposition complexity
- Regular decomposition in integer programming
- Properties of generalized decomposition systems similar to orthogonal systems
- Partition regularity of a system of De and Hindman
- Algorithms for recognition of regular properties and decomposition of recursive graph families
- A new approach to regular descriptor systems
Cites Work
- Title not available (Why is that?)
- Decomposing polynomial systems into simple systems
- Title not available (Why is that?)
- Computing triangular systems and regular systems
- Title not available (Why is that?)
- Optimizations of the subresultant algorithm
- Title not available (Why is that?)
- Unmixed-dimensional decomposition of a finitely generated perfect differential ideal
- A complete algorithm for counting real solutions of polynomial systems of equations and inequalities.
- Solving zero-dimensional algebraic systems
- Improving the DISPGB algorithm using the discriminant ideal
- Title not available (Why is that?)
- Subresultants with the Bézout matrix
- A note on Wu's non-degenerate condition
Cited In (4)
Uses Software
This page was built for publication: Properties of regular systems and algorithmic improvements for regular decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971615)
