Numerical analysis meets number theory: Using rootfinding methods to calculate inverses mod pn
نویسندگان
چکیده
منابع مشابه
NUMERICAL ANALYSIS MEETS NUMBER THEORY: USING ROOTFINDING METHODS TO CALCULATE INVERSES MOD p
In this article we explore a very interesting application of tools from numerical analysis to number theory. As the title suggests, we will see how one can use classical rootfinding methods, such as Newton’s method, to calculate the reciprocal of an integer modulo p, where p is a prime number. We first encountered this idea in [3], where Newton’s method was used to find the reciprocal of a fini...
متن کاملNumerical Instability of Resultant Methods for Multidimensional Rootfinding
Hidden-variable resultant methods are a class of algorithms for solving multidimensional polynomial rootfinding problems. In two dimensions, when significant care is taken, they are competitive practical rootfinders. However, in higher dimensions they are known to miss zeros, calculate roots to low precision, and introduce spurious solutions. We show that the hidden variable resultant method ba...
متن کاملUsing Representation Theory to Calculate Syzygies
These are lecture notes for the workshop “Syzygies of algebraic varieties” that took place November 20–22, 2015 at University of Illinois, Chicago. The goal of these lectures is to explain the method of Kempf collapsing and how to use it to calculate Betti numbers of algebraic varieties. This technique can only be fully executed in very special cases, but when it does work, it gives a surprisin...
متن کاملUsing approximate inverses in algebraic multilevel methods
This paper deals with the iterative solution of large sparse symmetric positive definite systems. We investigate preconditioning techniques of the two-level type that are based on a block factorization of the system matrix. Whereas the basic scheme assumes an exact inversion of the submatrix related to the first block of unknowns, we analyze the effect of using an approximate inverse instead. W...
متن کاملMod-poisson Convergence in Probability and Number Theory
Building on earlier work introducing the notion of “modGaussian” convergence of sequences of random variables, which arises naturally in Random Matrix Theory and number theory, we discuss the analogue notion of “mod-Poisson” convergence. We show in particular how it occurs naturally in analytic number theory in the classical Erdős-Kac Theorem. In fact, this case reveals deep connections and ana...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Analysis and Discrete Mathematics
سال: 2010
ISSN: 1452-8630
DOI: 10.2298/aadm1000012k