×

Existence, uniqueness and stability of \(C^m\) solutions of iterative functional equations. (English) Zbl 0999.39020

Summary: In this paper we discuss a relatively general kind of iterative functional equation \(G(x,f(x),\dots,f^n(x))= 0\) (for all \(x\in J\)), where \(J\) is a connected closed subset of the real number axis \(\mathbb{R}\), \(G\in C^m(J^{n+1},\mathbb{R})\), and \(n\geq 2\). Using the method of approximating fixed points by small shift of maps, choosing suitable metrics on functional spaces and finding a relation between uniqueness and stability of fixed points of maps of general spaces, we prove the existence, uniqueness and stability of \(C^m\) solutions of the above equation for any integer \(m\geq 0\) under relatively weak conditions, and generalize related results in reference in different aspects.

MSC:

39B12 Iteration theory, iterative and composite equations
39B82 Stability, separation, extension, and related topics for functional equations
Full Text: DOI

References:

[1] Kuczma, M., Fractional iteration of differentiable functions, Ann. Polon. Math., 22, 217-217 (1969) · Zbl 0185.29403
[2] Jmzyk, W., A recurrent method of solving iterative functional equations (1991), Katowice: Silesia Univ. Press, Katowice · Zbl 0741.39006
[3] Rice, R. E.; Schweizer, B.; Sklar, A., When isf(f(z)) = az^2 +bz + c, Amer. Math. Monthly, 87, 252-252 (1980) · Zbl 0441.30033 · doi:10.2307/2321556
[4] Mukhejea, A.; Ratti, J. S., On a functional equation involving iterates of a bijection on the unit interval, Nonlinear Analysis, 7, 899-899 (1983) · Zbl 0518.39005 · doi:10.1016/0362-546X(83)90065-2
[5] Zhang, W. N., Discussion on the existence of solutions of the iterated equation \(\sum\nolimits_{i = 1}^n {\lambda_i f}^i (x) = F(x)\), Chin. Sci. Bull. (in Chinese), 31, 17, 1290-1290 (1986)
[6] Zhang, W. N., Discussion on the iterated equation \(\sum\nolimits_{i = 1}^n {\lambda_i f}^i (x) = F(x)\), Chin. Sci. Bull., 32, 21, 1444-1444 (1987) · Zbl 0639.39006
[7] Zhang, W. N., Stability of the solutions of the iterated equation \(\sum\nolimits_{i = 1}^n {\lambda_i f}^i (x) = F(x)\), Acta Math. Sinica, 8, 4, 421-421 (1988) · Zbl 0664.39004
[8] Zhang, W. N., Discussion on the differentiable solutions of the iterated equation \(\sum\nolimits_{i = 1}^n {\lambda_i f}^i (x) = F(x)\), Nonlinear Analysis, 15, 4, 387-387 (1990) · Zbl 0717.39005 · doi:10.1016/0362-546X(90)90147-9
[9] Si, J. G., C^2 solutions of the iterated equation \(\sum\nolimits_{i = 1}^n {\lambda_i f}^i (x) = F(x)\), Acta Math. Sinica (in Chinese), 36, 348-348 (1993) · Zbl 0783.39004
[10] Si, J. G., Continuous solutions of the iterated equationG(f(x),f^n,(x),...,f^x(x)) =F(x), J. Math. Res. Expositions (in Chinese), 15, 1, 149-149 (1995) · Zbl 0833.39006
[11] Si, J. G., Discussion onC^1 solutions of a class of functional equations, Acta Math. Sinica (in Chinese), 39, 2, 247-247 (1996) · Zbl 0863.39008
[12] Si, J. G.; Zhang, W. N., OnC^2 solutions of a functional equation, Acta Math. Sinica (in Chinese), 41, 5, 1061-1061 (1998) · Zbl 1015.39007
[13] Mai, J. H., On general solutions of the iterated functional equationf^2(x) =af(x) + bx, J. Math. Res. Expositions (in Chinese), 17, 1, 83-83 (1997) · Zbl 0907.39022
[14] Zhang, J. Z.; Yang., L.; Zhang, W. N., Some advances on functional equations, Adv Math. Chin., 24, 5, 385-385 (1995) · Zbl 0862.39009
[15] Dhgundji, J.; Granas, A., Fixed Point Theory (1982), Warssawa: PWN-Polish Scientific Publishers, Warssawa · Zbl 0483.47038
[16] Kelley, J. L., General Topology (1975), New York: Springer-Verlag, New York · Zbl 0306.54002
[17] Munkres, J. R., Topology, Englewod Cliffs (1975), New Jersey: Prentice-Hall, Inc., New Jersey · Zbl 0306.54001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.