A fast and robust RNS algorithm for evaluating signs of determinants

DOI10.1016/S0898-1221(98)00041-8MaRDI QIDQ1608439zbMATH OpenOpenAlexFDO

Authors Graham A. Jullien, W. C. Miller, Vassil S. Dimitrov

Publication date 6 August 2002

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0898-1221(98)00041-8

zbMATH Keywords

computational geometrynumber theoretic algorithmresidue number systemssigns of determinantssmall finite rings

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical computation of determinants (65F40)

Recommendations

• scientific article; zbMATH DE number 1256676
• Certification of numerical computation of the sign of the determinant of a matrix
• Efficient exact evaluation of signs of determinants
• Algorithms of computing determinants in commutative rings
• Evaluating signs of determinants using single-precision arithmetic

Cites work

• scientific article; zbMATH DE number 3912454 (Why is no real title available?)
• scientific article; zbMATH DE number 4061135 (Why is no real title available?)
• scientific article; zbMATH DE number 1256676 (Why is no real title available?)
• A new residue number system division algorithm
• Evaluating signs of determinants using single-precision arithmetic
• Integer division in residue number systems
• Two design principles of geometric algorithms in finite-precision arithmetic

Cited in

(2)

• RNS sign detector based on Chinese remainder theorem II (CRT II)
• The factor-2 sign detection algorithm using a core function for RNS numbers

This page was built for publication: A fast and robust RNS algorithm for evaluating signs of determinants

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