Pith. sign in

REVIEW 1 cited by

Backtracking New Q-Newton's method, Schr\"oder's theorem, and Linear Conjugacy

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.12166 v1 pith:TPXIPHHK submitted 2023-12-19 math.DS cs.NAmath.CVmath.NAmath.OC

classification math.DScs.NAmath.CVmath.NAmath.OC
keywords bnqnmethoddynamicsnewtonbasinsfindingoderpolynomials
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

A new variant of Newton's method - named Backtracking New Q-Newton's method (BNQN) - which has strong theoretical guarantee, is easy to implement, and has good experimental performance, was recently introduced by the third author. Experiments performed previously showed some remarkable properties of the basins of attractions for finding roots of polynomials and meromorphic functions using BNQN. In particular, it seems that for finding roots of polynomials of degree 2, the basins of attraction of the dynamics for BNQN are the same as that for Newton's method (the latter is the classical Schr\"oder's result in Complex Dynamics). In this paper, we show that indeed the picture we obtain when finding roots of polynomials of degree 2 is the same as that in Sch\"oder's result, with a remarkable difference: on the boundary line of the basins, the dynamics of Newton's method is chaotic, while the dynamics of BNQN is more smooth. On the way to proving the result, we show that BNQN (in any dimension) is invariant under conjugation by linear operators of the form $A=cR$, where $R$ is unitary and $c>0$ a constant. This again illustrates the similarity-difference relation between BNQN and Newton's method.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Some iterative algorithms on Riemannian manifolds and Banach spaces with good global convergence guarantee

    math.OC 2025-05 reject novelty 6.0 of 10

    New retraction-based backtracking gradient and Newton-type algorithms on Riemannian manifolds and Banach spaces are claimed to converge to local minima and to avoid saddle points for random starting points.

Pith tools