Solving projective complete intersection faster

DOI10.1145/345542.345642MaRDI QIDQ3454770zbMATH OpenOpenAlexFDO

Authors Bernard Mourrain, Philippe Trébuchet

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

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

Recommendations

• scientific article; zbMATH DE number 852137
• Resolution of polynomial systems
• scientific article; zbMATH DE number 1057749
• Fast and stable polynomial equation solving and its application to computer vision
• scientific article; zbMATH DE number 5835972

Cited in

(9)

• 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
• Stable normal forms for polynomial system solving
• On the complexity exponent of polynomial system solving
• Solving polynomial systems via truncated normal forms
• Further perspectives on elimination
• Relations between roots and coefficients, interpolation and application to system solving
• Fast and stable polynomial equation solving and its application to computer vision

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454770)