Pages that link to "Item:Q4689237"
From MaRDI portal
The following pages link to Solving Polynomial Systems via Truncated Normal Forms (Q4689237):
Displaying 16 items.
- A stabilized normal form algorithm for generic systems of polynomial equations (Q1639532) (← links)
- Moment matrices, border bases and real radical computation (Q1940922) (← links)
- Analysis of normal-form algorithms for solving systems of polynomial equations (Q2141566) (← links)
- Numerical root finding via Cox rings (Q2173863) (← links)
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms (Q2200298) (← links)
- Solving determinantal systems using homotopy techniques (Q2229744) (← links)
- Stable normal forms for polynomial system solving (Q2378497) (← links)
- Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm (Q2400307) (← links)
- NORMAL BGG SOLUTIONS AND POLYNOMIALS (Q4908357) (← links)
- Systems of Polynomial Equations, Higher-order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part I: The Canonical Polyadic Decomposition (Q4997839) (← links)
- Systems of Polynomial Equations, Higher-Order Tensor Decompositions, and Multidimensional Harmonic Retrieval: A Unifying Framework. Part II: The Block Term Decomposition (Q4997840) (← links)
- Solving p-adic polynomial systems via iterative eigenvector algorithms (Q5064503) (← links)
- Toric eigenvalue methods for solving sparse polynomial systems (Q5097381) (← links)
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems (Q6154944) (← links)
- Sparse resultant-based minimal solvers in computer vision and their connection with the action matrix (Q6596057) (← links)
- A normal form algorithm for tensor rank decomposition (Q6599980) (← links)
