Solving p-adic polynomial systems via iterative eigenvector algorithms

DOI10.1080/03081087.2020.1743633zbMath1485.15011arXiv1907.03740OpenAlexW3013495251MaRDI QIDQ5064503

Avinash Kulkarni

Publication date: 16 March 2022

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

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

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

Related Items

Toric eigenvalue methods for solving sparse polynomial systems, Super-linear convergence in the p -adic QR-algorithm, $p$-Adic Integral Geometry

Uses Software

• Hecke

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Relaxed algorithms for \(p\)-adic numbers
• Exact solution of linear equations using p-adic expansions
• On the complexity of computing determinants
• Random matrix theory over finite fields
• p-Adic Stability In Linear Algebra
• Solving Polynomial Systems via Truncated Normal Forms
• Nemo/Hecke
• Characteristic Polynomials of p-adic Matrices
• On Affine Tropical F5 Algorithms
• Relaxed p-adic Hensel lifting for algebraic systems
• Ideals, Varieties, and Algorithms
• The calculation of Lame polynomials