Let $X$ be a reflexive Banach space, $T:Xto X$ be a nonexpansive mapping with $C=Fix(T)neqemptyset$ and $F:Xto X$ be $delta$-strongly accretive and $lambda$- strictly pseudocotractive with $delta+lambda>1$. In this paper, we present modified hybrid steepest-descent methods, involving sequential errors and functional errors with functions admitting a center, which generate convergent sequences ...

Simulated Annealing (SA) is a widely used meta-algorithm for complex optimization problems. This chapter presents methods to distribute executable tasks onto a set of processors. This process is called task mapping. The most common goal is to decrease execution time via parallel computation. However, the presented mapping methods are not limited to optimizing application execution time because ...

In this letter, a rigorous solution of the chaotic Lozi mapping is given for some regions of the bifurcation parameters. The relevance of this result is that while chaos has been proved for the Lozi mapping, there has not previously been discussion of the possibility of finding a rigorous formula for this solution. This important result is obtained using the Jordan normal form defined for matri...

The paper establishes a computational enclosure of the solution of a nonlinear complementarity problem x ≥ 0, l(x) ≥ 0, x l(x) = 0, where l(x) = Mx+ Φ(x) is a so-called almost linear mapping with an H-matrix M with positive diagonal elements and an increasing diagonal mapping Φ. The procedure also delivers a simple proof for the uniqueness of the solution. Mathematics Subject Classification (20...

This paper reviews the evolution of the mapping strategies used for a cushion-like musical interface called the sponge. It describes how suggestions from the literature were concretely implemented and used in performance, offering a concrete example of a composer’s approach to mapping. It also provides an example of a real world situation where no single strategy constituted a solution to the i...

In this paper, the concept of the strongly monotone type mapping is introduced, which contains the strongly monotone mapping and firmly type nonexpansive mapping as special cases. We show the equivalence between the fixed point problem and the complementarity problem of strongly monotone type mapping. Furthermore, it is obtained that an iteration sequence strongly converges to a unique solution...

In this paper, we introduce two iterative algorithms (one implicit algorithm and one explicit algorithm) for finding a common element of the solution set of a general system of variational inequalities for continuous monotone mappings and the fixed point set of a continuous pseudocontractive mapping in a Hilbert space. First, this system of variational inequalities is proven to be equivalent to...

General parametric solution to a family of generalized Sylvester matrix equations arising in linear system theory is presented by using the socalled generalized Sylvester mapping which has some elegant properties. The solution consists of some polynomial matrices satisfying certain conditions and a parametric matrix representing the degree of freedom in the solution. The results provide great c...