Open Access

ARTICLE

Error Analysis of Trefftz Methods for Laplace's Equations and Its Applications

by Z. C. Li², T. T. Lu³, H. T. Huang⁴, A. H.-D. Cheng⁵

1 This paper is dedicated to Professor D. L. Young on the occasion of his 65 birthday. Partial results were presented at the Minisymposium on Meshfree and Generalized/Extended Finite Element Methods in the 9th US National Congress on Computational Mechanics (USNCCM9), San Francisco, California, USA, July 23-26, 2007.
2 Department of Applied Mathematics and Department of Computer Science and Engineering, National Sun Yatsen University, Kaohsiung, Taiwan 80424, and Department of Applied Mathematics, Chung Hua University, HsinChu, Taiwan. E-mail: zcli@math.nsysu.edu.tw
3 Department of Applied Mathematics, National Sun Yatsen University, Kaohsiung, Taiwan 80424. E-mail: ttlu@math.nsysu.edu.tw
4 Department of Applied Mathematics, I Shou University, Taiwan 840. E-mail: huanght@isu.edu.tw
5 Corresponding author, Department of Civil Engineering, University of Mississippi, USA. E-mail:acheng@olemiss.edu.

Computer Modeling in Engineering & Sciences 2009, 52(1), 39-82. https://doi.org/10.3970/cmes.2009.052.039

Abstract

For Laplace's equation and other homogeneous elliptic equations, when the particular and fundamental solutions can be found, we may choose their linear combination as the admissible functions, and obtain the expansion coefficients by satisfying the boundary conditions only. This is known as the Trefftz method (TM) (or boundary approximation methods). Since the TM is a meshless method, it has drawn great attention of researchers in recent years, and Inter. Workshops of TM and MFS (i.e., the method of fundamental solutions). A number of efficient algorithms, such the collocation algorithms, Lagrange multiplier methods, etc., have been developed in computation. However, there still exists a gap of convergence and errors between computation and theory. In this paper, convergence analysis and error estimates are explored for Laplace's equations with the solution u̼/font>Hk(k > [1/2]), to achieve polynomial convergence rates. Such a basic theory is important for TM and MFS and their further developments. Numerical experiments are provided to support the analysis and to display the significance of its applications.

---

Keywords

---