Iterative root approximation in \(p\)-adic numerical analysis

DOI10.1016/j.jco.2009.07.004zbMath1184.65051OpenAlexW2045163138MaRDI QIDQ1049397

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

iterative algorithmsHalley's methodpolynomial zerossecant method\(p\)-adic analysisNewtons's methodderivative-free iterationsinverse interpolation method

Mathematics Subject Classification ID

Related Items (1)

Recursive elucidation of polynomial congruences using root-finding numerical techniques

Cites Work

• On the order of convergence of a determinantal family of root-finding methods
• A basic family of iteration functions for polynomial root finding and its characterizations
• A New Algorithm for Factoring Polynomials Over Finite Fields
• On the Geometry of Halley's Method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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