Solving p-adic polynomial systems via iterative eigenvector algorithms

DOI10.1080/03081087.2020.1743633MaRDI QIDQ5064503zbMATH OpenOpenAlexFDO

Authors Avinash Kulkarni

Publication date 16 March 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

solving polynomial systemseigenvector algorithms\(p\)-adic linear algebra

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Polynomials (11S05) (p)-adic theory (11E95)

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.

Recommendations

• Characteristic polynomials of \(p\)-adic matrices
• An effective algorithm for deciding the solvability of a system of polynomial equations over \(p\)-adic integers
• Solution of systems of linear equations by the \(p\)-adic method
• Iterative root approximation in \(p\)-adic numerical analysis
• Multivariate polynomial system solving using intersections of eigenspaces.

Cites work

• scientific article; zbMATH DE number 3880972 (Why is no real title available?)
• scientific article; zbMATH DE number 3199190 (Why is no real title available?)
• Characteristic polynomials of \(p\)-adic matrices
• Exact solution of linear equations using p-adic expansions
• Ideals, Varieties, and Algorithms
• Nemo/Hecke. Computer algebra and number theory packages for the Julia programming language
• On Affine Tropical F5 Algorithms
• On the complexity of computing determinants
• Random matrix theory over finite fields
• Relaxed \(p\)-adic Hensel lifting for algebraic systems
• Relaxed algorithms for \(p\)-adic numbers
• Solving polynomial systems via truncated normal forms
• The calculation of Lame polynomials
• \(P\)-adic stability in linear algebra
• \(p\)-adic differential equations

Cited in

(4)

• Toric eigenvalue methods for solving sparse polynomial systems
• Super-linear convergence in the p -adic QR-algorithm
• Characteristic polynomials of \(p\)-adic matrices
• \(p\)-adic integral geometry

Describes a project that uses

Uses Software

• Hecke

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)