Fast and stable polynomial equation solving and its application to computer vision
From MaRDI portal
(Redirected from Publication:847513)
Recommendations
Cites work
- A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem
- A new efficient algorithm for computing Gröbner bases (F₄)
- Algorithm 795
- scientific article; zbMATH DE number 53686 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Résolution des systèmes d'équations algébriques
Cited in
(5)- Tractable algorithms for robust model estimation
- Solving projective complete intersection faster
- Fast certifiable algorithm for the absolute pose estimation of a camera
- Sparse resultant-based minimal solvers in computer vision and their connection with the action matrix
- Algebraic geometry and computer vision: Polynomial systems, real and complex roots
This page was built for publication: Fast and stable polynomial equation solving and its application to computer vision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847513)