Numerical study of an adaptive domain decomposition algorithm based on Chebyshev tau method for solving singular perturbed problems

Wenting Shao*, Xionghua Wu, Cheng Wang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

It is known that spectral methods offer exponential convergence for infinitely smooth solutions. However, they are not applicable for problems presenting singularities or thin layers, especially true for the ones with the location of singularity unknown. An adaptive domain decomposition method (DDM) integrated with Chebyshev tau method based on the highest derivative (CTMHD) is introduced to solve singular perturbed boundary value problems (SPBVPs). The proposed adaptive algorithm uses the refinement indicators based on Chebyshev coefficients to determine which subintervals need to be refined. Numerical experiments have been conducted to demonstrate the superior performance of the method for SPBVPs with a number of singularities including boundary layers, interior layers and dense oscillations. A fourth order nonlinear SPBVP is also concerned. The numerical results illustrate the efficiency and applicability of our adaptive algorithm to capture the locations of singularities, and the higher accuracy in comparison with some existing numerical methods in the literature.

Original languageEnglish
Pages (from-to)19-32
Number of pages14
JournalApplied Numerical Mathematics
Volume118
DOIs
Publication statusPublished - 1 Aug 2017

Keywords

  • Adaptive domain decomposition algorithm
  • Chebyshev tau method
  • Singular perturbations
  • The highest derivative

Fingerprint

Dive into the research topics of 'Numerical study of an adaptive domain decomposition algorithm based on Chebyshev tau method for solving singular perturbed problems'. Together they form a unique fingerprint.

Cite this