Multiplicity-preserving triangular set decomposition of two polynomials
From MaRDI portal
Publication:2341596
DOI10.1007/s11424-014-2017-0zbMath1317.12002OpenAlexW278227866MaRDI QIDQ2341596
Publication date: 27 April 2015
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-014-2017-0
algebraic cyclemultiplicity-preservingprimitive polynomial remainder sequencetriangular set decomposition
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity ⋮ On the topology and isotopic meshing of plane algebraic curves ⋮ Squarefree normal representation of zeros of zero-dimensional polynomial systems ⋮ Ritt-Wu characteristic set method for Laurent partial differential polynomial systems ⋮ Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
Uses Software
Cites Work
- An efficient algorithm for factoring polynomials over algebraic extension field
- On the dimension of an arbitrary ascending chain
- On the asymptotic and practical complexity of solving bivariate systems over the reals
- Basic principles of mechanical theorem proving in elementary geometries
- A new method for solving algebraic systems of positive dimension
- Solving zero-dimensional algebraic systems
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Algorithmic properties of polynomial rings
- Primitive polynomial remainder sequences in elimination theory
- Involutive bases of polynomial ideals
- Computing triangular systems and regular systems
- On the theories of triangular sets
- Ideal basis and primary decompositions: case of two variables
- A bound for orders in differential Nullstellensatz
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- Comprehensive Triangular Decomposition
- The Subresultant PRS Algorithm
- Lifting techniques for triangular decompositions
- Computing the multiplicity structure in solving polynomial systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Multiplicity-preserving triangular set decomposition of two polynomials