Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/6397
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorPeirce, Anthonyen_US
dc.contributor.authorChen, Suyunen_US
dc.date.accessioned2014-06-18T16:35:18Z-
dc.date.available2014-06-18T16:35:18Z-
dc.date.created2010-06-22en_US
dc.date.issued1995-04en_US
dc.identifier.otheropendissertations/1711en_US
dc.identifier.other3190en_US
dc.identifier.other1367059en_US
dc.identifier.urihttp://hdl.handle.net/11375/6397-
dc.description.abstract<p>The main object of this thesis is to investigate the hypersingular integral equations which arise in Boundary Element (BE) models for crack problems. Although the associated hypersingular integrals are not defined in the usual sense, we interpret them in terms of Hadamard finite part integral operators or as pseudo-differential operators in the distribution sense.</p> <p>By introducing weighted Sobolev spaces to regularize the equations, we have proved the well-posedness for such hypersingular integral equations. Global error estimates are obtained in the thesis.</p> <p>A new approach to the numerical solution of the hypersingular equations based on the recently developed theory of wavelets is presented. Rather than applying wavelet bases directly to obtain new discretizations, we exploit the wavelet bases to obtain more efficient solution algorithms for the more classical discretizations. We discretize the hypersingular integral equation using the piecewise polynomial collocation method. The discrete wavelet transform is then used for the resulting dense algebraic system. This procedure involves O(N²) operations and leads to a sparse matrix problem. Solving this sparse matrix system requires only O(N log² N) operations whereas O(N³) operations are required for the traditional. BE method. Exploiting an indexed storage structure, we reduce the memory requirements from O(N²) to O(N log N) words. Furthermore, the method is applicable to all operator or matrix (with arbitrary geometries) problems as long as the operator or matrix possesses only a finite number of singularities in some rows or columns.</p> <p>We demonstrate that the wavelet-based method can be extended to higher dimensional integral equation problems because these equations can also be discretized by the piecewise polynomial collocation approximation.</p>en_US
dc.subjectMathematicsen_US
dc.subjectMathematicsen_US
dc.titleWell-posedness and Wavelet-based Approximations for Hypersingular Integral Equationsen_US
dc.typethesisen_US
dc.contributor.departmentMathematicsen_US
dc.description.degreeDoctor of Philosophy (PhD)en_US
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File SizeFormat 
fulltext.pdf
Open Access
2.4 MBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue