A non-conformal eXtended Finite Element approach: Integral matching Xfem

This work is dedicated to the mathematical and numerical analysis of a new Xfem approach: the integral maching Xfem. It is known that the quality of the approximation and the convergence rate of Xfem type methods is broadly influenced by the transition layer between the singular enrichment area and the rest of the domain. In the presented method, this transition layer is replaced by an interface associated with an integral matching condition of mortar type. We prove an optimal convergence result for such a non-conformal approximation method and we perform some numerical experiments showing the advantages of the integral matching Xfem with respect to former Xfem approaches.     

Efficiency of the estimate refinement method for polyhedral approximation of multidimensional balls

The estimate refinement method for the polyhedral approximation of convex compact bodies is analyzed. When applied to convex bodies with a smooth boundary, this method is known to generate polytopes with an optimal order of growth of the number of vertices and facets depending on the approximation error. In previous studies, for the approximation of a multidimensional ball, the convergence rates of the method were estimated in terms of the number of faces of all dimensions and the cardinality of the facial structure (the norm of the f-vector) of the constructed polytope was shown to have an optimal rate of growth. In this paper, the asymptotic convergence rate of the method with respect to faces of all dimensions is compared with the convergence rate of best approximation polytopes. Explicit expressions are obtained for the asymptotic efficiency, including the case of low dimensions. Theoretical estimates are compared with numerical results.     

Galerkin finite element method for one nonlinear integro-differential model

Galerkin finite element method for the approximation of a nonlinear integro-differential equation associated with the penetration of a magnetic field into a substance is studied. First type initial-boundary value problem is investigated. The convergence of the finite element scheme is proved. The rate of convergence is given too. The decay of the numerical solution is compared with the analytical results.     

Meshless method with ridge basis functions

Meshless collocation methods for the numerical solutions of PDEs are increasingly adopted due to their advantages including efficiency and flexibility, and radial basis functions are popularly employed to represent the solutions of PDEs. Motivated by the advantages of ridge basis function representation of a given function, such as the connection to neural network, fast convergence as the number of terms is increased, better approximation effects and various applications in engineering problems, a meshless method is developed based on the collocation method and ridge basis function interpolation. This method is a truly meshless technique without mesh discretization: it neither needs the computation of integrals, nor requires a partition of the region and its boundary. Moreover, the method is applied to elliptic equations to examine its appropriateness, numerical results are compared to that obtained from other (meshless) methods, and influence factors of accuracy for numerical solutions are analyzed.     

On the coupled NBEM and FEM for a class of nonlinear exterior Dirichlet problem in R~(2*)

In this paper, based on the natural boundary reduction advanced by Feng and Yu, we couple the finite element approach with the natural boundary element method to study the weak solvability and Galerkin approximation of a class of nonlinear exterior boundary value problems. The analysis is mainly based on the variational formulation with constraints. We prove the error estimate of the finite element solution and obtain     

Stability and convergence of optimum spectral non‐linear Galerkin methods

Our objective in this article is to present some numerical schemes for the approximation of the 2‐D Navier–Stokes equations with periodic boundary conditions, and to study the stability and convergence of the schemes. Spatial discretization can be performed by either the spectral Galerkin method or the optimum spectral non‐linear Galerkin method; time discretization is done by the Euler scheme and a two‐step scheme. Our results show that under the same convergence rate the optimum spectral non‐linear Galerkin method is superior to the usual Galerkin methods. Finally, numerical example is provided and supports our results. Copyright © 2001 John Wiley & Sons, Ltd.     

Numerical solutions of the Laplace’s equation

This paper uses the sinc methods to construct a solution of the Laplace’s equation using two solutions of the heat equation. A numerical approximation is obtained with an exponential accuracy. We also present a reliable algorithm of Adomian decomposition method to construct a numerical solution of the Laplace’s equation in the form a rapidly convergence series and not at grid points. Numerical examples are given and comparisons are made to the sinc solution with the Adomian decomposition method. The comparison shows that the Adomian decomposition method is efficient and easy to use.     

Superconvergence of Solution Derivatives of the Shortley–Weller Difference Approximation to Elliptic Equations with Singularities Involving the Mixed Type of Boundary Conditions

This paper presents a superconvergence analysis for the Shortley–Weller finite difference approximation of second-order self-adjoint elliptic equations with unbounded derivatives on a polygonal domain with the mixed type of boundary conditions. In this analysis, we first formulate the method as a special finite element/volume method. We then analyze the convergence of the method in a finite element framework. An O(h ^1.5)-order superconvergence of the solution derivatives in a discrete H ¹ norm is obtained. Finally, numerical experiments are provided to support the theoretical convergence rate obtained.     

Direct solution method for the equilibrium problem for elastic stents

We are interested in numerical methods for approximating vector‐valued functions on a metric graph. As a model problem, we formulate and analyze a numerical method for the solution of the stationary problem for the one‐dimensional elastic stent model. The approximation is built using the mixed finite element method. The discretization matrix is a symmetric saddle‐point matrix, and we discuss sparse direct methods for the fast and robust solution of the associated equilibrium system. The convergence of the numerical method is proven and the error estimate is obtained. Numerical examples confirm the theoretical estimates.     

On finding robust approximate inverses for large sparse matrices

This paper presents a method based on matrix-matrix multiplication concepts for determining the approximate (sparse) inverses of sparse matrices. The suggested method is a development on the well-known Schulz iteration and it can successfully be combined with iterative solvers and sparse approximation techniques as well. A detailed discussion on the convergence rate of this scheme is furnished. Results of numerical experiments are also reported to illustrate the performance of the proposed method.     

Radial basis collocation method and quasi‐Newton iteration for nonlinear elliptic problems

This work presents a radial basis collocation method combined with the quasi‐Newton iteration method for solving semilinear elliptic partial differential equations. The main result in this study is that there exists an exponential convergence rate in the radial basis collocation discretization and a superlinear convergence rate in the quasi‐Newton iteration of the nonlinear partial differential equations. In this work, the numerical error associated with the employed quadrature rule is considered. It is shown that the errors in Sobolev norms for linear elliptic partial differential equations using radial basis collocation method are bounded by the truncation error of the RBF. The combined errors due to radial basis approximation, quadrature rules, and quasi‐Newton and Newton iterations are also presented. This result can be extended to finite element or finite difference method combined with any iteration methods discussed in this work. The numerical example demonstrates a good agreement between numerical results and analytical predictions. The numerical results also show that although the convergence rate of order 1.62 of the quasi‐Newton iteration scheme is slightly slower than rate of order 2 in the Newton iteration scheme, the former is more stable and less sensitive to the initial guess. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Shape sensitivity analysis of an elastic contact problem: Convergence of the Nitsche based finite element approximation

In a recent work, we introduced a finite element approximation for the shape optimization of an elastic structure in sliding contact with a rigid foundation where the contact condition (Signorini’s condition) is approximated by Nitsche’s method and the shape gradient is obtained via the adjoint state method. The motivation of this work is to propose an a priori convergence analysis of the numerical approximation of the variables of the shape gradient (displacement and adjoint state) and to show some numerical results in agreement with the theoretical ones. The main difficulty comes from the non-differentiability of the contact condition in the classical sense which requires the notion of conical differentiability.     

Finite-difference method for singular nonlinear systems

This paper presents a method for solving nonlinear system with singular Jacobian at the solution. The convergence rate in the case of singularity deteriorates and one way to accelerate convergence is to form bordered system. A local algorithm, with finite-difference approximations, for forming and solving such system is proposed in this paper. To overcome the need that initial approximation has to be very close to the solution, we also propose a method which is a combination of descent method with finite-differences and local algorithm. Some numerical results obtained on relevant examples are presented.     

求解Fisher型方程的混合Legendre-球面调和谱方法

主要研究两同心球所界球形区域上偏微分方程的谱方法,建立了与区域形状相适应的混合Legendre-球面调和正交逼近的部分结果,在此基础上提出了数值求解两同心球所界球形区域上Fisher型方程的混合Legendre-球面调和谱格式,并分别给出了格式的收敛性及相关的数值结果.     

A highly accurate Jacobi collocation algorithm for systems of high‐order linear differential–difference equations with mixed initial conditions

In this paper, a shifted Jacobi–Gauss collocation spectral algorithm is developed for solving numerically systems of high‐order linear retarded and advanced differential–difference equations with variable coefficients subject to mixed initial conditions. The spatial collocation approximation is based upon the use of shifted Jacobi–Gauss interpolation nodes as collocation nodes. The system of differential–difference equations is reduced to a system of algebraic equations in the unknown expansion coefficients of the sought‐for spectral approximations. The convergence is discussed graphically. The proposed method has an exponential convergence rate. The validity and effectiveness of the method are demonstrated by solving several numerical examples. Numerical examples are presented in the form of tables and graphs to make comparisons with the results obtained by other methods and with the exact solutions more easier. Copyright © 2015 John Wiley & Sons, Ltd.     

The Dual Singular Function Method for 2D Boundary Integral Equations

The accuracy of standard boundary element methods for elliptic boundary value problems deteriorates if the boundary of the domain contains corners or if the boundary conditions change along the boundary. Here we first investigate the convergence behaviour of standard spline Galerkin approximation on quasi-uniform meshes for boundary integral equations on polygonal domains. It turns out, that the order of convergence depends on some constant describing the singular behaviour of solutions near corner points of the boundary. In order to recover the full order of convergence for the Galerkin approximation we propose the dual singular function method which is often used for improving the accuracy of finite element methods. The theoretical convergence results are confirmed and illustrated by a numerical example.     

A high order HODIE finite difference scheme for 1D parabolic singularly perturbed reaction-diffusion problems

This paper deals with the numerical approximation of the solution of 1D parabolic singularly perturbed problems of reaction-diffusion type. The numerical method combines the standard implicit Euler method on a uniform mesh to discretize in time and a HODIE compact fourth order finite difference scheme to discretize in space, which is defined on a priori special meshes condensing the grid points in the boundary layer regions. The method is uniformly convergent having first order in time and almost fourth order in space. The analysis of the uniform convergence is made in two steps, splitting the contribution to the error from the time and the space discretization. Although this idea has been previously used to prove the uniform convergence for parabolic singularly perturbed problems, here the proof is based on a new study of the asymptotic behavior of the exact solution of the semidiscrete problems obtained after the time discretization by using the Euler method. Some numerical results are given corroborating in practice the theoretical results.     

A new shrinking gradient-like projection method for equilibrium problems

The paper proposes a new shrinking gradient-like projection method for solving equilibrium problems. The algorithm combines the generalized gradient-like projection method with the monotone hybrid method. Only one optimization program is solved onto the feasible set at each iteration in our algorithm without any extra-step dealing with the feasible set. The absence of an optimization problem in the algorithm is explained by constructing slightly different cutting-halfspace in the monotone hybrid method. Theorem of strong convergence is established under standard assumptions imposed on equilibrium bifunctions. An application of the proposed algorithm to multivalued variational inequality problems (MVIP) is presented. Finally, another algorithm is introduced for MVIPs in which we only use a value of main operator at the current approximation to construct the next approximation. Some preliminary numerical experiments are implemented to illustrate the convergence and computational performance of our algorithms over others.     

An efficient cubic B-spline and bicubic B-spline collocation method for numerical solutions of multidimensional nonlinear stochastic quadratic integral equations

This paper aims to develop a novel numerical approach on the basis of B-spline collocation method to approximate the solution of one-dimensional and two-dimensional nonlinear stochastic quadratic integral equations. The proposed approach is based on the hybrid of collocation method, cubic B-spline, and bi-cubic B-spline interpolation and Itô approximation. Using this method, the problem solving turns into a nonlinear system solution of equations that is solved by a suitable numerical method. Also, the convergence analysis of this numerical approach has been discussed. In the end, examples are given to test the accuracy and the implementation of the method. The results are compared with the results obtained by other methods to verify that this method is accurate and efficient.     

A numerical method of structure-preserving model updating problem and its perturbation theory

A method is presented to update a special finite element (FE) analytical model, based on matrix approximation theory with spectral constraint. At first, the model updating problem is treated as a matrix approximation problem dependent on the spectrum data from vibration test and modal parameter identification. The optimal approximation is the first modified solution of FE model. An algorithm is given to preserve the sparsity of the model by multiple correction. The convergence of the algorithm is investigated and perturbation of the modified solution is analyzed. Finally, a numerical example is provided to confirm the convergence of the algorithm and perturbation theory.