Iterative root approximation in p-adic numerical analysis

DOI10.1016/J.JCO.2009.07.004MaRDI QIDQ1049397zbMATH OpenOpenAlexFDO

Authors Eric Bach

Publication date 12 January 2010

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jco.2009.07.004

zbMATH Keywords

secant methoditerative algorithmspolynomial zeros\(p\)-adic analysisHalley's methodNewtons's methodderivative-free iterationsinverse interpolation method

Mathematics Subject Classification ID

(p)-adic and power series fields (11D88) Real polynomials: location of zeros (26C10) Numerical computation of roots of polynomial equations (65H04) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)

Recommendations

• General approach of the root of a \(p\)-adic number
• Computation of the cubic root of a \(p\)-adic number
• Newton's method for computing the fifth roots of \(p\)-adic numbers
• \(p\)-adic \(q\)th roots via Newton-Raphson method
• scientific article; zbMATH DE number 2177636

Cites work

• scientific article; zbMATH DE number 3874496 (Why is no real title available?)
• scientific article; zbMATH DE number 1200746 (Why is no real title available?)
• scientific article; zbMATH DE number 1302856 (Why is no real title available?)
• scientific article; zbMATH DE number 1418303 (Why is no real title available?)
• scientific article; zbMATH DE number 3265895 (Why is no real title available?)
• scientific article; zbMATH DE number 3269388 (Why is no real title available?)
• scientific article; zbMATH DE number 3279238 (Why is no real title available?)
• scientific article; zbMATH DE number 3304440 (Why is no real title available?)
• scientific article; zbMATH DE number 3307642 (Why is no real title available?)
• scientific article; zbMATH DE number 3398684 (Why is no real title available?)
• scientific article; zbMATH DE number 3187178 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• scientific article; zbMATH DE number 3196340 (Why is no real title available?)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• A basic family of iteration functions for polynomial root finding and its characterizations
• On the Geometry of Halley's Method
• On the order of convergence of a determinantal family of root-finding methods

Cited in

(9)

• Recursive elucidation of polynomial congruences using root-finding numerical techniques
• scientific article; zbMATH DE number 7083447 (Why is no real title available?)
• Newton's method for computing the fifth roots of \(p\)-adic numbers
• On \(p\)-adic differential equations with separation of variables
• Siegel-Shidlovskii method in \(p\)-adic domain
• Computation of the cubic root of a \(p\)-adic number
• Solving \(p\)-adic polynomial systems via iterative eigenvector algorithms
• A note on global Newton iteration over Archimedean and non-Archimedean fields
• \(p\)-adic \(q\)th roots via Newton-Raphson method

This page was built for publication: Iterative root approximation in \(p\)-adic numerical analysis

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