Skip to main content
Log in

Multiplicative Adams Bashforth–Moulton methods

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

The multiplicative version of Adams Bashforth–Moulton algorithms for the numerical solution of multiplicative differential equations is proposed. Truncation error estimation for these numerical algorithms is discussed. A specific problem is solved by methods defined in multiplicative sense. The stability properties of these methods are analyzed by using the standart test equation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bashirov, A.E., Misirli Kurpinar, E., Ozyapici, A.: Multiplicative calculus and its applications. J. Math. Anal. Appl. 337, 36–48 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Aniszewska, D.: Multiplicative runge-kutta methods. Nonlinear Dyn. 50, 265–272 (2007)

    Article  MATH  Google Scholar 

  3. Grossman, M.: Bigeometric Calculus, a System with a Scale-free Derivative. Archimedes Foundation, Rockport (1983)

    Google Scholar 

  4. Grossman, M., Katz, R.: Non-Newtonian Calculus. Lee Press, Pigeon Cove, Massachusats (1972)

  5. Riza, M., Ozyapici, A., Misirli, E.: Multiplicative Finite Difference Methods. Q. Appl. Math. 67, 745–754 (2009)

    MathSciNet  MATH  Google Scholar 

  6. Suli, E., Mayers, D.F.: An Introduction to Numerical Analysis. Cambridge University Press, Cambridge (2003)

    Google Scholar 

  7. Butcher, J.C.: Numerical Methods for Ordinary Differential Equations. Wiley, Chichester (2003)

    Book  MATH  Google Scholar 

  8. Misirli, E., Ozyapici, A.: Exponential approximations on multiplicative calculus. Proc. Jangjeon Math. Soc. 12, 227–236 (2009)

    MathSciNet  MATH  Google Scholar 

  9. Dahlquist, G.G.: A special stability problem for linear multistep methods. BIT 3, 27–43 (1963)

    Article  MathSciNet  MATH  Google Scholar 

  10. Ehle, B.L.: On Pade approximations to the exponential function and a-stable methods for the numerical solution of initial value problems. Report 2010, University of Waterloo (1969)

  11. Volterra, V., Hostinsky, B.: Operations Infinitesimales Lineares. Herman, Paris (1938).

    Google Scholar 

  12. Aniszewska, D., Rybaczuk, M.: Lyapunov type stability and Lyapunov exponent for exemplary multiplicative dynamical systems. Nonlinear Dyn. 54, 345–354 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Rybaczuk, M., Stoppel, P.: The fractal growth of fatigue defects in materials. Int. J. Fract. 103, 71–94 (2000)

    Article  Google Scholar 

  14. Nottale, L.: Scale, relativity and fractal spacetime: applications to quantum physics, cosmology and chaotic systems. Chaos Soliton Fract. 7, 877–938 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  15. DAmbrosio, R., Ferro, M., Jackiewicz, Z., Paternoster, B.: Two-step almost collocation methods for ordinary differential equations. Numer. Algorithms 54, 169–193 (2010)

    Article  MathSciNet  Google Scholar 

  16. Khaliq, A.Q.M., Twizell, E.H.: Stability regions for one-step multiderivative methods in PECE mode with application to stiff systems. Int. J. Comput. Math. 17, 323–338 (1985)

    Article  MATH  Google Scholar 

  17. Prothero, A., Robinson, A.: On the stability and the accuracy of one-step methods for solving stiff systems of ordinary differential equations. Math. Comput. 28, 145–162 (1974)

    Article  MathSciNet  Google Scholar 

  18. Lambert, J.D.: Computational Methods in Ordinary Differential Equations, xv+278 pp. Wiley, Chichester (1973)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yusuf Gurefe.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Misirli, E., Gurefe, Y. Multiplicative Adams Bashforth–Moulton methods. Numer Algor 57, 425–439 (2011). https://doi.org/10.1007/s11075-010-9437-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-010-9437-2

Keywords

Navigation