๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A faster Galerkin boundary integral algorithm

โœ Scribed by Gray, L. J. ;Griffith, B. E.

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
101 KB
Volume
14
Category
Article
ISSN
1069-8299

No coin nor oath required. For personal study only.

โœฆ Synopsis

The symmetry present in Green's functions is exploited to signiยฎcantly reduce the matrix assembly time for a Galerkin boundary integral analysis. A relatively simple modiยฎcation of the standard Galerkin implementation for computing the non-singular integrals yields a 20ยฑ30 per cent decrease in computation time. This faster Galerkin method is developed for both singular and hypersingular equations, and applied to symmetric-Galerkin implementations in two dimensions for the Laplace equation and for orthotropic elasticity. In three dimensions, the modiยฎed algorithm has been implemented for the singular equation for the Laplace and elastodynamics equations. Comparison timing results for standard and modiยฎed algorithms are presented.

๐Ÿ“œ SIMILAR VOLUMES

Conjugate gradient algorithms andthe Gal
Conjugate gradient algorithms andthe Galerkin boundary element method
โœ O.O. Ademoyero; M.C. Bartholomew-Biggs; A.J. Davies; S.C. Parkhurst ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 755 KB

This paper deals with the symmetric linear systems of equations arising in the Galerkin boundary element method. In particular, we consider the application of several variants of the conjugate-gradient method to these systems and present some numerical results which shows that a simple preconditioni

A boundary element Galerkin method for a
A boundary element Galerkin method for a hypersingular integral equation on open surfaces
โœ V. J. Ervin; E. P. Stephan ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 403 KB ๐Ÿ‘ 1 views

## Abstract A hypersingular boundary integral equation of the first kind on an open surface piece ฮ“ is solved approximately using the Galerkin method. As boundary elements on rectangles we use continuous, piecewise bilinear functions which vanish on the boundary of ฮ“. We show how to compensate for

A Faster Deterministic Maximum Flow Algo
A Faster Deterministic Maximum Flow Algorithm
โœ V. King; S. Rao; R. Tarjan ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 1011 KB

Cheriyan and Hagerup developed a randomized algorithm to compute the maximum flow in a graph with \(n\) nodes and \(m\) edges in \(O\left(m n+n^{2} \log ^{2} n\right)\) expected time. The randomization is used to efficiently play a certain combinatorial game that arises during the computation. We gi