h -adaptive boundary element schemes

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 1995Publisher:Springer Science and Business Media LLCJournal:Computational Mechanics, volume 15, pages 372-383 (issn: 0178-7675, eissn: 1432-0924,

Copyright policy )

Authors: Carstensen, C.; Estep, Donald; Stephan, P.;

doi: 10.1007/s004660050027 , 10.1007/bf00372275

h -adaptive boundary element schemes

- Summary
- Subjects
- Metrics

Abstract

This paper introduces an \(h\)-adaptive algorithm for indirect 2-D Galerkin boundary elements applied to Dirichlet and Neumann problems. The algorithm is based on new ``a posteriori'' error estimates and is found particularly useful in presence of corner singularities typical of polygonal boundaries.

Related Organizations

Georgia Institute of Technology
United States
University of Hannover
Germany
Heriot-Watt University
United Kingdom
Mississippi School for Mathematics and Science
United States

Keywords

a posteriori error estimates, Dirichlet and Neumann problems, Error bounds for boundary value problems involving PDEs, Boundary value problems for second-order elliptic equations, Galerkin boundary elements, corner singularities, adaptive mesh refinement, Boundary element methods for boundary value problems involving PDEs

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	12
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average