Sign determination in residue number systems
From MaRDI portal
Publication:1274813
DOI10.1016/S0304-3975(98)00101-7zbMath0912.68083OpenAlexW1980856175MaRDI QIDQ1274813
Ioannis Z. Emiris, Sylvain Pion, Hervé Brönnimann, Pan, Victor Y.
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(98)00101-7
Related Items (11)
Faster geometric algorithms via dynamic determinant computation ⋮ Schur aggregation for linear systems and determinants ⋮ Efficient Predicate Evaluation Using Randomized Degeneracy Detection ⋮ A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES ⋮ Randomized preprocessing versus pivoting ⋮ Additive preconditioning and aggregation in matrix computations ⋮ Computing the sign or the value of the determinant of an integer matrix, a complexity survey. ⋮ Interval arithmetic yields efficient dynamic filters for computational geometry ⋮ Improved algorithms for computing determinants and resultants ⋮ Exact, efficient, and complete arrangement computation for cubic curves ⋮ Survey on generalizations of the intermediate value theorem and applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards exact geometric computation
- Modular arithmetic for linear algebra computations in the real field
- An approximate sign detection method for residue numbers and its application to RNS division
- Efficient perturbations for handling geometric degeneracies
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- Algebraic and numerical techniques for the computation of matrix determinants
- Efficient and accurate B-rep generation of low degree sculptured solids using exact arithmetic. II: Computation
- Efficient exact evaluation of signs of determinants
- On the computational power of pushdown automata
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Solving systems of nonlinear equations using the nonzero value of the topological degree
- A ROBUST TOPOLOGY-ORIENTED INCREMENTAL ALGORITHM FOR VORONOI DIAGRAMS
- On the combinatorial and algebraic complexity of quantifier elimination
- A General Approach to Removing Degeneracies
This page was built for publication: Sign determination in residue number systems