It appears you don't have support to open PDFs in this web browser. To view this file, Open with your PDF reader
Abstract
Two approaches for formulating a computational Complex Variable Boundary Element Method (CVBEM) model are examined. In particular, this paper considers a collocation approach as well as a least squares approach. Both techniques are used to fit the CVBEM approximation function to given boundary conditions of benchmark boundary value problems (BVPs). Both modeling techniques provide satisfactory computational results, when applied to the demonstration problems, but differ in specific outcomes depending on the number of nodes used and the type of BVP being examined. Historically, the CVBEM has been implemented using the collocation approach. Therefore, the novelty of this work is in formulating the least squares approach and applying the least squares formulation to a Dirichlet BVP as well as a mixed BVP. This work does not claim that one technique should always be used over the other, but rather it seeks to demonstrate the viability of the least squares approach and assert that both techniques for determining the coefficients of the CVBEM approximation function should be considered during the modeling process.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer