Skip to main content
Erschienen in: Numerical Algorithms 2/2021

14.03.2020 | Original Paper

Nonstationary vs. stationary iterative processes

verfasst von: Luba Sapir, Tamara Kogan, Ariel Sapir, Amir Sapir

Erschienen in: Numerical Algorithms | Ausgabe 2/2021

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper, we define s-nonstationary iterative process and obtain its properties. We prove, that for any one-point iterative process without memory, there exists an s-nonstationary process of the same order, but of higher efficiency by the criteria of Traub and Ostrowski. We supply constructions of s-nonstationary processes for Newton’s, Halley’s, and Chebyshev’s methods, obtain their properties and, for some of them, also their geometric interpretation. The algorithms we present can be transformed into computer programs in a straightforward manner. Additionally, we illustrate numerical examples, as demonstrations for the methods we present.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Amat, S., Busquier, S.: Third-order iterative methods under Kantorovich conditions. J. Math. Anal. Appl. 336(1), 243–261 (2007)MathSciNetCrossRef Amat, S., Busquier, S.: Third-order iterative methods under Kantorovich conditions. J. Math. Anal. Appl. 336(1), 243–261 (2007)MathSciNetCrossRef
2.
Zurück zum Zitat Amat, S., Busquier, S., Plaza, S.: Dynamics of a family of third-order iterative methods that do not require using second derivatives. Appl. Math. Comput. 154, 735–746 (2004)MathSciNetMATH Amat, S., Busquier, S., Plaza, S.: Dynamics of a family of third-order iterative methods that do not require using second derivatives. Appl. Math. Comput. 154, 735–746 (2004)MathSciNetMATH
3.
Zurück zum Zitat Cordero, A., Torregrosa, J.R.: A class of Steffensen type methods with optimal order of convergence. Appl. Math. Comput. 217, 7653–7659 (2011)MathSciNetMATH Cordero, A., Torregrosa, J.R.: A class of Steffensen type methods with optimal order of convergence. Appl. Math. Comput. 217, 7653–7659 (2011)MathSciNetMATH
4.
Zurück zum Zitat Grau, M., Diaz-Barrero, D.-B.J.L.: An improvement to Ostrowski root-finding method. Appl. Math. Comput. 173, 450–456 (2006)MathSciNetMATH Grau, M., Diaz-Barrero, D.-B.J.L.: An improvement to Ostrowski root-finding method. Appl. Math. Comput. 173, 450–456 (2006)MathSciNetMATH
5.
Zurück zum Zitat Gutierrez, J.M., Hernandez, M.A.: An acceleration of Newton’s method: super-Halley method. Appl. Math. Comput. 117, 223–239 (2001)MathSciNetMATH Gutierrez, J.M., Hernandez, M.A.: An acceleration of Newton’s method: super-Halley method. Appl. Math. Comput. 117, 223–239 (2001)MathSciNetMATH
6.
Zurück zum Zitat Halley, E.: A new exact and easy method for finding the roots of equations generally and without any previous reduction. Phil. Roy. Soc. London 18, 136–147 (1964) Halley, E.: A new exact and easy method for finding the roots of equations generally and without any previous reduction. Phil. Roy. Soc. London 18, 136–147 (1964)
7.
Zurück zum Zitat Householder, A.S.: The Numerical Treatment of a Single Nonlinear Equation. McGraw-Hill, New York (1970)MATH Householder, A.S.: The Numerical Treatment of a Single Nonlinear Equation. McGraw-Hill, New York (1970)MATH
8.
Zurück zum Zitat Jain, P., Sethi, K.: Aitken type methods with high efficiency. Tran. A. Razmadze Math. Instit. 172, 223–237 (2018)MathSciNetCrossRef Jain, P., Sethi, K.: Aitken type methods with high efficiency. Tran. A. Razmadze Math. Instit. 172, 223–237 (2018)MathSciNetCrossRef
9.
Zurück zum Zitat Jain, P., Chand, P.B., Sethi, K.: Efficient numerical methods of Aitken type and their dynamics. Eurasian Math. J. 9(3), 58–72 (2018)MathSciNetCrossRef Jain, P., Chand, P.B., Sethi, K.: Efficient numerical methods of Aitken type and their dynamics. Eurasian Math. J. 9(3), 58–72 (2018)MathSciNetCrossRef
10.
Zurück zum Zitat Kantorovich, L.V.: Functional analysis and applied mathematics [Russian]. Uspehi Mathem. Nauk 3, 89–185 (1948)MATH Kantorovich, L.V.: Functional analysis and applied mathematics [Russian]. Uspehi Mathem. Nauk 3, 89–185 (1948)MATH
11.
Zurück zum Zitat Kantorovich, L.V.: On Newton’s method for functional analysis [Russian]. Doklady Akad. Nauk SSSR 59, 1237–1240 (1948)MathSciNetMATH Kantorovich, L.V.: On Newton’s method for functional analysis [Russian]. Doklady Akad. Nauk SSSR 59, 1237–1240 (1948)MathSciNetMATH
12.
Zurück zum Zitat Kogan, T.I.: Generalization of the method of chords for an algebraic or transcendental equation. Tashkent. Gos. Univ. Naučn. Trudy (Russian) Vyp. 276, 53–55 (1966)MathSciNet Kogan, T.I.: Generalization of the method of chords for an algebraic or transcendental equation. Tashkent. Gos. Univ. Naučn. Trudy (Russian) Vyp. 276, 53–55 (1966)MathSciNet
13.
Zurück zum Zitat Kogan, T.I.: Construction of iterative processes of high orders. ž.Vyčisl. Mat. i Mat. Fiz. (Russian) 7, 423–424 (1967) Kogan, T.I.: Construction of iterative processes of high orders. ž.Vyčisl. Mat. i Mat. Fiz. (Russian) 7, 423–424 (1967)
14.
Zurück zum Zitat Kogan, T.I.: On one modification of the method of chords for nonlinear functional equation. Tashkent Sib. Mat. Z. 19(3), 710 (1978) Kogan, T.I.: On one modification of the method of chords for nonlinear functional equation. Tashkent Sib. Mat. Z. 19(3), 710 (1978)
15.
Zurück zum Zitat Kogan, T.I., Sapir, L., Sapir, A.: A nonstationary iterative second-order method for solving nonlinear equations. Appl. Math. Comput. 188, 75–82 (2007)MathSciNetMATH Kogan, T.I., Sapir, L., Sapir, A.: A nonstationary iterative second-order method for solving nonlinear equations. Appl. Math. Comput. 188, 75–82 (2007)MathSciNetMATH
16.
Zurück zum Zitat Kogan, T.I., Sapir, L., Sapir, A., Sapir, A.: The Fibonacci family of iterative processes for solving nonlinear equations. Appl. Numer. Math. 110, 148–158 (2016)MathSciNetCrossRef Kogan, T.I., Sapir, L., Sapir, A., Sapir, A.: The Fibonacci family of iterative processes for solving nonlinear equations. Appl. Numer. Math. 110, 148–158 (2016)MathSciNetCrossRef
17.
Zurück zum Zitat Kogan, T.I., Sapir, L., Sapir, A., Sapir, A.: To the question of efficiency of iterative methods. Appl. Math. Lett. 66, 40–46 (2017)MathSciNetCrossRef Kogan, T.I., Sapir, L., Sapir, A., Sapir, A.: To the question of efficiency of iterative methods. Appl. Math. Lett. 66, 40–46 (2017)MathSciNetCrossRef
18.
20.
Zurück zum Zitat McNamee, J.M., Pan, V.Y.: Efficient polynomial root-finders: a survey and new record efficiency estimates. Comp. Math. with Appl. 63, 239–254 (2012)CrossRef McNamee, J.M., Pan, V.Y.: Efficient polynomial root-finders: a survey and new record efficiency estimates. Comp. Math. with Appl. 63, 239–254 (2012)CrossRef
21.
Zurück zum Zitat McNamee, J.M., Pan, V.Y.: Numerical methods for roots of polynomials – Part II. Studies Comp. Math. 16(ch. 7), 1–138 (2013)MathSciNet McNamee, J.M., Pan, V.Y.: Numerical methods for roots of polynomials – Part II. Studies Comp. Math. 16(ch. 7), 1–138 (2013)MathSciNet
22.
Zurück zum Zitat Al Din Ide, N.: A nonstationary Halley’s iterative method by using divided differences formula. Appl. Math. 3, 169–171 (2012). SCIRPMathSciNetCrossRef Al Din Ide, N.: A nonstationary Halley’s iterative method by using divided differences formula. Appl. Math. 3, 169–171 (2012). SCIRPMathSciNetCrossRef
23.
Zurück zum Zitat Ortega, J.M., Rheinboldt, W.C.: Iterative Solution on Nonlinear Equations in Several Variables. Academic Press, New York (1970)MATH Ortega, J.M., Rheinboldt, W.C.: Iterative Solution on Nonlinear Equations in Several Variables. Academic Press, New York (1970)MATH
24.
Zurück zum Zitat Ostrowski, A.M.: Solution of Equations and Systems of Equations. Academic Press, New York (1960)MATH Ostrowski, A.M.: Solution of Equations and Systems of Equations. Academic Press, New York (1960)MATH
25.
Zurück zum Zitat Ostrowski, A.M.: Solution of Equations in Euclidean and Banach Spaces. Academic Press, New York (1973)MATH Ostrowski, A.M.: Solution of Equations in Euclidean and Banach Spaces. Academic Press, New York (1973)MATH
26.
Zurück zum Zitat Phiri, P.A., Makinde, O.D.: A new derivative-free method for solving nonlinear equations. Int. J. Physical Sci. 5(7), 935–939 (2018) Phiri, P.A., Makinde, O.D.: A new derivative-free method for solving nonlinear equations. Int. J. Physical Sci. 5(7), 935–939 (2018)
27.
Zurück zum Zitat Hernández, M.A., Rubio, M.J.: A new type of recurrence relations for the secant method. Int. J. Comput. Math. 72(4), 477–490 (1999)MathSciNetCrossRef Hernández, M.A., Rubio, M.J.: A new type of recurrence relations for the secant method. Int. J. Comput. Math. 72(4), 477–490 (1999)MathSciNetCrossRef
28.
Zurück zum Zitat Sergeev, A.S.: On the method of chords [Russian]. Sib. Mat. Z. 2, 282–289 (1961) Sergeev, A.S.: On the method of chords [Russian]. Sib. Mat. Z. 2, 282–289 (1961)
31.
Zurück zum Zitat Traub, J.F.: Iterative Methods for the Solution of Equations. Prentice Hall, Engelwood Cliffs (1964)MATH Traub, J.F.: Iterative Methods for the Solution of Equations. Prentice Hall, Engelwood Cliffs (1964)MATH
32.
Zurück zum Zitat Wall, D.: Fourth-order iterative method free from second derivative for solving nonlinear equations. Math. Comp. 10, 167–168 (1956) Wall, D.: Fourth-order iterative method free from second derivative for solving nonlinear equations. Math. Comp. 10, 167–168 (1956)
Metadaten
Titel
Nonstationary vs. stationary iterative processes
verfasst von
Luba Sapir
Tamara Kogan
Ariel Sapir
Amir Sapir
Publikationsdatum
14.03.2020
Verlag
Springer US
Erschienen in
Numerical Algorithms / Ausgabe 2/2021
Print ISSN: 1017-1398
Elektronische ISSN: 1572-9265
DOI
https://doi.org/10.1007/s11075-020-00899-5

Weitere Artikel der Ausgabe 2/2021

Numerical Algorithms 2/2021 Zur Ausgabe