On the algorithm of the solution of the signorini problem

An algorithm is proposed for solving the Signorini problem /1/ in the formulation of a unilateral variational problem for the boundary functional in the zone of possible contact /2/. The algorithm is based on a dual formulation of Lagrange maximin problems for whose solution a decomposition approach is used in the following sense: a Ritz process in the basis functions that satisfy the linear constraint of the problem, the differential equation in the domain, is used in solving the minimum problem (with fixed Lagrange multipliers); the maximum problem is solved by the method of descent (a generalization of the Frank-Wolf method) under convexity constraints on the Lagrange multipliers. The algorithm constructed can be conisidered as a modification of the well-known algorithm to find the Udzawa-Arrow-Hurwitz saddle points /3, 4/. The convergence of the algorithm is investigated. A numerical analysis of the algorithm is performed in the example of a classical contact problem about the insertion of a stamp in an elastic half-plane under approximation of the contact boundary by isoparametric boundary elements. The comparative efficiency of the algorithm is associated with the reduction in the dimensionality of the boundary value problem being solved and the possibility of utilizing the calculation apparatus of the method of boundary elements to realize the solution.     

An adaptive boundary collocation method for linear PDEs

The article proposes an adaptive algorithm based on a boundary collocation method for linear PDEs satisfying the maximal principle with possibly nonlinear boundary conditions. Given the error tolerance and an initial number of terms in the solution expansion, the algorithm computes expansion coefficients by collocation of boundary conditions and evaluates the maximum absolute error on the boundary. If error exceeds the error tolerance, additional expansion terms and boundary collocation points are added and the process repeated until the tolerance is satisfied. The performance of the algorithm is illustrated by an example of the potential flow past a cylinder placed between parallel walls. © 1995 John Wiley & Sons, Inc.     

Numerical modelling of the plane problem of the stress state of a tube immersed in a liquid

A numerical method for solving the plane problem of determining the stress state of a tube of arbitrary section immersed in a homogeneous incompressible liquid is proposed. The change from the boundary conditions for this problem to the boundary conditions for a biharmonic stress function is carried out, which enables the algorithm for solving boundary value problems in the case of a polyharmonic function developed earlier to be used to solve the problem under consideration. It is shown that the boundary conditions for doubly-connected domains contain three unknown constants. The conditions for finding these constants in a form that is convenient for the implementation of a numerical algorithm are obtained. Tubes with sections in the form of concentric, eccentric and elliptic rings are considered as examples.     

Perturbed integral equation method on determining unknown geometry in fluid flow

We consider an inverse problem arising in fluid flow. An algorithm to find the shape of a body in uniform flow is proposed when the tangential velocity on its boundary is given a priori. The fluid flow is assumed to be inviscid, incompressible and irrotational.The essential idea to develop our algorithm is the boundary modification process toward the solution shape with the help of the perturbed integral equations. The perturbed integral equations are derived from the boundary perturbation. We also give examples exhibiting the reliability for our proposed algorithm.     

A fast BIE iteration method for an arbitrary body in a flow of incompressible inviscid fluid

The paper is concerned with the new iteration algorithm to solve boundary integral equations arising in boundary value problems of mathematical physics. The stability of the algorithm is demonstrated on the problem of a flow around bodies placed in the incompressible inviscid fluid. With a discrete numerical treatment, we approximate the exact matrix by a certain Töeplitz one and then apply a fast algorithm for this matrix, on each iteration step. We illustrate the convergence of this iteration scheme by a number of numerical examples, both for hard and soft boundary conditions. It appears that the method is highly efficient for hard boundaries, being much less efficient for soft boundaries.     

On estimate for the modulus of continuity of the Cauchy-type integral having a Lipschitz-continuous density

The Cauchy-type integral having a Lipschitz-continuous density is under investigation. It is considered in a Jordan region that has a piecewise regular boundary without cusps and therefore it can be continuously extended over the closure of the region. Then the boundary values form a function, whose modulus of continuity is to be estimated. One parameter-dependent estimate is obtained and one algorithm for its evaluating is developed. The algorithm is demonstrated on some examples.     

A collocation method for solving a class of singular nonlinear two-point boundary value problems

In this paper, an iterative algorithm for solving singular nonlinear two-point boundary value problems is formulated. This method is basically a collocation method for nonlinear second-order two-point boundary value problems with singularities at either one or both of the boundary points. It is proved that the iterative algorithm converges to a smooth approximate solution of the BVP provided the boundary value problem is well posed and the algorithm is applied appropriately. Error estimates for uniform partitions are also investigated. It has been shown that, for sufficiently smooth solutions, the method produces order h⁴ approximations. Numerical examples are provided to show the effectiveness of the algorithm.     

A numerical algorithm for the solution of Signorini problems

In this paper we propose a new iterative algorithm for the solution of a certain class of Signorini problems. Such problems arise in the modelling of a variety of physical phenomena and usually involve the determination of an unknown free boundary. Here we describe a way of locating the free boundary directly and provide a proof that the algorithm converges when used with analytic methods. The advantage of this algorithm is that it can be used in conjunction with any numerical method with minimal development of extra code. We demonstrate its application with the boundary element method to some physical problems in both two and three dimensions.     

A fast alternating minimization algorithm for total variation deblurring without boundary artifacts

Recently, a fast alternating minimization algorithm for total variation image deblurring (FTVd) has been presented by Wang, Yang, Yin, and Zhang (2008) [32]. The method in a nutshell consists of a discrete Fourier transform-based alternating minimization algorithm with periodic boundary conditions and in which two fast Fourier transforms (FFTs) are required per iteration. In this paper, we propose an alternating minimization algorithm for the continuous version of the total variation image deblurring problem. We establish convergence of the proposed continuous alternating minimization algorithm. The continuous setting is very useful to have a unifying representation of the algorithm, independently of the discrete approximation of the deconvolution problem, in particular concerning the strategies for dealing with boundary artifacts. Indeed, an accurate restoration of blurred and noisy images requires a proper treatment of the boundary. A discrete version of our continuous alternating minimization algorithm is obtained following two different strategies: the imposition of appropriate boundary conditions and the enlargement of the domain. The first one is computationally useful in the case of a symmetric blur, while the second one can be efficiently applied for a nonsymmetric blur. Numerical tests show that our algorithm generates higher quality images in comparable running times with respect to the Fast Total Variation deconvolution algorithm.     

Optimal control and optimal trajectories of regional macroeconomic dynamics based on the Pontryagin maximum principle

The Pontryagin maximum principle is used to prove a theorem concerning optimal control in regional macroeconomics. A boundary value problem for optimal trajectories of the state and adjoint variables is formulated, and optimal curves are analyzed. An algorithm is proposed for solving the boundary value problem of optimal control. The performance of the algorithm is demonstrated by computing an optimal control and the corresponding optimal trajectories.     

An iterative penalty method for the least squares solution of boundary value problems

This article is concerned with iterative techniques for linear systems of equations arising from a least squares formulation of boundary value problems. In its classical form, the solution of the least squares method is obtained by solving the traditional normal equation. However, for nonsmooth boundary conditions or in the case of refinement at a selected set of interior points, the matrix associated with the normal equation tends to be ill-conditioned. In this case, the least squares method may be formulated as a Powell multiplier method and the equations solved iteratively. Therein we use and compare two different iterative algorithms. The first algorithm is the preconditioned conjugate gradient method applied to the normal equation, while the second is a new algorithm based on the Powell method and formulated on the stabilized dual problem. The two algorithms are first compared on a one-dimensional problem with poorly conditioned matrices. Results show that, for such problems, the new algorithm gives more accurate results. The new algorithm is then applied to a two-dimensional steady state diffusion problem and a boundary layer problem. A comparison between the least squares method of Bramble and Schatz and the new algorithm demonstrates the ability of the new method to give highly accurate results on the boundary, or at a set of given interior collocation points without the deterioration of the condition number of the matrix. Conditions for convergence of the proposed algorithm are discussed. © 1997 John Wiley & Sons, Inc.     

Application of orthogonal collocation on finite elements for solving non-linear boundary value problems

A simple, convenient and easy approach to solve non-linear boundary value problems (BVP) using orthogonal collocation on finite elements (OCFE) is presented. The algorithm is the conjunction of finite element method (FEM) and orthogonal collocation method (OCM). The stability of the numerical results is checked by a novel algorithm which not only justifies the stability of the results but also checks the convergence of the method. The method is applied to the non-symmetric boundary value problems having Dirichlet’s and mixed Robbin’s boundary conditions.     

基于率模可靠性的客观确定非对称概型功能函数隶属函数的方法

摒弃目前以主观方法给出功能函数对结构安全模糊集隶属函数的做法,提出并从理论上证明了：当功能函数具有非对称概型时,将功能函数的线性函数假想为集值统计的随机集边界点,通过定积分运算获得隶属函数的方法。算例充分说明文中方法的科学性和客观性。     

A parareal approach of semi‐linear parabolic equations based on general waveform relaxation

We present a parareal approach of semi‐linear parabolic equations based on general waveform relaxation (WR) at the partial differential equation (PDE) level. An algorithm for initial‐boundary value problem and two algorithms for time‐periodic boundary value problem are constructed. The convergence analysis of three algorithms are provided. The results show that the algorithm for initial‐boundary value problem is superlinearly convergent while both algorithms for the time‐periodic boundary value problem linearly converge to the exact solutions at most. Numerical experiments show that the parareal algorithms based on general WR at the PDE level, compared with the parareal algorithm based on the classical WR at the ordinary differential equations (ODEs) level (the PDEs is discretized into ODEs), require much fewer number of iterations to converge.     

Numerical Experiment for Stabilization of the Heat Equation by Dirichlet Boundary Control

We use the boundary feedback control introduced in Barbu [Boundary stabilization of equilibrium solutions to parabolic equations, IEEE Trans. Automat. Control (accepted)], in order to stabilize an unstable heat equation in two dimensions. We propose two numerical algorithms. The feedback boundary condition is treated explicitly in the first algorithm. At each time step, only one linear system is solved. The second algorithm performs at each time step some subiterations, in order to treat the feedback boundary condition implicitly. The second algorithm can stabilize some problems where the first algorithm fails.     

Discrete boundary smoothing using control node parameterisation for aerodynamic shape optimisation

This paper presents an automated aerodynamic optimisation algorithm using a novel method of parameterising the search domain and geometry by employing user–defined control nodes. The displacement of the control nodes is coupled to the shape boundary movement via a ‘discrete boundary smoothing’. This is initiated by a linear deformation followed by a discrete smoothing step to act on the boundary during the mesh movement based on the change in its second derivative. Implementing the discrete boundary smoothing allows both linear and non-linear shape deformation along the same boundary dependent on the preference of the user. The domain mesh movement is coupled to the shape boundary movement via a Delaunay graph mapping. An optimisation algorithm called Modified Cuckoo Search (MCS) is used acting within the prescribed design space defined by the allowed range of control node displacement. In order to obtain the aerodynamic design fitness a finite volume compressible Navier-Stokes solver is utilized. The resulting coupled algorithm is applied to a range of case studies in two dimensional space including the optimisation of a RAE2822 aerofoil and the optimisation of an intake duct under subsonic, transonic and supersonic flow conditions. The discrete mesh–based optimisation approach outlined is shown to be effective in terms of its generalised applicability, intuitiveness and design space definition.     

A boundary only procedure for time-dependent diffusion equations

In the recent literature, the boundary element method (BEM) is extensively used to solve time-dependent partial differential equations. However, most of these formulations yield algorithms where one has to include all interior points in the computation process if finite difference procedures are used to approximate the temporal derivative. This obviously restricts the advantages of the BEM, which is mainly considered to be a boundary only algorithm for time-independent problems. A new algorithm is demonstrated here, which extends the boundary only nature of the method to time-dependent partial differential equations. Using this procedure, one can reduce the finite difference time integration algorithm, generated in a standard manner, to a boundary only process. The proposed method is demonstrated with considerable success for diffusion problems. Results obtained in these applications are presented comparatively with analytical and other boundary element time integration procedures. The algorithm proposed may utilize several coordinate functions in the secondary reduction phase of the formulation. A summary of such functions is described here and performances of these functions are tested and compared in three applications. It is shown that some coordinate functions perform better than others under certain conditions. Using these results, we propose a general coordinate function, which may be used with satisfactory results in all parabolic partial differential equation applications.     

A numerical solution to nonlinear multi‐point boundary value problems in the reproducing kernel space

In this paper, a new numerical algorithm is provided to solve nonlinear multi‐point boundary value problems in a very favorable reproducing kernel space, which satisfies all complex boundary conditions. Its reproducing kernel function is discussed in detail. The theorem proves that the approximate solution and its first‐ and second‐order derivatives all converge uniformly. The numerical experiments show that the algorithm is quite accurate and efficient for solving nonlinear multi‐point boundary value problems. Copyright © 2010 John Wiley & Sons, Ltd.