Search

This paper first proposes a trust region algorithm to obtain a stationary point of unconstrained multiobjective optimisation problem. Under suitable assumptions, the global convergence of the new algorithm is established. We then extend the trust region method to solve the non-smooth multiobjective optimisation problem. [ABSTRACT FROM PUBLISHER]

Abstract: In this paper, we analyze a FEM and two-grid FEM decoupling algorithms for elliptic problems on disjoint domains. First, we study the rate of convergence of the FEM and, in particular, we obtain a superconvergence result. Then with proposed algorithms, the solution of the multi-component domain problem (simple example — two disjoint rectangles) on a fine grid is reduced to the solution of the original problem on a much coarser grid together with solution of several problems (each on a single-component domain) on fine meshes. The advantage is the computational cost although the resulting solution still achieves asymptotically optimal accuracy. Numerical experiments demonstrate the efficiency of the algorithms. [Copyright &y& Elsevier]

Abstract: In this paper, we propose an interval version of the generalized accelerated overrelaxation methods, which we refer to as IGAOR, for solving the linear complementarity problems, LCP (M, q), and develop a class of multisplitting IGAOR methods which can be easily implemented in parallel. In addition, in regards to the H-matrix with positive diagonal elements, we prove the convergence of these algorithms and illustrate their efficiency through our numerical results. [Copyright &y& Elsevier]

Abstract: This paper proves the convergence of some generalized Schwarz algorithms for solvingthe obstacle problems with a T-monotone operator. Numerical results show that the generalized Schwarz algorithms converge faster than the classical Schwarz algorithms. [Copyright &y& Elsevier]