Iterative root approximation in p-adic numerical analysis

DOI10.1016/J.JCO.2009.07.004zbMATH Open1184.65051OpenAlexW2045163138MaRDI QIDQ1049397FDOQ1049397

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the Geometry of Halley's Method
• Title not available (Why is that?)
• A basic family of iteration functions for polynomial root finding and its characterizations
• On the order of convergence of a determinantal family of root-finding methods
• Title not available (Why is that?)

Cited In (9)

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

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)