On the parallel version of the successive approximation method for quasilinear boundary value problem

The convergence properties of the successive approximation method to solve a quasilinear two points boundary value problem is studied. The successive approximation method is used to solve the parallel/multiple version of the problem. Conditions which assure the convergence of the method and error bound are given.     

On the convergence of the collocation method for nonlinear boundary integral equations

Recently, Galerkin and collocation methods have been analysed for some nonlinear boundary integral equations. For the collocation method it has been assumed that the nonlinearity is asymptotically linear. In this paper we remove this restriction. We shall prove the convergence of the collocation method for nonlinear boundary integral equations, when the nonlinearity has a polynomial growth condition. In addition to this the optimal order error estimates follow in L^q(Γ)-norm.     

A variational conjugate gradient method for determining the fluid velocity of a slow viscous flow

The problem considered is that of determining the fluid velocity for linear hydrostatics Stokes flow of slow viscous fluids from measured velocity and fluid stress force on a part of the boundary of a bounded domain. A variational conjugate gradient iterative procedure is proposed based on solving a series of mixed well-posed boundary value problems for the Stokes operator and its adjoint. In order to stabilize the Cauchy problem, the iterations are ceased according to an optimal order discrepancy principle stopping criterion. Numerical results obtained using the boundary element method confirm that the procedure produces a convergent and stable numerical solution.     

A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems

The inverse-free preconditioned Krylov subspace method of Golub and Ye [G.H. Golub, Q. Ye, An inverse free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems, SIAM J. Sci. Comp. 24 (2002) 312-334] is an efficient algorithm for computing a few extreme eigenvalues of the symmetric generalized eigenvalue problem. In this paper, we first present an analysis of the preconditioning strategy based on incomplete factorizations. We then extend the method by developing a block generalization for computing multiple or severely clustered eigenvalues and develop a robust black-box implementation. Numerical examples are given to illustrate the analysis and the efficiency of the block algorithm.     

A BOUNDARY ELEMENT METHOD FOR A NONLINEAR BOUNDARY VALUE PROBLEM IN STEADY-STATE HEAT TRANSFER IN DIMENSION THREE

In this paper, a new method of boundary reduction is proposed, which reduces thesteady-state heat transfer equation with radiation. Moreover, a boundary element method is pre-sented for its solution and the error estimates of the numerical approximations are given.     

A numerical experimental study of inverse preconditioning for the parallel iterative solution to 3D finite element flow equations

Integration of the subsurface flow equation by finite elements (FE) in space and finite differences (FD) in time requires the repeated solution to sparse symmetric positive definite systems of linear equations. Iterative techniques based on preconditioned conjugate gradients (PCG) are one of the most attractive tool to solve the problem on sequential computers. A present challenge is to make PCG attractive in a parallel computing environment as well. To this aim a key factor is the development of an efficient parallel preconditioner. FSAI (factorized sparse approximate inverse) and enlarged FSAI relying on the approximate inverse of the coefficient matrix appears to be a most promising parallel preconditioner. In the present paper PCG using FSAI, diagonal and pARMS (parallel algebraic recursive multilevel solvers) preconditioners is implemented on the IBM SP4/512 and CLX/768 supercomputers with up to 32 processors to solve underground flow problems of a large size. The results show that FSAI may allow for a parallel relative efficiency larger than 50% on the largest problems with p=32 processors. Moreover, FSAI turns out to be significantly less expensive and more robust than pARMS. Finally, it is shown that for p in the upper range may be much improved if PCG–FSAI is implemented on CLX.     

Existence of solutions for three-point boundary value problems for second order equations

Shooting methods are employed to obtain solutions of the three-point boundary value problem for the second order equation, where is continuous, and and conditions are imposed implying that solutions of such problems are unique, when they exist.

     

A parallel implementation of overlapping Schwarz method for the dual reciprocity method

We present a parallel algorithm for the overlapping domain decomposition boundary integral equation method for two dimensional partial differential equations. In addition to the improvement of the ill-conditioning and the computational efficiency achieved by domain partitioning, using a parallel computer with p processors can offer up to p times efficiency. Assuming direct solution is used throughout, partitioning the domain into p subregions and employing a processor for each subproblem, overall, result in p² times efficiency over using a single domain and a single processor, taking into account that a sequential algorithm of the underlying method can improve the computational efficiency at least p times over using a single domain. Some numerical results showing the efficiency of the parallel technique will be presented.     

On the coupling of regularization techniques and the boundary element method for a hemivariational inequality modelling a delamination problem

In this paper, we couple regularization techniques of nondifferentiable optimization with the h‐version of the boundary element method (h‐BEM) to solve nonsmooth variational problems arising in contact mechanics. As a model example, we consider the delamination problem. The variational formulation of this problem leads to a hemivariational inequality with a nonsmooth functional defined on the contact boundary. This problem is first regularized and then discretized by an h‐BEM. We prove convergence of the h‐BEM Galerkin solution of the regularized problem in the energy norm, provide an a priori error estimate and give a numerical examples. Copyright © 2016 John Wiley & Sons, Ltd.     

Two-level hierarchically preconditioned conjugate gradient methods for solving linear elasticity finite element equations

In this paper we study and compare some preconditioned conjugate gradient methods for solving large-scale higher-order finite element schemes approximating two- and three-dimensional linear elasticity boundary value problems. The preconditioners discussed in this paper are derived from hierarchical splitting of the finite element space first proposed by O. Axelsson and I. Gustafsson. We especially focus our attention to the implicit construction of preconditioning operators by means of some fixpoint iteration process including multigrid techniques. Many numerical experiments confirm the efficiency of these preconditioners in comparison with classical direct methods most frequently used in practice up to now.     

A system of boundary integral equations for the transmission problem in acoustics

In this paper, we reduce the classical two-dimensional transmission problem in acoustic scattering to a system of coupled boundary integral equations (BIEs), and consider the weak formulation of the resulting equations. Uniqueness and existence results for the weak solution of corresponding variational equations are established. In contrast to the coupled system in Costabel and Stephan (1985) [4], we need to take into account exceptional frequencies to obtain the unique solvability. Boundary element methods (BEM) based on both the standard and a two-level fast multipole Galerkin schemes are employed to compute the solution of the variational equation. Numerical results are presented to verify the efficiency and accuracy of the numerical methods.     

A general complex variable boundary element method

The solution to any 2‐dimensional potential problem, with continuous data given on the boundary of a bounded domain with connected complement, can be approximated by sums Re Σ c_n f(α_n z + z₀), where f is any preassigned non‐polynomial analytic function. © 2001 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 17:332–335, 2001     

Solving boundary value problems of ordinary differential equations with non-separated boundary conditions

This paper focuses on solving the two point boundary value problem, in which boundary conditions are systems of nonlinear equations. The shooting method was used together with a combination of Newton’s method and Broyden’s method, to update the initial values of the differential equations. The experiments showed that the proposed method performed well, in the sense that the overall amount of work was less than that of the Newton Shooting method.     

Uniqueness implies existence for three-point boundary value problems for dynamic equations

Shooting methods are used to obtain solutions of the three-point boundary value problem for the second-order dynamic equation, y^ΔΔ = f (x, y, y^Δ), y(x₁) = y₁, y(x₃) − y(x₂) = y₂, where f : (a, b)_T × ² → is continuous, x₁ < x₂ < x₃ in (a, b)_T, y₁, y₂ ε , and T is a time scale. It is assumed such solutions are unique when they exist.     

Collocation for high order differential equations with two-points Hermite boundary conditions

For the numerical solution of high even order differential equations with two-points Hermite boundary conditions a general collocation method is derived and studied. Computation of the integrals which appear in the coefficients are generated by a recurrence formula and no integrals are involved in the calculation. An application to the solution of the beam problem is given. Numerical experiments provide favorable comparisons with other existing methods.     

Positive solutions for boundary value problems of second order difference equations and their computation

We consider the following two classes of second order boundary value problems for difference equation:

     

On a boundary value problem for integro-differential equations on the halfline

The following boundary value problem

     

DRIC: A dynamic version of the RIC method

A new incomplete factorization method is proposed, differing from previous ones by the way in which the diagonal entries of the triangular factors are defined. A comparison is given with the dynamic modified incomplete factorization methods of Axelsson–Barker and Beauwens, and with the relaxed incomplete Cholesky method of Axelsson and Lindskog. Theoretical arguments show that the new method is at least as robust as both previous ones, while numerical experiments made in the discrete PDE context show an effective improvement in many practical circumstances, particularly for anisotropic problems.     

The versions of the finite element method for problems with boundary layers

We study the uniform approximation of boundary layer functions for , , by the and versions of the finite element method. For the version (with fixed mesh), we prove super-exponential convergence in the range . We also establish, for this version, an overall convergence rate of in the energy norm error which is uniform in , and show that this rate is sharp (up to the term) when robust estimates uniform in are considered. For the version with variable mesh (i.e., the version), we show that exponential convergence, uniform in , is achieved by taking the first element at the boundary layer to be of size . Numerical experiments for a model elliptic singular perturbation problem show good agreement with our convergence estimates, even when few degrees of freedom are used and when is as small as, e.g., . They also illustrate the superiority of the approach over other methods, including a low-order version with optimal ``exponential" mesh refinement. The estimates established in this paper are also applicable in the context of corresponding spectral element methods.