An alternate algorithm for computing Adomian polynomials in special cases

  • Authors:

  • J. Biazar;E. Babolian;G. Kember;A. Nouri;R. Islam

  • Affiliations:

  • Guilan University, Rasht, Iran and Faculty of Engineering, Dalhousie University, D510, 1360 Barrington Street, P.O. Box 1000, Halifax, NS, Canada;Faculty of Engineering, Dalhousie University, D510, 1360 Barrington Street, P.O. Box 1000, Halifax, NS, Canada B3J 2X4 and University for Teacher Education, Iran;Faculty of Engineering, Dalhousie University, D510, 1360 Barrington Street, P.O. Box 1000, Halifax, NS, Canada;Faculty of Engineering, Dalhousie University, D510, 1360 Barrington Street, P.O. Box 1000, Halifax, NS, Canada;Faculty of Engineering, Dalhousie University, D510, 1360 Barrington Street, P.O. Box 1000, Halifax, NS, Canada

  • Venue:
  • Applied Mathematics and Computation
  • Year:
  • 2003

Quantified Score

Hi-index 0.48

Visualization

Abstract

In this article we introduce an alternate algorithm for computing Adomian polynomials, and present some examples to show the simplicity and efficiency of the new method.