Abstract
AbstractThis paper is devoted to the fast solution of boundary integral equations on unstructured meshes by the Galerkin scheme. Since traditional discretizations yield densely populated system matrices it is necessary to use fast techniques like ACA, the multipole method or wavelet matrix compression, which will be the topic of the present paper. On the given, possibly unstructered, mesh we construct a wavelet basis providing vanishing moments with respect to the traces of polynomials in the space. With this basis at hand, the system matrix in wavelet coordinates can be compressed to 𝒪(N logN ) relevant matrix coefficients, where N denotes the number of unknowns. The compressed system matrix can be computed within suboptimal complexity by using fast multipole or ℋ︁‐matrix techniques. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
