Pages that link to "Item:Q1808665"

The following pages link to Triangular sets for solving polynomial systems: a comparative implementation of four methods (Q1808665):

Displaying 21 items.

• Computing isolated roots of sparse polynomial systems in affine space (Q410703) (← links)
• A test for monomial containment (Q512370) (← links)
• When does \(\langle T \rangle\) equal \(\text{sat}(T)\)? (Q651871) (← links)
• Properness defects of projection and minimal discriminant variety (Q719760) (← links)
• Numerical homotopies to compute generic points on positive dimensional algebraic sets (Q1594830) (← links)
• Specifications for triangulation algorithms of elementary-algebraic systems (Q1598480) (← links)
• On the theories of triangular sets (Q1808664) (← links)
• Computing real solutions of fuzzy polynomial systems (Q2035296) (← 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)
• Whitney's theorem, triangular sets, and probabilistic descent on manifolds (Q2322361) (← links)
• Solving multi-linear systems with \(\mathcal {M}\)-tensors (Q2399199) (← links)
• On approximate triangular decompositions in dimension zero (Q2470055) (← links)
• Applications of the theory of weakly nondegenerate conditions to zero decomposition for polynomial systems (Q2643540) (← links)
• Solving via Modular Methods (Q3455092) (← links)
• Decomposition of polynomial sets into characteristic pairs (Q4960083) (← links)
• A moment approach to analyze zeros of triangular polynomial sets (Q5714388) (← links)
• On computer-assisted classification of coupled integrable equations (Q5894825) (← links)
• Using Galois ideals for computing relative resolvents (Q5927988) (← links)
• On the links between triangular sets and dynamic constructible closure (Q5946465) (← links)
• Bifurcation analysis and complex dynamics of a Kopel triopoly model (Q6099476) (← links)