Metraipolis › archive › dc_0b18319f06cb

Proof of the Cordero-Torregrosa Conjecture and an Improved Order Bound for Paired Jacobian Evaluations — arXiv:2611.08801

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.08801
License (as archived)
CC0-1.0
Archived
2026-11-09T22:43:25.832Z
SHA-256 of the archived text
497d18bd736379612b1e49cdfc132234df73af9e506f72a9cb3a2cbea5aaa7cd
Stable URL of this page
https://metraipolis.com/documento/dc_0b18319f06cb

How to cite

Proof of the Cordero-Torregrosa Conjecture and an Improved Order Bound for Paired Jacobian Evaluations — arXiv:2611.08801 — arXiv (en), https://arxiv.org/abs/2611.08801 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0b18319f06cb (Metraipolis archive dc_0b18319f06cb, sha256 497d18bd736379612b1e49cdfc132234df73af9e506f72a9cb3a2cbea5aaa7cd)
BibTeX
@misc{dc0b18319f06cb,
  title = {Proof of the Cordero-Torregrosa Conjecture and an Improved Order Bound for Paired Jacobian Evaluations — arXiv:2611.08801},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.08801},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0b18319f06cb; sha256 497d18bd736379612b1e49cdfc132234df73af9e506f72a9cb3a2cbea5aaa7cd},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08801. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In solving systems of nonlinear equations, one of the main objectives is to construct iterative methods that attain high orders of convergence using as few evaluations as possible. However, the information a method obtains during each iteration imposes limitations on the order it can guarantee. The Cordero--Torregrosa conjecture proposes a bound on this order in terms of the number of evaluations of the function and its Jacobian. In this work, we prove this bound for the universal local order of one iteration, without requiring the number of Jacobian evaluations to be less than or equal to the number of function evaluations. In particular, our result also covers the case in which more evaluations of the Jacobian than of the function are performed. The proof encompasses deterministic, causal, memoryless methods whose rules may be arbitrary, without imposing rationality, continuity, or computability conditions. Moreover, we prove that when each Jacobian evaluation is performed at a point where the value of the function is already known, a more restrictive bound on the order of convergence can be obtained. Finally, we propose a new conjecture that establishes a refined bound through a product of factors determined by the distribution of evaluations, under additional dimensional conditions. These results provide a better understanding of the limitations imposed by the available information and raise new possibilities for studying high-order iterative methods.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.NA, nuovi lavori del giorno).
Categorie arXiv: Numerical Analysis (math.NA).
Pagina del lavoro: https://arxiv.org/abs/2611.08801 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-09T22:36:17.229Z dalla pagina https://arxiv.org/list/math.NA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).