Symmetric coupling of boundary elements and Raviart–Thomas-type mixed finite elements in elastostatics

Summary. Both mixed finite element methods and boundary integral methods are important tools in computational mechanics according to a good stress approximation. Recently, even low order mixed methods of Raviart–Thomas-type became available for problems in elasticity. Since either methods are robust for critical Poisson ratios, it appears natural to couple the two methods as proposed in this paper. The symmetric coupling changes the elliptic part of the bilinear form only. Hence the convergence analysis of mixed finite element methods is applicable to the coupled problem as well. Specifically, we couple boundary elements with a family of mixed elements analyzed by Stenberg. The locking-free implementation is performed via Lagrange multipliers, numerical examples are included. Received February 21, 1995 / Revised version received December 21, 1995     

Asymptotic estimation for the condition numbers in BEM

Summary. We apply the boundary element methods (BEM) to the interior Dirichlet problem of the two dimensional Laplace equation, and its discretization is carried out with the collocation method using piecewise linear elements. In this paper, some precise asymptotic estimations for the discretization matrix (where denotes the division number) are investigated. We show that the maximum norm of and the condition number of have the forms: and , respectively, as , where the constants and are explicitly given in the proof. Although these estimates indicate illconditionedness of this numerical computation, the -convergence of this scheme with maximum norm is proved as an application of the main results. Received January 25, 1993 / Revised version received March 13, 1995     

On the discrepancy principle for iterative and parametric methods to solve linear ill-posed equations

Summary. For the numerical solution of (non-necessarily well-posed) linear equations in Banach spaces we consider a class of iterative methods which contains well-known methods like the Richardson iteration, if the associated resolvent operator fulfils a condition with respect to a sector. It is the purpose of this paper to show that for given noisy right-hand side the discrepancy principle (being a stopping rule for the iteration methods belonging to the mentioned class) defines a regularization method, and convergence rates are proved under additional smoothness conditions on the initial error. This extends similar results obtained for positive semidefinite problems in Hilbert spaces. Then we consider a class of parametric methods which under the same resolvent condition contains the method of the abstract Cauchy problem, and (under a weaker resolvent condition) the iterated method of Lavrentiev. A modified discrepancy principle is formulated for them, and finally numerical illustrations are presented. Received August 29, 1994 / Revised version received September 19, 1995     

Integration of singular Galerkin-type boundary element integrals for 3D elasticity problems

Summary. A Galerkin approximation of both strongly and hypersingular boundary integral equation (BIE) is considered for the solution of a mixed boundary value problem in 3D elasticity leading to a symmetric system of linear equations. The evaluation of Cauchy principal values (v. p.) and finite parts (p. f.) of double integrals is one of the most difficult parts within the implementation of such boundary element methods (BEMs). A new integration method, which is strictly derived for the cases of coincident elements as well as edge-adjacent and vertex-adjacent elements, leads to explicitly given regular integrand functions which can be integrated by the standard Gauss-Legendre and Gauss-Jacobi quadrature rules. Problems of a wide range of integral kernels on curved surfaces can be treated by this integration method. We give estimates of the quadrature errors of the singular four-dimensional integrals. Received June 25, 1995 / Revised version received January 29, 1996     

Superconvergence of collocation methods for a class of weakly singular Volterra integral equations

We discuss the application of spline collocation methods to a certain class of weakly singular Volterra integral equations. It will be shown that, by a special choice of the collocation parameters, superconvergence properties can be obtained if the exact solution satisfies certain conditions. This is in contrast with the theory of collocation methods for Abel type equations. Several numerical examples are given which illustrate the theoretical results.     

Sinc-collocation methods for weakly singular Fredholm integral equations of the second kind

In this paper we propose new numerical methods for linear Fredholm integral equations of the second kind with weakly singular kernels. The methods are developed by means of the Sinc approximation with smoothing transformations, which is an effective technique against the singularities of the equations. Numerical examples show that the methods achieve exponential convergence, and in this sense the methods improve conventional results where only polynomial convergence have been reported so far.     

On the stability of Runge-Kutta methods for delay integral equations

Summary We present a class of Runge-Kutta methods for the numerical solution of a class of delay integral equations (DIEs) described by two different kernels and with a fixed delay . The stability properties of these methods are investigated with respect to a test equation with linear kernels depending on complex parameters. The results are then applied to collocation methods. In particular we obtain that any collocation method for DIEs, resulting from anA-stable collocation method for ODEs, with a stepsize which is submultiple of the delay , preserves the asymptotic stability properties of the analytic solutions.This work was supported by CNR (Italian National Council of Research)     

A piecewise constant collocation method using cosine mesh grading for Symm's equation

Summary Here we study the piecewise constant collocation method using mesh grading to solve Symm's integral equation on [–1, 1]. We give a mesh grading for which this method achieves the optimal order of convergence even though the piecewise constant Galerkin method with the same mesh grading does not. Some numerical results are given.     

The superconvergence of the Newton-Cotes rule for Cauchy principal value integrals

We consider the general (composite) Newton-Cotes method for the computation of Cauchy principal value integrals and focus on its pointwise superconvergence phenomenon, which means that the rate of convergence of the Newton-Cotes quadrature rule is higher than what is globally possible when the singular point coincides with some a priori known point. The necessary and sufficient conditions satisfied by the superconvergence point are given. Moreover, the superconvergence estimate is obtained and the properties of the superconvergence points are investigated. Finally, some numerical examples are provided to validate the theoretical results.     

On the condition number of matrices arising in the tikhonov regularization method

In this work, we consider the regularization method for linear ill-posed problems. For operators and approximating subspaces satisfying certain conditions and for a specific form of the regularization parameter, upper and lower bounds are given for the condition number of the corresponding discrete problem.     

Subspace-restricted singular value decompositions for linear discrete ill-posed problems

The truncated singular value decomposition is a popular solution method for linear discrete ill-posed problems. These problems are numerically underdetermined. Therefore, it can be beneficial to incorporate information about the desired solution into the solution process. This paper describes a modification of the singular value decomposition that permits a specified linear subspace to be contained in the solution subspace for all truncations. Modifications that allow the range to contain a specified subspace, or that allow both the solution subspace and the range to contain specified subspaces also are described.     

A Nyström interpolant for some weakly singular linear Volterra integral equations

We consider a second kind weakly singular Volterra integral equation defined by a non-compact operator and derive a Nyström type interpolant of the solution based on Gauss-Radau nodes. Assuming the stability of the interpolant, which is confirmed by the numerical tests, we derive convergence estimates.     

Computation of the inverse Laplace transform based on a collocation method which uses only real values

We develop a numerical algorithm for inverting a Laplace transform (LT), based on Laguerre polynomial series expansion of the inverse function under the assumption that the LT is known on the real axis only. The method belongs to the class of Collocation methods (C-methods), and is applicable when the LT function is regular at infinity. Difficulties associated with these problems are due to their intrinsic ill-posedness. The main contribution of this paper is to provide computable estimates of truncation, discretization, conditioning and roundoff errors introduced by numerical computations. Moreover, we introduce the pseudoaccuracy which will be used by the numerical algorithm in order to provide uniform scaled accuracy of the computed approximation for any x   with respect to e^σx${\mathrm{e}}^{\sigma x}$. These estimates are then employed to dynamically truncate the series expansion. In other words, the number of the terms of the series acts like the regularization parameter which provides the trade-off between errors.     

The numerical evaluation of two integral transforms

We derive recurrence relationships for the evaluation of two integral transforms which are of interest for the numerical solution of some integral equations and for the construction of certain quadrature rules.     

Multi-parameter error resolution for the collocation method of Volterra integral equations

In this paper, a multi-parameter error resolution technique is introduced and applied to the collocation method for Volterra integral equations. By using this technique, an approximation of higher accuracy is obtained by using a multi-processor in parallel. Additionally, a correction scheme for approximation of higher accuracy and a global superconvergence result are presented.     

Quadrature method for singular integral equations on closed curves

Summary A method which combines quadrature with trigonometric interpolation is proposed for singular integral equations on closed curves. For the case of the circle, the present method is shown to be equivalent to the trigonometric -collocation method together with numerical quadrature for the compact term, and is shown to be stable inL ² provided the operatorA is invertible inL ². The results are extended to arbitraryC curves, to give a complete error analysis in the scale of Sobolev spacesH ^s . In the final section the case of a non-invertible operatorA is considered.     

A Nyström interpolant for some weakly singular nonlinear Volterra integral equations

We consider a second kind weakly singular nonlinear Volterra–Hammerstein integral equation defined by a compact operator and derive a Nyström type interpolant of the solution based on Gauss–Radau nodes. We prove the convergence of the interpolant and derive convergence estimates. For equations with nonlinearity of algebraic kind, we improve the rate of convergence by using a smoothing transformation. Some numerical examples are given.     

The superconvergence of the composite midpoint rule for the finite-part integral

The composite midpoint rule is probably the simplest one among the Newton-Cotes rules for Riemann integral. However, this rule is divergent in general for Hadamard finite-part integral. In this paper, we turn this rule to a useful one and, apply it to evaluate Hadamard finite-part integral as well as to solve the relevant integral equation. The key point is based on the investigation of its pointwise superconvergence phenomenon, i.e., when the singular point coincides with some a priori known point, the convergence rate of the midpoint rule is higher than what is globally possible. We show that the superconvergence rate of the composite midpoint rule occurs at the midpoint of each subinterval and obtain the corresponding superconvergence error estimate. By applying the midpoint rule to approximate the finite-part integral and by choosing the superconvergence points as the collocation points, we obtain a collocation scheme for solving the finite-part integral equation. More interesting is that the inverse of the coefficient matrix of the resulting linear system has an explicit expression, by which an optimal error estimate is established. Some numerical examples are provided to validate the theoretical analysis.     

Discrete qualocation methods for logarithmic-kernel integral equations on a piecewise smooth boundary

We consider a fully discrete qualocation method for Symm’s integral equation. The method is that of Sloan and Burn (1992), for which a complete analysis is available in the case of smooth curves. The convergence for smooth curves can be improved by a subtraction of singularity (Jeon and Kimn, 1996). In this paper we extend these results for smooth boundaries to polygonal boundaries. The analysis uses a mesh grading transformation method for Symm’s integral equation, as in Elschner and Graham (1995) and Elschner and Stephan (1996), to overcome the singular behavior of solutions at corners. This revised version was published online in August 2006 with corrections to the Cover Date.     

The collocation method for mixed boundary value problems on domains with curved polygonal boundaries

Summary. We consider an indirect boundary integral equation formulation for the mixed Dirichlet-Neumann boundary value problem for the Laplace equation on a plane domain with a polygonal boundary. The resulting system of integral equations is solved by a collocation method which uses a mesh grading transformation and a cosine approximating space. The mesh grading transformation method yields fast convergence of the collocation solution by smoothing the singularities of the exact solution. A complete stability and solvability analysis of the transformed integral equations is given by use of a Mellin transform technique, in a setting in which each arc of the polygon has associated with it a periodic Sobolev space. Received April 15, 1995 / Revised version received April 10, 1996