We study the numerical identification of an unknown portion of the boundary on which either the Dirichlet or the Neumann condition is provided from the knowledge of Cauchy data on the remaining, accessible and known part of the boundary of a two-dimensional domain, for problems governed by Helmholtz-type equations. This inverse geometric problem is solved using the plane waves method (PWM) in conjunction with the Tikhonov regularization method. The value for the regularization parameter is chosen according to Hansen's L-curve criterion. The stability, convergence, accuracy and efficiency of the proposed method are investigated by considering several examples.

In this article, we consider the numerical solution for Poisson's equation in axisymmetric geometry. When the boundary condition and source term are axisymmetric, the problem reduces to solving Poisson's equation in cylindrical coordinates in the two-dimensional (r,z) region of the original three-dimensional domain S. Hence, the original boundary value problem is reduced to a two-dimensional one. To make use of the Mechanical quadrature method (MQM), it is necessary to calculate a particular solution, which can be subtracted off, so that MQM can be used to solve the resulting Laplace problem, which possesses high accuracy order and low computing complexities. Moreover, the multivariate asymptotic error expansion of MQM accompanied with for all mesh widths hi is got. Hence, once discrete equations with coarse meshes are solved in parallel, the higher accuracy order of numerical approximations can be at least by the splitting extrapolation algorithm (SEA). Meanwhile, a posteriori asymptotic error estimate is derived, which can be used to construct self-adaptive algorithms. The numerical examples support our theoretical analysis.

This study investigates the applicability of the singular boundary method (SBM), a recent developed meshless boundary collocation method, for the analysis of two-dimensional (2D) thin structural problems. The troublesome nearly-singular kernels, which are crucial in the applications of SBM to thin shapes, are dealt with efficiently by using a non-linear transformation technique. Promising SBM results with only a small number of boundary nodes are obtained for thin structures with the thickness-to-length ratio is as small as 1E-9, which is sufficient for modeling most thin layered coating systems as used in smart materials and micro-electro-mechanical systems. The advantages, disadvantages and potential applications of the proposed method, as compared with the finite element (FEM) and boundary element methods (BEM), are also discussed.

This paper concerns the electromagnetic scattering by arbitrary shaped three dimensional imperfectly conducting objects modeled with non-constant Leontovitch impedance boundary condition. It has two objectives. Firstly, the intrinsically well-conditioned integral equation (noted GCSIE) proposed in [30] is described focusing on its discretization. Secondly, we highlight the potential of this method by comparison with two other methods, the first being a two currents formulation in which the impedance condition is implicitly imposed and whose the convergence is quasi-optimal for Lipschitz polyhedron, the second being a CFIE-like formulation [14]. In particular, we prove that the new approach is less costly in term of CPU time and gives a more accurate solution than that obtained from the CFIE formulation. Finally, as expected, It is demonstrated that no preconditioner is needed for this formulation.

This work proposes a generalized boundary integral method for variable coefficients elliptic partial differential equations (PDEs), including both boundary value and interface problems. The method is kernel-free in the sense that there is no need to know analytical expressions for kernels of the boundary and volume integrals in the solution of boundary integral equations. Evaluation of a boundary or volume integral is replaced with interpolation of a Cartesian grid based solution, which satisfies an equivalent discrete interface problem, while the interface problem is solved by a fast solver in the Cartesian grid. The computational work involved with the generalized boundary integral method is essentially linearly proportional to the number of grid nodes in the domain. This paper gives implementation details for a second-order version of the kernel-free boundary integral method in two space dimensions and presents numerical experiments to demonstrate the efficiency and accuracy of the method for both boundary value and interface problems. The interface problems demonstrated include those with piecewise constant and large-ratio coefficients and the heterogeneous interface problem, where the elliptic PDEs on two sides of the interface are of different types.

Boundary integral methods are naturally suited for the computation of harmonic functions on a region having inclusions or cells with different material properties. However, accuracy deteriorates when the cell boundaries are close to each other. We present a boundary integral method in two dimensions which is specially designed to maintain second order accuracy even if boundaries are arbitrarily close. The method uses a regularization of the integral kernel which admits analytically determined corrections to maintain accuracy. For boundaries with many components we use the fast multipole method for efficient summation. We compute electric potentials on a domain with cells whose conductivity differs from that of the surrounding medium. We first solve an integral equation for a source term on the cell interfaces and then find values of the potential near the interfaces via integrals. Finally we use a Poisson solver to extend the potential to a regular grid covering the entire region. A number of examples are presented. We demonstrate that increased refinement is not needed to maintain accuracy as interfaces become very close.

We propose a new moving pseudo-boundary method of fundamental solutions (MFS) for the determination of the boundary of a three-dimensional void (rigid inclusion or cavity) within a conducting homogeneous host medium from overdetermined Cauchy data on the accessible exterior boundary. The algorithm for imaging the interior of the medium also makes use of radial spherical parametrization of the unknown star-shaped void and its centre in three dimensions. We also include the contraction and dilation factors in selecting the fictitious surfaces where the MFS sources are to be positioned in the set of unknowns in the resulting regularized nonlinear least-squares minimization. The feasibility of this new method is illustrated in several numerical examples.

In this paper, we introduce two Galerkin formulations of the Method of Fundamental Solutions (MFS). In contrast to the collocation formulation of the MFS, the proposed Galerkin formulations involve the evaluation of integrals over the boundary of the domain under consideration. On the other hand, these formulations lead to some desirable properties of the stiffness matrix such as symmetry in certain cases. Several numerical examples are considered by these methods and their various features compared.

This study proposes a new formulation of singular boundary method (SBM) to solve the 2D potential problems, while retaining its original merits being free of integration and mesh, easy-to-program, accurate and mathematically simple without the requirement of a fictitious boundary as in the method of fundamental solutions (MFS). The key idea of the SBM is to introduce the concept of the origin intensity factor to isolate the singularity of fundamental solution so that the source points can be placed directly on the physical boundary. This paper presents a new approach to derive the analytical solution of the origin intensity factor based on the proposed subtracting and adding-back techniques. And the troublesome sample nodes in the ordinary SBM are avoided and the sample solution is also not necessary for the Neumann boundary condition. Three benchmark problems are tested to demonstrate the feasibility and accuracy of the new formulation through detailed comparisons with the boundary element method (BEM), MFS, regularized meshless method (RMM) and boundary distributed source (BDS) method.

We consider scattering of a time harmonic incident plane wave by a convex polygon with piecewise constant impedance boundary conditions. Standard finite or boundary element methods require the number of degrees of freedom to grow at least linearly with respect to the frequency of the incident wave in order to maintain accuracy. Extending earlier work by Chandler-Wilde and Langdon for the sound soft problem, we propose a novel Galerkin boundary element method, with the approximation space consisting of the products of plane waves with piecewise polynomials supported on a graded mesh with smaller elements closer to the corners of the polygon. Theoretical analysis and numerical results suggest that the number of degrees of freedom required to achieve a prescribed level of accuracy grows only logarithmically with respect to the frequency of the incident wave.

We consider the design of an effective and reliable adaptive finite element method (AFEM) for the nonlinear Poisson-Boltzmann equation (PBE). We first examine the two-term regularization technique for the continuous problem recently proposed by Chen, Holst and Xu based on the removal of the singular electrostatic potential inside biomolecules; this technique made possible the development of the first complete solution and approximation theory for the Poisson-Boltzmann equation, the first provably convergent discretization and also allowed for the development of a provably convergent AFEM. However, in practical implementation, this two-term regularization exhibits numerical instability. Therefore, we examine a variation of this regularization technique which can be shown to be less susceptible to such instability. We establish a priori estimates and other basic results for the continuous regularized problem, as well as for Galerkin finite element approximations. We show that the new approach produces regularized continuous and discrete problems with the same mathematical advantages of the original regularization. We then design an AFEM scheme for the new regularized problem and show that the resulting AFEM scheme is accurate and reliable, by proving a contraction result for the error. This result, which is one of the first results of this type for nonlinear elliptic problems, is based on using continuous and discrete a prioriL∞ estimates. To provide a high-quality geometric model as input to the AFEM algorithm, we also describe a class of feature-preserving adaptive mesh generation algorithms designed specifically for constructing meshes of biomolecular structures, based on the intrinsic local structure tensor of the molecular surface. All of the algorithms described in the article are implemented in the Finite Element Toolkit (FETK), developed and maintained at UCSD. The stability advantages of the new regularization scheme are demonstrated with FETK through comparisons with the original regularization approach for a model problem. The convergence and accuracy of the overall AFEMalgorithmis also illustrated by numerical approximation of electrostatic solvation energy for an insulin protein.