Fast Large-Scale Boundary Element Algorithms

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Boundary element methods (BEM) reduce a partial differential equation in a domain to an integral equation on the domain’s boundary. They are particularly attractive for solving problems on unbounded domains, but handling the dense matrices corresponding to the integral operators requires efficient algorithms. This article describes two approaches that allow us to solve boundary element equations on surface meshes consisting of several millions of triangles while preserving the optimal convergence rates of the Galerkin discretization.

Cite

CITATION STYLE

APA

Börm, S. (2021). Fast Large-Scale Boundary Element Algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12456 LNCS, pp. 60–79). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-67077-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free