- Journal Home
- Volume 21 - 2024
- Volume 20 - 2023
- Volume 19 - 2022
- Volume 18 - 2021
- Volume 17 - 2020
- Volume 16 - 2019
- Volume 15 - 2018
- Volume 14 - 2017
- Volume 13 - 2016
- Volume 12 - 2015
- Volume 11 - 2014
- Volume 10 - 2013
- Volume 9 - 2012
- Volume 8 - 2011
- Volume 7 - 2010
- Volume 6 - 2009
- Volume 5 - 2008
- Volume 4 - 2007
- Volume 3 - 2006
- Volume 2 - 2005
- Volume 1 - 2004
Int. J. Numer. Anal. Mod., 21 (2024), pp. 353-374.
Published online: 2024-05
Cited by
- BibTex
- RIS
- TXT
This paper presents a direct method for efficiently solving three-dimensional elliptic interface problems featuring piecewise constant coefficients with a finite jump across the interface. A key advantage of our approach lies in its avoidance of augmented variables, distinguishing it from traditional methods. The computational framework relies on a finite difference scheme implemented on a uniform Cartesian grid system. By utilizing a seven-point Laplacian for grid points away from the interface, our method only requires coefficient modifications for grid points located near or on the interface. Numerical experiments validate our method’s effectiveness. Generally, it achieves second-order accuracy for both the solution and its gradient, measured in the maximum norm, particularly effective in scenarios with moderate coefficient jumps. Extending and building upon the recent work of [1] on 1D and 2D elliptic interfaces, our approach successfully introduces a simpler method for extension into three dimensions. Notably, our proposed method not only offers efficiency and accuracy but also enhances the simplicity of implementation, making it accessible to non-experts in the field.
}, issn = {2617-8710}, doi = {https://doi.org/10.4208/ijnam2024-1014}, url = {http://global-sci.org/intro/article_detail/ijnam/23128.html} }This paper presents a direct method for efficiently solving three-dimensional elliptic interface problems featuring piecewise constant coefficients with a finite jump across the interface. A key advantage of our approach lies in its avoidance of augmented variables, distinguishing it from traditional methods. The computational framework relies on a finite difference scheme implemented on a uniform Cartesian grid system. By utilizing a seven-point Laplacian for grid points away from the interface, our method only requires coefficient modifications for grid points located near or on the interface. Numerical experiments validate our method’s effectiveness. Generally, it achieves second-order accuracy for both the solution and its gradient, measured in the maximum norm, particularly effective in scenarios with moderate coefficient jumps. Extending and building upon the recent work of [1] on 1D and 2D elliptic interfaces, our approach successfully introduces a simpler method for extension into three dimensions. Notably, our proposed method not only offers efficiency and accuracy but also enhances the simplicity of implementation, making it accessible to non-experts in the field.