Numerical solutions of coupled systems of nonlinear elliptic equations

This article deals with numerical solutions of a general class of coupled nonlinear elliptic equations. Using the method of upper and lower solutions, monotone sequences are constructed for difference schemes which approximate coupled systems of nonlinear elliptic equations. This monotone convergence leads to existence‐uniqueness theorems for solutions to problems with reaction functions of quasi‐monotone nondecreasing, quasi‐monotone nonincreasing and mixed quasi‐monotone types. A monotone domain decomposition algorithm which combines the monotone approach and an iterative domain decomposition method based on the Schwarz alternating, is proposed. An application to a reaction‐diffusion model in chemical engineering is given. © 2010 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 621–640, 2012     

Uniform quadratic convergence of monotone iterates for nonlinear singularly perturbed parabolic problems

This paper deals with a monotone iterative method for solving nonlinear singularly perturbed parabolic problems. Monotone sequences, based on the method of upper and lower solutions, are constructed for a nonlinear difference scheme which approximates the nonlinear parabolic problem. This monotone convergence leads to the existence-uniqueness theorem. The monotone sequences possess quadratic convergence rate. An analysis of uniform convergence of the monotone iterative method to the solutions of the nonlinear difference scheme and to the continuous problem is given. Numerical experiments are presented.     

A modified accelerated monotone iterative method for finite difference reaction-diffusion-convection equations

This paper is concerned with monotone algorithms for the finite difference solutions of a class of nonlinear reaction-diffusion-convection equations with nonlinear boundary conditions. A modified accelerated monotone iterative method is presented to solve the finite difference systems for both the time-dependent problem and its corresponding steady-state problem. This method leads to a simple and yet efficient linear iterative algorithm. It yields two sequences of iterations that converge monotonically from above and below, respectively, to a unique solution of the system. The monotone property of the iterations gives concurrently improving upper and lower bounds for the solution. It is shown that the rate of convergence for the sum of the two sequences is quadratic. Under an additional requirement, quadratic convergence is attained for one of these two sequences. In contrast with the existing accelerated monotone iterative methods, our new method avoids computing local maxima in the construction of these sequences. An application using a model problem gives numerical results that illustrate the effectiveness of the proposed method.     

Monotone iterative methods for finite difference system of reaction-diffusion equations

Summary This paper presents an existence-comparison theorem and an iterative method for a nonlinear finite difference system which corresponds to a class of semilinear parabolic and elliptic boundary-value problems. The basic idea of the iterative method for the computation of numerical solutions is the monotone approach which involves the notion of upper and lower solutions and the construction of monotone sequences from a suitable linear discrete system. Using upper and lower solutions as two distinct initial iterations, two monotone sequences from a suitable linear system are constructed. It is shown that these two sequences converge monotonically from above and below, respectively, to a unique solution of the nonlinear discrete equations. This formulation leads to a well-posed problem for the nonlinear discrete system. Applications are given to several models arising from physical, chemical and biological systems. Numerical results are given to some of these models including a discussion on the rate of convergence of the monotone sequences.     

Uniform convergent monotone iterates for semilinear singularly perturbed parabolic problems

This paper deals with discrete monotone iterative methods for solving semilinear singularly perturbed parabolic problems. Monotone sequences, based on the accelerated monotone iterative method, are constructed for a nonlinear difference scheme which approximates the semilinear parabolic problem. This monotone convergence leads to the existence-uniqueness theorem. An analysis of uniform convergence of the monotone iterative method to the solutions of the nonlinear difference scheme and continuous problem is given. Numerical experiments are presented.     

Monotone iterates with quadratic convergence rate for solving weighted average approximations to semilinear parabolic problems

This paper deals with discrete monotone iterative methods for solving semilinear singularly perturbed parabolic problems. Monotone sequences, based on the accelerated monotone iterative method, are constructed for a nonlinear difference scheme which approximates the semilinear parabolic problem. This monotone convergence leads to the existence-uniqueness theorem. An analysis of convergence of the monotone iterative method to the solutions of the nonlinear difference scheme is given. Numerical experiments are presented.     

不连续泛函微分方程周期边值问题解的单调迭代技巧(英文)

文章通过运用上下解的方法证明了一类带有周期边值条件的不连续泛函微分方程解的存在性.并且采用不连续的上下解显著扩大了上下解的选择范围.进而,通过构造具有一致收敛性的上下解的单调迭代序列,得到了该周期边值问题的极值解,即最大、小解.     

A block monotone domain decomposition algorithm for a semilinear convection–diffusion problem

This paper deals with discrete monotone iterative algorithms for solving a nonlinear singularly perturbed convection–diffusion problem. A block monotone domain decomposition algorithm based on a Schwarz alternating method and on block iterative scheme is constructed. This monotone algorithm solves only linear discrete systems at each iterative step of the iterative process and converges monotonically to the exact solution of the nonlinear problem. The rate of convergence of the block monotone domain decomposition algorithm is estimated. Numerical experiments are presented.     

Error and stability of monotone method for numerical solutions of fourth-order semilinear elliptic boundary value problems

This paper is concerned with the error and stability analysis of the monotone method for numerical solutions of fourth-order semilinear elliptic boundary value problems. A comparison result among the various monotone sequences is given. The global error is analyzed, and some sufficient conditions are formulated to guarantee a geometric rate of convergence. The stability of the monotone method is proved. Some numerical results are presented.     

Iterative methods for solving monotone equilibrium problems via dual gap functions

This paper proposes an iterative method for solving strongly monotone equilibrium problems by using gap functions combined with double projection-type mappings. Global convergence of the proposed algorithm is proved and its complexity is estimated. This algorithm is then coupled with the proximal point method to generate a new algorithm for solving monotone equilibrium problems. A class of linear equilibrium problems is investigated and numerical examples are implemented to verify our algorithms.     

General Strongly Nonlinear Quasivariational Inequalities with Relaxed Lipschitz and Relaxed Monotone Mappings

In this paper, we introduce and study a new class of general strongly nonlinear quasivariational inequalities and construct a general iterative algorithm by using the projection method. We establish the existence of a unique solution for general strongly nonlinear quasivariational inequalities involving relaxed Lipschitz, relaxed monotone, and strongly monotone mappings; we obtain the convergence and stability of the iterative sequences generated by the algorithm. Our results extend, improve, and unify many known results due to Bose, Noor, Siddiqi-Ansari, Verma, Yao, Zeng, and others.     

Proximal methods for a class of bilevel monotone equilibrium problems

We consider a bilevel problem involving two monotone equilibrium bifunctions and we show that this problem can be solved by a simple proximal method. Under mild conditions, the weak convergence of the sequences generated by the algorithm is obtained. Using this result we obtain corollaries which improve several corresponding results in this field.     

Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point problems

The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points F(S) of a nonexpansive mapping S and the set of solutions Ω _A of the variational inequality for a monotone, Lipschitz continuous mapping A. We introduce a hybrid extragradient-like approximation method which is based on the well-known extragradient method and a hybrid (or outer approximation) method. The method produces three sequences which are shown to converge strongly to the same common element of \({F(S)\cap\Omega_{A}}\). As applications, the method provides an algorithm for finding the common fixed point of a nonexpansive mapping and a pseudocontractive mapping, or a common zero of a monotone Lipschitz continuous mapping and a maximal monotone mapping.     

Higher-order compact finite difference method for systems of reaction–diffusion equations

This paper is concerned with a compact finite difference method for solving systems of two-dimensional reaction–diffusion equations. This method has the accuracy of fourth-order in both space and time. The existence and uniqueness of the finite difference solution are investigated by the method of upper and lower solutions, without any monotone requirement on the nonlinear term. Three monotone iterative algorithms are provided for solving the resulting discrete system efficiently, and the sequences of iterations converge monotonically to a unique solution of the system. A theoretical comparison result for the various monotone sequences is given. The convergence of the finite difference solution to the continuous solution is proved, and Richardson extrapolation is used to achieve fourth-order accuracy in time. An application is given to an enzyme–substrate reaction–diffusion problem, and some numerical results are presented to demonstrate the high efficiency and advantages of this new approach.     

Existence and approximation of solutions for discontinuous functional differential equations

In this paper existence of solutions of initial value problems for discontinuous functional differential equations is investigated firstly. By applying the method of upper and lower solutions, which may be discontinuous, some existence results of extremal solutions are obtained. Furthermore, we also develop a monotone iterative technique for obtaining extremal solutions which are obtained as limits of monotone sequences.     

Spectral gradient projection method for solving nonlinear monotone equations

An algorithm for solving nonlinear monotone equations is proposed, which combines a modified spectral gradient method and projection method. This method is shown to be globally convergent to a solution of the system if the nonlinear equations to be solved is monotone and Lipschitz continuous. An attractive property of the proposed method is that it can be applied to solving nonsmooth equations. We also give some preliminary numerical results to show the efficiency of the proposed method.     

反向混合单调算子方程解的存在唯一性定理

运用锥与半序理论和非对称迭代方法,讨论半序Banach空间一类反向混合单调算子方程解的存在唯一性,并给出了迭代序列收敛于解的误差估计,作为其应用着重讨论了非反向混合单调算子方程解的存在唯一性,所得结果改进和推广了混合单调算子方程某些已知相应结果.     

Variable quasi-Bregman monotone sequences

We introduce a notion of variable quasi-Bregman monotone sequence which unifies the notion of variable metric quasi-Fejér monotone sequences and that of Bregman monotone sequences. The results are applied to analyze the asymptotic behavior of proximal iterations based on variable Bregman distance and of algorithms for solving convex feasibility problems in reflexive real Banach spaces.     

A new projection method for a class of variational inequalities

In this paper, we revisit the numerical approach to variational inequality problems involving strongly monotone and Lipschitz continuous operators by a variant of projected reflected gradient method. Contrary to what done so far, the resulting algorithm uses a new simple stepsize sequence which is diminishing and nonsummable. This brings the main advantages of the algorithm where the construction of aproximation solutions and the formulation of convergence are done without the prior knowledge of the Lipschitz and strongly monotone constants of cost operators. The assumptions in the formulation of theorem of convergence are also discussed in this paper. Numerical results are reported to illustrate the behavior of the new algorithm and also to compare with others.     

Computing topological entropy for periodic sequences of unimodal maps

In this paper we introduce an algorithm which allows us to compute the topological entropy of a class of piecewise monotone continuous interval maps. The algorithm can be applied to a class of economic models called duopolies, and it can be useful to compute the topological entropy of periodic sequences of continuous maps which have been used in some population growth models.