The following pages link to (Q4226951):
Displaying 33 items.
- Verified error bounds for isolated singular solutions of polynomial systems: case of breadth one (Q385011) (← links)
- Computing the multiplicity structure of an isolated singular solution: case of breadth one (Q413412) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- A generic position based method for real root isolation of zero-dimensional polynomial systems (Q480656) (← links)
- Solving a sparse system using linear algebra (Q491257) (← links)
- On the computation of an arrangement of quadrics in 3D (Q705551) (← links)
- Using symmetries in the eigenvalue method for polynomial systems (Q731929) (← links)
- Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms (Q765856) (← links)
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems (Q947643) (← links)
- A prolongation-projection algorithm for computing the finite real variety of an ideal (Q1029340) (← links)
- Multiplication matrices and ideals of projective dimension zero (Q1948611) (← links)
- Multivariate polynomials, duality, and structured matrices (Q1977144) (← links)
- Two complementary block Macaulay matrix algorithms to solve multiparameter eigenvalue problems (Q2080251) (← links)
- Certified numerical real root isolation for bivariate nonlinear systems (Q2156364) (← links)
- Certifying the global optimality of quartic minimization over the sphere (Q2158108) (← links)
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms (Q2200298) (← links)
- Approximate gcds of polynomials and sparse SOS relaxations (Q2378493) (← links)
- Stable normal forms for polynomial system solving (Q2378497) (← links)
- Generating polynomials and symmetric tensor decompositions (Q2397746) (← links)
- Minimizing polynomials via sum of squares over the gradient ideal (Q2492680) (← links)
- On deflation and multiplicity structure (Q2628321) (← links)
- Loss functions for finite sets (Q2696910) (← links)
- Border Basis for Polynomial System Solving and Optimization (Q2819219) (← links)
- (Q4364311) (← links)
- Low Rank Symmetric Tensor Approximations (Q4598341) (← links)
- Solving Polynomial Systems via Truncated Normal Forms (Q4689237) (← links)
- Accurate solution of polynomial equations using Macaulay resultant matrices (Q4821046) (← links)
- Toric eigenvalue methods for solving sparse polynomial systems (Q5097381) (← links)
- Computation of a specified root of a polynomial system of equations using eigenvectors (Q5926400) (← links)
- Multivariate polynomial system solving using intersections of eigenspaces. (Q5950985) (← links)
- Exact line and plane search for tensor optimization (Q5963312) (← links)
- Randomized Joint Diagonalization of Symmetric Matrices (Q6130646) (← links)
- A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems (Q6154944) (← links)
