Efficient Generic Quotients Using Exact Arithmetic

04/04/2023
by   Stephen M. Watt, et al.
0

The usual formulation of efficient division uses Newton iteration to compute an inverse in a related domain where multiplicative inverses exist. On one hand, Newton iteration allows quotients to be calculated using an efficient multiplication method. On the other hand, working in another domain is not always desirable and can lead to a library structure where arithmetic domains are interdependent. This paper uses the concept of a whole shifted inverse and modified Newton iteration to compute quotients efficiently without leaving the original domain. The iteration is generic to domains having a suitable shift operation, such as integers or polynomials with coefficients that do not necessarily commute.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2022

A new modified Newton iteration for computing nonnegative Z-eigenpairs of nonnegative tensors

We propose a new modification of Newton iteration for finding some nonne...
research
02/07/2023

Newton iteration for lexicographic Gröbner bases in two variables

We present an m-adic Newton iteration with quadratic convergence for lex...
research
04/09/2022

An Improved Integer Modular Multiplicative Inverse (modulo 2^w)

This paper presents an algorithm for the integer multiplicative inverse ...
research
05/02/2016

Munchausen Iteration

We present a method for solving polynomial equations over idempotent ome...
research
07/13/2020

Inverse Cubic Iteration

There are thousands of papers on rootfinding for nonlinear scalar equati...
research
12/18/2020

Analytic Integration of the Newton Potential over Cuboids and an Application to Fast Multipole Methods

We present simplified formulae for the analytic integration of the Newto...
research
02/03/2016

Division and Slope Factorization of p-Adic Polynomials

We study two important operations on polynomials defined over complete d...

Please sign up or login with your details

Forgot password? Click here to reset