An Unconditionally Stable Parallel Difference Scheme for Telegraph Equation

Abstract

We use an unconditionally stable parallel difference scheme to solve telegraph equation. This method is based on domain decomposition concept and using asymmetric Saul'yev schemes for internal nodes of each sub-domain and alternating group implicit method for sub-domain's interfacial nodes. This new method has several advantages such as: good parallelism, unconditional stability and better accuracy than original Saul'yev schemes. The details of implementation and proving stability are briefly discussed. Numerical experiments on stability and accuracy are also presented.