A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES

DOI10.1142/S0218195903001256zbMath1051.65061OpenAlexW2129711029WikidataQ57425850 ScholiaQ57425850MaRDI QIDQ4818602

Tim Culver, Dinesh Manocha, John Keyser, Shankar Krishnan

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195903001256

zbMATH Keywords

robustnessnumerical examplessingular value decompositionGaussian eliminationcomputational geometrysign of matrix determinantsubresultant algorithmadaptive precision arithmetic

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical computation of determinants (65F40)

Related Items (1)

Exact computation of the medial axis of a polyhedron

Uses Software

• LAPACK
• LEDA
• MAPC
• PRECISE

Cites Work

• Unnamed Item
• Unnamed Item
• Towards exact geometric computation
• Sign determination in residue number systems
• Algebraic and numerical techniques for the computation of matrix determinants
• Accurate Singular Values of Bidiagonal Matrices
• Precise computation using range arithmetic, via C++
• Subresultants and Reduced Polynomial Remainder Sequences
• Interval arithmetic yields efficient dynamic filters for computational geometry

This page was built for publication: A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES