Sciweavers

121 search results - page 3 / 25
» Optimizing polynomials for floating-point implementation
Sort
View
CORR
2010
Springer
118views Education» more  CORR 2010»
13 years 5 months ago
alphaCertified: certifying solutions to polynomial systems
Smale's -theory uses estimates related to the convergence of Newton's method to give criteria implying that Newton iterations will converge quadratically to solutions to ...
Jonathan D. Hauenstein, Frank Sottile
CIT
2006
Springer
13 years 8 months ago
Design of Novel Reversible Carry Look-Ahead BCD Subtractor
IEEE 754r is the ongoing revision to the IEEE 754 floating point standard. A major enhancement to the standard is the addition of decimal format, thus the design of BCD arithmetic...
Himanshu Thapliyal, Sumedha K. Gupta
COMPGEOM
2001
ACM
13 years 8 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
CORR
2008
Springer
131views Education» more  CORR 2008»
13 years 5 months ago
Optimizing polynomials for floating-point implementation
The floating-point implementation of a function often reduces to a polynomial approximation on an interval. Remez algorithm provides the polynomial closest to the function, but th...
Florent de Dinechin, Christoph Quirin Lauter
FCCM
2007
IEEE
165views VLSI» more  FCCM 2007»
13 years 6 months ago
Sparse Matrix-Vector Multiplication Design on FPGAs
Creating a high throughput sparse matrix vector multiplication (SpMxV) implementation depends on a balanced system design. In this paper, we introduce the innovative SpMxV Solver ...
Junqing Sun, Gregory D. Peterson, Olaf O. Storaasl...