Abstract
In this paper, a modified version of Adomian's decomposition algorithm is introduced. The modified algorithm is adapted for solving the Korteweg-de Vries equation. Severa1 special cases of the KdV equation me solved using the technique. It is shown that the method yields a highly accurate and rapidly converging scheme. Most of the symbolic and the numerica1 computations are performed using the Computer Algebra System-Maple.
∗Department of Computer and Mathematical and Sciences, University of Houston -Downtown, One Main Street, Houston, TX 77002
∗Department of Computer and Mathematical and Sciences, University of Houston -Downtown, One Main Street, Houston, TX 77002
∗Department of Computer and Mathematical and Sciences, University of Houston -Downtown, One Main Street, Houston, TX 77002
∗Department of Computer and Mathematical and Sciences, University of Houston -Downtown, One Main Street, Houston, TX 77002
Notes
∗Department of Computer and Mathematical and Sciences, University of Houston -Downtown, One Main Street, Houston, TX 77002
∗Department of Computer and Mathematical and Sciences, University of Houston -Downtown, One Main Street, Houston, TX 77002