- 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
Cited by
- BibTex
- RIS
- TXT
Previous theoretical and computational investigations have shown high efficiency of the local Green's function method for the numerical solution of singularly perturbed problems with sharp boundary layers. However, in several space variables those functions, used as projectors in the Petrov-Galerkin scheme, cannot be derived in a closed analytical form. This is an obstacle for the application of the method when applied to multi-dimensional problems. The present work proposes a semi-analytical approach to calculate the local Green's function, which opens a way to effective practical application of the method. Besides very accurate approximation, the matrix stencils obtained with these functions allow the use of fast and stable iterative solution of the large sparse algebraic systems that arise from the grid-discretization. The advantages of the method are illustrated by numerical examples.
}, issn = {2617-8710}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/ijnam/925.html} }Previous theoretical and computational investigations have shown high efficiency of the local Green's function method for the numerical solution of singularly perturbed problems with sharp boundary layers. However, in several space variables those functions, used as projectors in the Petrov-Galerkin scheme, cannot be derived in a closed analytical form. This is an obstacle for the application of the method when applied to multi-dimensional problems. The present work proposes a semi-analytical approach to calculate the local Green's function, which opens a way to effective practical application of the method. Besides very accurate approximation, the matrix stencils obtained with these functions allow the use of fast and stable iterative solution of the large sparse algebraic systems that arise from the grid-discretization. The advantages of the method are illustrated by numerical examples.