No abstract

An algorithm is introduced to find an answer to both inclusion problems and fixed point problems. This algorithm is a modification of Tseng type methods inspired by Mann’s type iteration and viscosity approximation methods. On certain conditions, the iteration obtained from the algorithm converges strongly. Moreover, applications to the convex feasibility problem and the signal recovery in compressed sensing are considered. Especially, some numerical experiments of the algorithm are demonstrated. These results are compared to those of the previous algorithm.

Abstract. We consider semicrossed products of the disk algebra with respect to endomorphisms defined by finite Blaschke products. We characterize the Jacobson radical of these operator algebras. Furthermore, in the case the finite Blaschke product is elliptic, we show that the semicrossed product contains no nonzero quasinilpotent elements. However, if the finite Blaschke product is hyperbolic or parabolic with positive hyperbolic step, the Jacobson radical is nonzero and a proper subset of the set of quasinilpotent elements.

In this paper, we introduce a new concept of dominating proximal generalized Geraghty for two mappings and prove the existence and uniqueness of a common best proximity coincidence point in complete metric spaces. And also, we give an example for the main theorems. The main theorem is a generalization and improvement of some well-known theorems.