TY - GEN A1 - Burgeth, Bernhard A1 - Kleefeld, Andreas A1 - Naegel, Benoît A1 - Perret, Benjamin T1 - Editorial — Special Issue: ISMM 2019 T2 - Mathematical Morphology - Theory and Applications N2 - This editorial presents the Special Issue dedicated to the conference ISMM 2019 and summarizes the articles published in this Special Issue. Y1 - 2020 U6 - https://doi.org/10.1515/mathm-2020-0200 SN - 2353-3390 VL - 4 IS - 1 SP - 159 EP - 161 PB - De Gruyter CY - Warschau ER - TY - CHAP A1 - Pieronek, Lukas A1 - Kleefeld, Andreas ED - Constanda, Christian ED - Harris, Paul T1 - The Method of Fundamental Solutions for Computing Interior Transmission Eigenvalues of Inhomogeneous Media T2 - Integral Methods in Science and Engineering: Analytic Treatment and Numerical Approximations N2 - The method of fundamental solutions is applied to the approximate computation of interior transmission eigenvalues for a special class of inhomogeneous media in two dimensions. We give a short approximation analysis accompanied with numerical results that clearly prove practical convenience of our alternative approach. Y1 - 2019 SN - 978-3-030-16077-7 U6 - https://doi.org/10.1007/978-3-030-16077-7_28 SP - 353 EP - 365 PB - Birkhäuser CY - Cham ER - TY - JOUR A1 - Kleefeld, Andreas A1 - Pieronek, J. T1 - Elastic transmission eigenvalues and their computation via the method of fundamental solutions JF - Applicable Analysis N2 - A stabilized version of the fundamental solution method to catch ill-conditioning effects is investigated with focus on the computation of complex-valued elastic interior transmission eigenvalues in two dimensions for homogeneous and isotropic media. Its algorithm can be implemented very shortly and adopts to many similar partial differential equation-based eigenproblems as long as the underlying fundamental solution function can be easily generated. We develop a corroborative approximation analysis which also implicates new basic results for transmission eigenfunctions and present some numerical examples which together prove successful feasibility of our eigenvalue recovery approach. KW - elastic scattering KW - method of fundamental solutions KW - Interior transmission eigenvalues Y1 - 2020 U6 - https://doi.org/10.1080/00036811.2020.1721473 SN - 1563-504X VL - 100 IS - 16 SP - 3445 EP - 3462 PB - Taylore & Francis CY - London ER - TY - JOUR A1 - Kleefeld, Andreas T1 - The hot spots conjecture can be false: some numerical examples JF - Advances in Computational Mathematics N2 - The hot spots conjecture is only known to be true for special geometries. This paper shows numerically that the hot spots conjecture can fail to be true for easy to construct bounded domains with one hole. The underlying eigenvalue problem for the Laplace equation with Neumann boundary condition is solved with boundary integral equations yielding a non-linear eigenvalue problem. Its discretization via the boundary element collocation method in combination with the algorithm by Beyn yields highly accurate results both for the first non-zero eigenvalue and its corresponding eigenfunction which is due to superconvergence. Additionally, it can be shown numerically that the ratio between the maximal/minimal value inside the domain and its maximal/minimal value on the boundary can be larger than 1 + 10− 3. Finally, numerical examples for easy to construct domains with up to five holes are provided which fail the hot spots conjecture as well. KW - Numerics KW - Boundary integral equations KW - Potential theory KW - Helmholtz equation KW - Interior Neumann eigenvalues Y1 - 2021 U6 - https://doi.org/10.1007/s10444-021-09911-5 SN - 1019-7168 VL - 47 PB - Springer CY - Dordrecht ER - TY - CHAP A1 - Kahra, Marvin A1 - Breuß, Michael A1 - Kleefeld, Andreas A1 - Welk, Martin ED - Brunetti, Sara ED - Frosini, Andrea ED - Rinaldi, Simone T1 - An Approach to Colour Morphological Supremum Formation Using the LogSumExp Approximation T2 - Discrete Geometry and Mathematical Morphology N2 - Mathematical morphology is a part of image processing that has proven to be fruitful for numerous applications. Two main operations in mathematical morphology are dilation and erosion. These are based on the construction of a supremum or infimum with respect to an order over the tonal range in a certain section of the image. The tonal ordering can easily be realised in grey-scale morphology, and some morphological methods have been proposed for colour morphology. However, all of these have certain limitations. In this paper we present a novel approach to colour morphology extending upon previous work in the field based on the Loewner order. We propose to consider an approximation of the supremum by means of a log-sum exponentiation introduced by Maslov. We apply this to the embedding of an RGB image in a field of symmetric 2x2 matrices. In this way we obtain nearly isotropic matrices representing colours and the structural advantage of transitivity. In numerical experiments we highlight some remarkable properties of the proposed approach. Y1 - 2024 SN - 978-3-031-57793-2 U6 - https://doi.org/10.1007/978-3-031-57793-2_25 N1 - Third International Joint Conference, DGMM 2024, Florence, Italy, April 15–18, 2024 SP - 325 EP - 337 PB - Springer CY - Cham ER - TY - JOUR A1 - Breuß, Michael A1 - Kleefeld, Andreas T1 - Implicit monotone difference methods for scalar conservation laws with source terms JF - Acta Mathematica Vietnamica N2 - In this article, a concept of implicit methods for scalar conservation laws in one or more spatial dimensions allowing also for source terms of various types is presented. This material is a significant extension of previous work of the first author (Breuß SIAM J. Numer. Anal. 43(3), 970–986 2005). Implicit notions are developed that are centered around a monotonicity criterion. We demonstrate a connection between a numerical scheme and a discrete entropy inequality, which is based on a classical approach by Crandall and Majda. Additionally, three implicit methods are investigated using the developed notions. Next, we conduct a convergence proof which is not based on a classical compactness argument. Finally, the theoretical results are confirmed by various numerical tests. KW - Entropy solution KW - Source term KW - Monotone methods KW - Implicit methods KW - Finite difference methods KW - Conservation laws Y1 - 2020 U6 - https://doi.org/10.1007/s40306-019-00354-1 SN - 2315-4144 N1 - Corresponding author: Andreas Kleefeld VL - 45 SP - 709 EP - 738 PB - Springer Singapore CY - Singapore ER - TY - CHAP A1 - Kleefeld, Andreas ED - Constanda, Christian T1 - Numerical calculation of interior transmission eigenvalues with mixed boundary conditions T2 - Computational and Analytic Methods in Science and Engineering N2 - Interior transmission eigenvalue problems for the Helmholtz equation play an important role in inverse wave scattering. Some distribution properties of those eigenvalues in the complex plane are reviewed. Further, a new scattering model for the interior transmission eigenvalue problem with mixed boundary conditions is described and an efficient algorithm for computing the interior transmission eigenvalues is proposed. Finally, extensive numerical results for a variety of two-dimensional scatterers are presented to show the validity of the proposed scheme. Y1 - 2020 SN - 978-3-030-48185-8 (Hardcover) U6 - https://doi.org/10.1007/978-3-030-48186-5_9 SP - 173 EP - 195 PB - Birkhäuser CY - Cham ER - TY - CHAP A1 - Abele, Daniel A1 - Kleefeld, Andreas ED - Constanda, Christian T1 - New Numerical Results for the Optimization of Neumann Eigenvalues T2 - Computational and Analytic Methods in Science and Engineering N2 - We present new numerical results for shape optimization problems of interior Neumann eigenvalues. This field is not well understood from a theoretical standpoint. The existence of shape maximizers is not proven beyond the first two eigenvalues, so we study the problem numerically. We describe a method to compute the eigenvalues for a given shape that combines the boundary element method with an algorithm for nonlinear eigenvalues. As numerical optimization requires many such evaluations, we put a focus on the efficiency of the method and the implemented routine. The method is well suited for parallelization. Using the resulting fast routines and a specialized parametrization of the shapes, we found improved maxima for several eigenvalues. Y1 - 2020 SN - 978-3-030-48185-8 (Print) SN - 978-3-030-48186-5 (Online) U6 - https://doi.org/10.1007/978-3-030-48186-5_1 SP - 1 EP - 20 PB - Birkhäuser CY - Cham ER - TY - JOUR A1 - Pieronek, Lukas A1 - Kleefeld, Andreas T1 - On trajectories of complex-valued interior transmission eigenvalues JF - Inverse problems and imaging : IPI N2 - This paper investigates the interior transmission problem for homogeneous media via eigenvalue trajectories parameterized by the magnitude of the refractive index. In the case that the scatterer is the unit disk, we prove that there is a one-to-one correspondence between complex-valued interior transmission eigenvalue trajectories and Dirichlet eigenvalues of the Laplacian which turn out to be exactly the trajectorial limit points as the refractive index tends to infinity. For general simply-connected scatterers in two or three dimensions, a corresponding relation is still open, but further theoretical results and numerical studies indicate a similar connection. KW - Interior transmission problem KW - Eigenvalue trajectories KW - Complex-valued eigenvalues Y1 - 2024 U6 - https://doi.org/10.3934/ipi.2023041 SN - 1930-8337 (Print) SN - 1930-8345 (Online) VL - 18 IS - 2 SP - 480 EP - 516 PB - AIMS CY - Springfield, Mo ER - TY - JOUR A1 - Grajewski, Matthias A1 - Kleefeld, Andreas T1 - Detecting and approximating decision boundaries in low-dimensional spaces JF - Numerical Algorithms N2 - A method for detecting and approximating fault lines or surfaces, respectively, or decision curves in two and three dimensions with guaranteed accuracy is presented. Reformulated as a classification problem, our method starts from a set of scattered points along with the corresponding classification algorithm to construct a representation of a decision curve by points with prescribed maximal distance to the true decision curve. Hereby, our algorithm ensures that the representing point set covers the decision curve in its entire extent and features local refinement based on the geometric properties of the decision curve. We demonstrate applications of our method to problems related to the detection of faults, to multi-criteria decision aid and, in combination with Kirsch’s factorization method, to solving an inverse acoustic scattering problem. In all applications we considered in this work, our method requires significantly less pointwise classifications than previously employed algorithms. KW - MCDA KW - Inverse scattering problem KW - Fault approximation KW - Fault detection Y1 - 2023 SN - 1572-9265 N1 - Corresponding author: Matthias Grajewski VL - 93 IS - 4 PB - Springer Science+Business Media CY - Dordrecht ER -