Fast and stable polynomial equation solving and its application to computer vision

DOI10.1007/s11263-009-0235-zzbMath1477.68338OpenAlexW2058946587MaRDI QIDQ847513

Klas Josephson, Martin Byröd, Kalle Åström

Publication date: 16 February 2010

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL: https://lup.lub.lu.se/record/1389303

zbMATH Keywords

Gröbner basispolynomial equationsstructure from motionminimal problems

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Machine vision and scene understanding (68T45) Numerical computation of roots of polynomial equations (65H04)

Related Items

Tractable algorithms for robust model estimation

Uses Software

• LAPACK
• Macaulay2
• PHCpack
• CLAPACK
• FIVEPOINT

Cites Work

• Résolution des systèmes d'équations algébriques
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Algorithm 795
• A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem
• Unnamed Item
• Unnamed Item
• Unnamed Item