Iterative root approximation in \(p\)-adic numerical analysis (Q1049397): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jco.2009.07.004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2045163138 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5553606 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5585752 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3340031 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5732060 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5550483 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Algorithm for Factoring Polynomials Over Finite Fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5588717 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4210105 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5732721 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5563439 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5723445 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5666071 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Geometry of Halley's Method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A basic family of iteration functions for polynomial root finding and its characterizations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the order of convergence of a determinantal family of root-finding methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4249341 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4941863 / rank | |||
Normal rank |
Latest revision as of 09:26, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Iterative root approximation in \(p\)-adic numerical analysis |
scientific article |
Statements
Iterative root approximation in \(p\)-adic numerical analysis (English)
0 references
12 January 2010
0 references
The author studies various iterative algorithms related to Newton's method for approximating an isolated \(p\)-adic zero of a polynomial with \(p\)-adic coefficients. Asymptotic cost coefficients are listed for Newton's method, the secant method, Halley's method, two deformations of Halley's method and an inverse interpolation method. It is found with asymptotically efficient arithmetic that the secant method matches Newton's method and it is the best of the derivative-free iterations studied in this paper. On the other hand, Newton's method is asymptotically inferior to a variation of Halley's method and to the interpolation method, both of which use first derivatives. An explicit condition that guarantees convergence is found for each of the six methods.
0 references
polynomial zeros
0 references
\(p\)-adic analysis
0 references
iterative algorithms
0 references
Newtons's method
0 references
secant method
0 references
Halley's method
0 references
inverse interpolation method
0 references
derivative-free iterations
0 references
0 references