Pages that link to "Item:Q413407"

The following pages link to Algorithms for computing triangular decomposition of polynomial systems (Q413407):

Displaying 19 items.

• Bounding the number of limit cycles for a polynomial Liénard system by using regular chains (Q507129) (← links)
• Computational schemes for subresultant chains (Q831961) (← links)
• Generic regular decompositions for parametric polynomial systems (Q905159) (← links)
• Characteristic decomposition: from regular sets to normal sets (Q1730299) (← links)
• On solving parametric polynomial systems (Q1949089) (← links)
• Deterministic normal position transformation and its applications (Q2006776) (← links)
• Parameter identification on abelian integrals to achieve Chebyshev property (Q2033878) (← links)
• Subresultant chains using Bézout matrices (Q2109975) (← links)
• Analyses and implementations of chordality-preserving top-down algorithms for triangular decomposition (Q2109980) (← links)
• Chordal graphs in triangular decomposition in top-down style (Q2200301) (← links)
• Computing strong regular characteristic pairs with Gröbner bases (Q2229717) (← links)
• On the extended Hensel construction and its application to the computation of real limit points (Q2284954) (← links)
• Whitney's theorem, triangular sets, and probabilistic descent on manifolds (Q2322361) (← links)
• Solving multi-linear systems with \(\mathcal {M}\)-tensors (Q2399199) (← links)
• An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form (Q2674009) (← links)
• Parallelization of triangular decompositions: techniques and implementation (Q2674015) (← links)
• Decomposition of polynomial sets into characteristic pairs (Q4960083) (← links)
• A signature-based algorithm for computing the nondegenerate locus of a polynomial system (Q6108370) (← links)
• Squarefree normal representation of zeros of zero-dimensional polynomial systems (Q6184184) (← links)