Solving p-adic Polynomial Systems via Iterative Eigenvector Algorithms.

Avinash Kulkarni

Contact the author: Please use for correspondence this email.
Submission date: 14. Jul. 2019
Pages: 15
Bibtex
MSC-Numbers: 15A18, 11S05
Keywords and phrases: p-adic linear algebra, solving polynomial systems, eigenvector algorithms
Download full preprint: PDF (328 kB)
Link to arXiv: See the arXiv entry of this preprint.

Abstract:
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.