Results 1  10
of
349
NewtonRaphson iteration
"... the computation of the reciprocal of floating point expansions using an adapted ..."
Abstract
 Add to MetaCart
the computation of the reciprocal of floating point expansions using an adapted
On extensions of the NewtonRaphson iterative scheme to arbitrary orders
 In 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), Discrete Math. Theor. Comput. Sci. Proc., AN
, 2010
"... Abstract. The classical quadratically convergent NewtonRaphson iterative scheme for successive approximations of a root of an equation f (t) = 0 has been extended in various ways by different authors, going from cubical convergence to convergence of arbitrary orders. We introduce two such extensio ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. The classical quadratically convergent NewtonRaphson iterative scheme for successive approximations of a root of an equation f (t) = 0 has been extended in various ways by different authors, going from cubical convergence to convergence of arbitrary orders. We introduce two
On NewtonRaphson iteration for multiplicative inverses modulo prime powers
, 2012
"... We study algorithms for the fast computation of modular inverses. NewtonRaphson iteration over padic numbers gives a recurrence relation computing modular inverse modulo p m, that is logarithmic in m. We solve the recurrence to obtain an explicit formula for the inverse. Then we study different im ..."
Abstract
 Add to MetaCart
We study algorithms for the fast computation of modular inverses. NewtonRaphson iteration over padic numbers gives a recurrence relation computing modular inverse modulo p m, that is logarithmic in m. We solve the recurrence to obtain an explicit formula for the inverse. Then we study different
Decimal Floatingpoint Division Using NewtonRaphson Iteration
 In Proceedings of IEEE International Conference on ApplicationSpecific System, Architectures and Processors
, 2004
"... Decreasing feature sizes allow additional functionality to be added to future microprocessors to improve the performance of important application domains. As a result of rapid growth in financial, commercial, and Internetbased applications, hardware support for decimal floatingpoint arithmetic is ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
for decimal floatingpoint division. The design uses an optimized piecewise linear approximation, a modified NewtonRaphson iteration, a specialized rounding technique, and a simplified combined decimal incrementer/decrementer. Synthesis results show that a 64bit (16digit) implementation of the decimal
Decimal FloatingPoint Square Root Using NewtonRaphson Iteration
 Proc. 16th IEEE Int’l Conf. ApplicationSpecific Systems, Architectures and Processors (ASAP ’05
, 2005
"... With continued reductions in feature size, additional functionality may be added to future microprocessors to boost the performance of important application domains. Due to growth in commercial, financial, and Internetbased applications, decimal floating point arithmetic is now attracting more atte ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Point Arithmetic (IEEE754R). This paper presents an efficient arithmetic algorithm and hardware design for decimal floatingpoint square root. This design uses an optimized piecewise linear approximation, a modified NewtonRaphson iteration, a specialized rounding technique, and a modified decimal multiplier
TimeDomain Simulation of System Interconnect Using Convolution and NewtonRaphson Iteration Methods
"... In today’s world electronic system interconnections, commonly called channels, are routed over packages and printed circuit boards and are characterized by measuring eyes and calculating the bit error rate (BER). Many factors such as jitter, intersymbol interference, simultaneous switching noise an ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. The possible timedomain simulation techniques can be classified in two ways: a transient solver (e.g., ASTAP, Spice) which uses nonlinear NewtonRaphson iteration methods, and another second technique based on linear
An iterative image registration technique with an application to stereo vision
 In IJCAI81
, 1981
"... Image registration finds a variety of applications in computer vision. Unfortunately, traditional image registration techniques tend to be costly. We present a new image registration technique that makes use of the spatial intensity gradient of the images to find a good match using a type of Newton ..."
Abstract

Cited by 2897 (30 self)
 Add to MetaCart
Image registration finds a variety of applications in computer vision. Unfortunately, traditional image registration techniques tend to be costly. We present a new image registration technique that makes use of the spatial intensity gradient of the images to find a good match using a type of NewtonRaphson
Choosing Starting Values for NewtonRaphson Computation of Reciprocals, SquareRoots and SquareRoot Reciprocals
, 2003
"... We aim at finding the best possible seed values when computing reciprocals, squareroots and squareroot reciprocals in a given interval using NewtonRaphson iterations. A natural choice of the seed value would be the one that best approximates the expected result. It turns out that in most cases, t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We aim at finding the best possible seed values when computing reciprocals, squareroots and squareroot reciprocals in a given interval using NewtonRaphson iterations. A natural choice of the seed value would be the one that best approximates the expected result. It turns out that in most cases
NewtonRaphson Algorithms for FloatingPoint Division Using an FMA
"... Since the introduction of the Fused Multiply and Add (FMA) in the IEEE7542008 standard [6] for floatingpoint arithmetic, division based on NewtonRaphson’s iterations becomes a viable alternative to SRTbased divisions. The NewtonRaphson iterations were already used in some architecture prior to ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Since the introduction of the Fused Multiply and Add (FMA) in the IEEE7542008 standard [6] for floatingpoint arithmetic, division based on NewtonRaphson’s iterations becomes a viable alternative to SRTbased divisions. The NewtonRaphson iterations were already used in some architecture prior
Results 1  10
of
349