Daniel Seibel
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Daniel Seibel has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Steffen Weißer
Department of Mathematics Saarland University 66041 Saarbrücken Germany
2 shared publications - Andreas Herten
Forschungszentrum Jülich
1 shared publication - Dirk Pleiter
University of Groningen
1 shared publication - Jayesh Badwaik
Jülich Supercomputing Centre - Forschungszentrum Jülich GmbH
1 shared publication - Prateek Chawla
The Institute of Mathematical Sciences, Chennai, India
1 shared publication - Stepan Nassyr
Jülich Supercomputing Centre - Forschungszentrum Jülich GmbH
1 shared publication
Latest Publications
- 15 August 2026
- Published by Springer Nature
- p. 121-135
Performance Portable BLAS3 Micro-Kernel Generator
- 15 August 2026
- Published by Springer Nature
- p. 121-135
Performance Portable BLAS3 Micro-Kernel Generator
- 11 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 45 (4) , A2075-A2100
Almost Complete Analytical Integration in Galerkin Boundary Element Methods
In this work, we derive semianalytical formulae for the calculation of matrix entries in Galerkin boundary element methods (BEM) for the Laplace equation in three dimensions. The efficient and accurate assembly of the system matrices is a central difficulty in BEM, since it involves the computation of singular four-dimensional integrals. To this end, we apply the Duffy transformation to obtain singular-free integral representations, which we integrate analytically using classical calculus. In this way, we acquire closed and exact formulae for the singular cases and reduce the four-dimensional integrals to one- or two-dimensional integrals for the near singular and regular cases. We validate the correctness of the formulae in numerical experiments and report a substantial improvement in performance and efficiency compared to conventional numerical integration.
- 11 August 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 45 (4) , A2075-A2100
Almost Complete Analytical Integration in Galerkin Boundary Element Methods
In this work, we derive semianalytical formulae for the calculation of matrix entries in Galerkin boundary element methods (BEM) for the Laplace equation in three dimensions. The efficient and accurate assembly of the system matrices is a central difficulty in BEM, since it involves the computation of singular four-dimensional integrals. To this end, we apply the Duffy transformation to obtain singular-free integral representations, which we integrate analytically using classical calculus. In this way, we acquire closed and exact formulae for the singular cases and reduce the four-dimensional integrals to one- or two-dimensional integrals for the near singular and regular cases. We validate the correctness of the formulae in numerical experiments and report a substantial improvement in performance and efficiency compared to conventional numerical integration.
- Open Access
- 30 December 2021
- Published by Springer Nature in Numerische Mathematik
- Vol. 150 (2) , 629-670
Boundary element methods for the wave equation based on hierarchical matrices and adaptive cross approximation
Time-domain Boundary Element Methods (BEM) have been successfully used in acoustics, optics and elastodynamics to solve transient problems numerically. However, the storage requirements are immense, since the fully populated system matrices have to be computed for a large number of time steps or frequencies. In this article, we propose a new approximation scheme for the Convolution Quadrature Method powered BEM, which we apply to scattering problems governed by the wave equation. We use $${\mathscr {H}}^2$$ -matrix compression in the spatial domain and employ an adaptive cross approximation algorithm in the frequency domain. In this way, the storage and computational costs are reduced significantly, while the accuracy of the method is preserved.- 30 December 2021
- Published by Springer Nature in Numerische Mathematik
- Vol. 150 (2) , 629-670
Open AccessBoundary element methods for the wave equation based on hierarchical matrices and adaptive cross approximation
Time-domain Boundary Element Methods (BEM) have been successfully used in acoustics, optics and elastodynamics to solve transient problems numerically. However, the storage requirements are immense, since the fully populated system matrices have to be computed for a large number of time steps or frequencies. In this article, we propose a new approximation scheme for the Convolution Quadrature Method powered BEM, which we apply to scattering problems governed by the wave equation. We use $${\mathscr {H}}^2$$ -matrix compression in the spatial domain and employ an adaptive cross approximation algorithm in the frequency domain. In this way, the storage and computational costs are reduced significantly, while the accuracy of the method is preserved. - 1 November 2020
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 80 (9) , 2073-2089
Recovery-based error estimators for the VEM and BEM-based FEM
- 1 November 2020
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 80 (9) , 2073-2089
Recovery-based error estimators for the VEM and BEM-based FEM
- Open Access
Boundary Element Methods for the Wave Equation based on Hierarchical Matrices and Adaptive Cross Approximation
Time-domain Boundary Element Methods (BEM) have been successfully used in acoustics, optics and elastodynamics to solve transient problems numerically. However, the storage requirements are immense, since the fully populated system matrices have to be computed for a large number of time steps or frequencies. In this article, we propose a new approximation scheme for the Convolution Quadrature Method (CQM) powered BEM, which we apply to scattering problems governed by the wave equation. We use $\mathcal{H}^2$-matrix compression in the spatial domain and employ an adaptive cross approximation (ACA) algorithm in the frequency domain. In this way, the storage and computational costs are reduced significantly, while the accuracy of the method is preserved.
Open AccessBoundary Element Methods for the Wave Equation based on Hierarchical Matrices and Adaptive Cross Approximation
Time-domain Boundary Element Methods (BEM) have been successfully used in acoustics, optics and elastodynamics to solve transient problems numerically. However, the storage requirements are immense, since the fully populated system matrices have to be computed for a large number of time steps or frequencies. In this article, we propose a new approximation scheme for the Convolution Quadrature Method (CQM) powered BEM, which we apply to scattering problems governed by the wave equation. We use $\mathcal{H}^2$-matrix compression in the spatial domain and employ an adaptive cross approximation (ACA) algorithm in the frequency domain. In this way, the storage and computational costs are reduced significantly, while the accuracy of the method is preserved.
- Open Access
- 18 November 2019
- Published by Wiley in Proceedings in Applied Mathematics and Mechanics
- Vol. 19 (1) , e201900092
Gradient Recovery for the BEM‐based FEM and VEM
In this article, we propose new gradient recovery schemes for the BEM‐based Finite Element Method (BEM‐based FEM) and Virtual Element Method (VEM). Supporting general polytopal meshes, the BEM‐based FEM and VEM are highly flexible and efficient tools for the numerical solution of boundary value problems in two and three dimensions. We construct the recovered gradient from the gradient of the finite element approximation via local averaging. For the BEM‐based FEM, we show that, under certain requirements on the mesh, superconvergence of the recovered gradient is achieved, which means that it converges to the true gradient at a higher rate than the untreated gradient. Moreover, we propose a simple and very efficient a posteriori error estimator, which measures the difference between the unprocessed and recovered gradient as an error indicator. Since the BEM‐based FEM and VEM are specifically suited for adaptive refinement, the resulting adaptive algorithms perform very well in numerical examples.
- 18 November 2019
- Published by Wiley in Proceedings in Applied Mathematics and Mechanics
- Vol. 19 (1) , e201900092
Open AccessGradient Recovery for the BEM‐based FEM and VEM
In this article, we propose new gradient recovery schemes for the BEM‐based Finite Element Method (BEM‐based FEM) and Virtual Element Method (VEM). Supporting general polytopal meshes, the BEM‐based FEM and VEM are highly flexible and efficient tools for the numerical solution of boundary value problems in two and three dimensions. We construct the recovered gradient from the gradient of the finite element approximation via local averaging. For the BEM‐based FEM, we show that, under certain requirements on the mesh, superconvergence of the recovered gradient is achieved, which means that it converges to the true gradient at a higher rate than the untreated gradient. Moreover, we propose a simple and very efficient a posteriori error estimator, which measures the difference between the unprocessed and recovered gradient as an error indicator. Since the BEM‐based FEM and VEM are specifically suited for adaptive refinement, the resulting adaptive algorithms perform very well in numerical examples.