Reducing the polynomial-like iterative equations order and a generalized Zolt\'an Boros' problem
Szymon Draga, Janusz Morawiec

TL;DR
This paper introduces a technique to reduce the order of polynomial-like iterative equations by analyzing the asymptotic behavior of iterates, successfully solving a problem posed by Zoltán Boros.
Contribution
It provides a novel method for simplifying polynomial-like iterative equations and addresses a previously open question in the field.
Findings
Effective order reduction technique demonstrated
Solved Boros' problem from 2012
Applicable to a class of polynomial-like equations
Abstract
We present a technique for reducing the order of polynomial-like iterative equations; in particular, we answer a question asked by Wenmeng Zhang and Weinian Zhang. Our method involves the asymptotic behaviour of the sequence of consecutive iterates of the unknown function at a given point. As an application we solve a problem of Zolt\'an Boros posed during the 50th ISFE (2012).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFunctional Equations Stability Results · Multi-Criteria Decision Making · Advanced Optimization Algorithms Research
