Solving p-adic polynomial systems via iterative eigenvector algorithms

07/08/2019
by   Avinash Kulkarni, et al.
0

In this article, we describe an implementation of a polynomial system solver to compute the approximate solutions of a 0-dimensional polynomial system with finite precision p-adic arithmetic. We also describe an improvement to an algorithm of Caruso, Roe, and Vaccon for calculating the eigenvalues and eigenvectors of a p-adic matrix.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset