A new domain decomposition algorithm for generalized Burger’s–Huxley equation based on Chebyshev polynomials and preconditioning

M. Javidi and A. Golbabai

Chaos, Solitons & Fractals, 2009, vol. 39, issue 2, 849-857

Abstract: In this study, we use the spectral collocation method using Chebyshev polynomials for spatial derivatives and fourth order Runge–Kutta method for time integration to solve the generalized Burger’s–Huxley equation (GBHE). To reduce round-off error in spectral collocation (pseudospectral) method we use preconditioning. Firstly, theory of application of Chebyshev spectral collocation method with preconditioning (CSCMP) and domain decomposition on the generalized Burger’s–Huxley equation presented. This method yields a system of ordinary differential algebric equations (DAEs). Secondly, we use fourth order Runge–Kutta formula for the numerical integration of the system of DAEs. The numerical results obtained by this way have been compared with the exact solution to show the efficiency of the method.

Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S096007790700166X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:chsofr:v:39:y:2009:i:2:p:849-857

DOI: 10.1016/j.chaos.2007.01.099

Access Statistics for this article

Chaos, Solitons & Fractals is currently edited by Stefano Boccaletti and Stelios Bekiros

More articles in Chaos, Solitons & Fractals from Elsevier
Bibliographic data for series maintained by Thayer, Thomas R. ().