Transparent boundary conditions and numerical computation for singularly perturbed telegraph equation on unbounded domain (Q777497): Difference between revisions

The asymptotic behavior of the solution for the singularly perturbed telegraph equation is studied on an unbounded domain by matched asymptotic expansions. A reduced initial-boundary value problem is introduced by deriving the transparent boundary conditions (TBCs) at the artificial boundaries, which is equivalent to the original problem on the bounded computational domain. The reduced problem is solved using Crank-Nicolson Galerkin scheme incorporated with the exponential wave integrator technique. The uniform convergence rate of the Crank-Nicolson Galerkin scheme is found to be \({\mathcal O}(h+\tau^\gamma)\) with \(0.4 \le\gamma\le 1\). The reliability and efficiency of the TBCs are shown in the numerical examples and the convergence rates of the Crank-Nicolson Galerkin scheme are validated.