Solving projective complete intersection faster

DOI10.1145/345542.345642zbMath1326.68363OpenAlexW2033380201MaRDI QIDQ3454770

Mourrain, Bernard, Philippe Trebuchet

Publication date: 26 November 2015

Published in: Proceedings of the 2000 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/345542.345642

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Machine vision and scene understanding (68T45)

Related Items (8)

Stable normal forms for polynomial system solving ⋮ On the complexity exponent of polynomial system solving ⋮ Further perspectives on elimination ⋮ Relations between roots and coefficients, interpolation and application to system solving ⋮ Solving Polynomial Systems via Truncated Normal Forms ⋮ Solving polynomial systems via symbolic-numeric reduction to geometric involutive form ⋮ On the asymptotic and practical complexity of solving bivariate systems over the reals ⋮ Degröbnerization: a political manifesto

Uses Software

• Blitz++
• FOXBOX
• LAPACK
• TNT
• STL

This page was built for publication: Solving projective complete intersection faster