An unconditionally stable parallel difference scheme for telegraph equation (Q1036512): Difference between revisions
From MaRDI portal
Latest revision as of 03:38, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An unconditionally stable parallel difference scheme for telegraph equation |
scientific article |
Statements
An unconditionally stable parallel difference scheme for telegraph equation (English)
0 references
13 November 2009
0 references
Summary: We use an unconditionally stable parallel difference scheme to solve telegraph equation. This method is based on the domain decomposition concept and uses asymmetric Saul'yev schemes for internal nodes of each sub-domain and the alternating group implicit method for interfacial nodes of the sub-domains. This new method has several advantages, such as: good parallelism, unconditional stability and better accuracy than the original Saul'yev schemes. The details of the implementation and the proof of stability are briefly discussed. Numerical experiments on stability and accuracy are also presented.
0 references
telegraph equation
0 references
Saul'yev method
0 references
0 references
0 references
0 references