Evaluating signs of determinants using single-precision arithmetic
From MaRDI portal
Publication:675307
DOI10.1007/BF02522822zbMATH Open0865.68119OpenAlexW2067610521MaRDI QIDQ675307FDOQ675307
Jean-Daniel Boissonnat, Olivier Devillers, Francis Avnaim, Mariette Yvinec, F. P. Preparata
Publication date: 30 June 1997
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02522822
Recommendations
Cites Work
Cited In (10)
- A fast and robust RNS algorithm for evaluating signs of determinants
- A robust algorithm for geometric predicate by error-free determinant transformation
- Algebraic and numerical techniques for the computation of matrix determinants
- Computations that require higher than double precision for robust and exact decision making
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
- THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- Certification of numerical computation of the sign of the determinant of a matrix
- Ham-sandwich cuts for abstract order types
Uses Software
This page was built for publication: Evaluating signs of determinants using single-precision arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675307)