References
- K.T. Alligood, T.D. Sauer, and J.A. Yorke, Chaos: An Introduction to Dynamical Systems, Springer-Verlag, New York, 1997.
- D. Bansal, H. Balakrishnan, S. Floyd, and S. Shenker, Dynamic behavior of slowly-responsive congestion control algorithms, ACM SIGCOMM Comput. Commun. Rev. 31(4) (2001), pp. 263–274. doi: 10.1145/964723.383080
- J.P. Boyd, The devil's invention: Asymptotic, superasymptotic and hyperasymptotic series, Acta Appl. Math. 56(1) (1999), pp. 1–98. doi: 10.1023/A:1006145903624
- C. Cartis, N.I.M. Gould, and Ph.L. Toint, On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems, SIAM J. Optim. 20(6) (2010), pp. 2833–2852. doi: 10.1137/090774100
- E.T. Copson, Asymptotic Expansions, Cambridge Tracts in Mathematics, Vol. 55, Cambridge University Press, Cambridge, 1965.
- F.M. Dannan, S.N. Elaydi, and V. Ponomarenko, Stability of hyperbolic and nonhyperbolic fixed points of one-dimensional maps, J. Differ. Equ. Appl. 9(5) (2003), pp. 449–457. doi: 10.1080/1023619031000078315
- M.J. Feigenbaum, Quantitative universality for a class of nonlinear transformations, J. Stat. Phys. 19(1) (1978), pp. 25–52. doi: 10.1007/BF01020332
- M.J. Feigenbaum, The universal metric properties of nonlinear transformations, J. Stat. Phys. 21(6) (1979), pp. 669–706. doi: 10.1007/BF01107909
- S.D. Galbraith, Mathematics of public key cryptography, Cambridge University Press, Cambridge, 2012.
- N.I.M. Gould, D. Orban, and D.P. Robinson, Trajectory-following methods for large-scale degenerate convex quadratic programming, Math. Prog. Comp. 5(2) (2013), pp. 113–142. doi: 10.1007/s12532-012-0050-3
- B.-L. Hao, Universal slowing-down exponent near period-doubling bifurcation points, Phys. Lett. A 86(5) (1981), pp. 267–268. doi: 10.1016/0375-9601(81)90362-5
- B.-L. Hao and W.-M. Zheng, Applied Symbolic Dynamics and Chaos, Directions in Chaos, Vol. 7, World Scientific Pub. Co. Inc., Singapore, 1998.
- J. Hass, J.C. Lagarias, and N. Pippenger, The computational complexity of knot and link problems, JACM 46(2) (1999), pp. 185–211. doi: 10.1145/301970.301971
- B. Hoyos, J.G. Cadavid, and H. Rangel, Formulation and numeric calculation of non-isothermal effectiveness factor for finite cylindrical catalysts with bi-dimensional diffusion, Lat. Am. Appl. Res. 34(1) (2004), pp. 17–22.
- K.S. Kedlaya, The algebraic closure of the power series field in positive characteristic, Proc. Amer. Math. Soc. 129(12) (2001), pp. 3461–3470. doi: 10.1090/S0002-9939-01-06001-4
- B. Korte and J. Vygen, Combinatorial Optimization Theory and Algorithms, 5th ed., Algorithms and Combinatorics, Vol. 21, Springer, Berlin, 2012.
- Y.J. Liu and Y.X. Li, Slow convergence of the BEM with constant elements in solving beam bending problems, Eng. Anal. Boundary Elem. 39 (2014), pp. 1–4. doi: 10.1016/j.enganabound.2013.10.016
- F.J. Solis and R. Felipe, Slow convergence of maps, Nonlinear Stud. 8(3) (2001), pp. 389–394.
- F.J. Solis and L.J. Sánchez, Nonisolated slow convergence in discrete dynamical systems, Appl. Math. Lett. 17(5) (2004), pp. 597–599. doi: 10.1016/S0893-9659(04)90132-2
- F.J. Solis, L. Jodar, and B. Chen, Chaos in the one-dimensional wave equation, Appl. Math. Lett. 18(1) (2005), pp. 85–90. doi: 10.1016/j.aml.2003.06.014
- V. Ponomarenko, Faa di Bruno's formula and nonhyperbolic fixed points of one-dimensional maps, Internat. J. Math. Math. Sci. 2004(29) (2004), pp. 1543–1549. doi: 10.1155/S0161171204306253
- C.A. Voigt, D.B. Gordon, and S.L. Mayo, Trading accuracy for speed: A quantitative comparison of search algorithms in protein sequence design, J. Mol. Biol. 299(3) (2000), pp. 789–803. doi: 10.1006/jmbi.2000.3758
- E.T. Whittaker and G.N. Watson, A Course of Modern Analysis, 4th ed., Cambridge Mathematical Library Cambridge University Press, Cambridge, 1996.