Solving p-adic polynomial systems via iterative eigenvector algorithms
Numerical Analysis
2019-07-09 v1 Numerical Analysis
Symbolic Computation
Number Theory
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.
Cite
@article{arxiv.1907.03740,
title = {Solving p-adic polynomial systems via iterative eigenvector algorithms},
author = {Avinash Kulkarni},
journal= {arXiv preprint arXiv:1907.03740},
year = {2019}
}
Comments
13 pages. Comments welcome