Solving p-adic polynomial systems via iterative eigenvector algorithms

From MaRDI portal
Publication:5064503

DOI10.1080/03081087.2020.1743633zbMATH Open1485.15011arXiv1907.03740OpenAlexW3013495251MaRDI QIDQ5064503FDOQ5064503


Authors: Avinash Kulkarni Edit this on Wikidata


Publication date: 16 March 2022

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1907.03740




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: Solving \(p\)-adic polynomial systems via iterative eigenvector algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5064503)