Abstract
In multi-dimension problems, huge sparse matrices must be calculated according to Crank-Nicolson (CN) procedure which results in degeneration of efficiency and accuracy. Based on the iterated CN procedure, domain decomposition method, an alternative scheme is proposed for the termination of unbounded uniform finite-difference time-domain domains. Meanwhile, absorbing boundary condition is proposed in the iterated CN procedure which is incorporated with the higher order concept. The proposed scheme employs the explicit scheme during the calculation rather than the implicit one. Thus, the calculation of matrices can be avoided. It shows the advantages especially in efficiency and accuracy compared with implicit schemes. Such conclusion can be further demonstrated through the numerical example. From results, it can be concluded that the proposed scheme shows efficiency improvement and accurate maintenance. Compared with other procedures, it also holds its considerable effectiveness in nonuniform domains. For comparison, it can maintain considerable performance compared with the others.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Journal on Multiscale and Multiphysics Computational Techniques
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
