- Journal Home
- Volume 39 - 2021
- Volume 38 - 2020
- Volume 37 - 2019
- Volume 36 - 2018
- Volume 35 - 2017
- Volume 34 - 2016
- Volume 33 - 2015
- Volume 32 - 2014
- Volume 31 - 2013
- Volume 30 - 2012
- Volume 29 - 2011
- Volume 28 - 2010
- Volume 27 - 2009
- Volume 26 - 2008
- Volume 25 - 2007
- Volume 24 - 2006
- Volume 23 - 2005
- Volume 22 - 2004
- Volume 21 - 2003
- Volume 20 - 2002
- Volume 19 - 2001
- Volume 18 - 2000
- Volume 17 - 1999
- Volume 16 - 1998
- Volume 15 - 1997
- Volume 14 - 1996
- Volume 13 - 1995
- Volume 12 - 1994
- Volume 11 - 1993
- Volume 10 - 1992
- Volume 9 - 1991
- Volume 8 - 1990
- Volume 7 - 1989
- Volume 6 - 1988
- Volume 5 - 1987
- Volume 4 - 1986
- Volume 3 - 1985
- Volume 2 - 1984
- Volume 1 - 1983
Error Analysis for a Fast Numerical Method to a Boundary Integral Equation of the First Kind
- BibTex
- RIS
- TXT
@Article{JCM-26-56,
author = {},
title = {Error Analysis for a Fast Numerical Method to a Boundary Integral Equation of the First Kind},
journal = {Journal of Computational Mathematics},
year = {2008},
volume = {26},
number = {1},
pages = {56--68},
abstract = { For two-dimensional boundary integral equations of the first kind with logarithmic kernels, the use of the conventional boundary element methods gives linear systems with dense matrix. In a recent work [{\em J. Comput. Math.}, 22 (2004), pp. 287-298], it is demonstrated that the dense matrix can be replaced by a sparse one if appropriate graded meshes are used in the quadrature rules. The numerical experiments also indicate that the proposed numerical methods require less computational time than the conventional ones while the formal rate of convergence can be preserved. The purpose of this work is to establish a stability and convergence theory for this fast numerical method. The stability analysis depends on a decomposition of the coefficient matrix for the collocation equation. The formal orders of convergence observed in the numerical experiments are proved rigorously.},
issn = {1991-7139},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jcm/8610.html}
}
TY - JOUR
T1 - Error Analysis for a Fast Numerical Method to a Boundary Integral Equation of the First Kind
JO - Journal of Computational Mathematics
VL - 1
SP - 56
EP - 68
PY - 2008
DA - 2008/02
SN - 26
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jcm/8610.html
KW - Boundary integral equation
KW - Collocation method
KW - Graded mesh
AB - For two-dimensional boundary integral equations of the first kind with logarithmic kernels, the use of the conventional boundary element methods gives linear systems with dense matrix. In a recent work [{\em J. Comput. Math.}, 22 (2004), pp. 287-298], it is demonstrated that the dense matrix can be replaced by a sparse one if appropriate graded meshes are used in the quadrature rules. The numerical experiments also indicate that the proposed numerical methods require less computational time than the conventional ones while the formal rate of convergence can be preserved. The purpose of this work is to establish a stability and convergence theory for this fast numerical method. The stability analysis depends on a decomposition of the coefficient matrix for the collocation equation. The formal orders of convergence observed in the numerical experiments are proved rigorously.
Jingtang Ma & Tao Tang . (1970). Error Analysis for a Fast Numerical Method to a Boundary Integral Equation of the First Kind.
Journal of Computational Mathematics. 26 (1).
56-68.
doi:
Copy to clipboard