In this paper, we present a new preconditioner which generalizes two known preconditioners proposed by Wang et al. (2009) and A. J. Li (2011), and prove that the convergence rate of the AOR method with the new preconditioner is faster than the preconditioners introduced by Wang et al. Moreover, we propose other two new preconditioners and study the convergence rates of the new preconditioned AO...

The aim of this paper is to introduce an iterative algorithm for finding a common solution of the sets A M2 −1 0 and B M1 −1 0 , where M is a maximal accretive operator in a Banach space and, by using the proposed algorithm, to establish some strong convergence theorems for common solutions of the two sets above in a uniformly convex and 2-uniformly smooth Banach space. The results obtained in ...

Rubens MT, Zanto TP. Parameterization of transcranial magnetic stimulation. J Neurophysiol 107: 1257–1259, 2012. First published November 9, 2011; doi:10.1152/jn.00716.2011.—A recent study (Di Lazzaro et al. J Neurophysiol 105: 2150–2156, 2011) describes the findings from a rigorous comparison on the effects of several popular variations of transcranial magnetic stimulation (TMS) protocols. The...

It is well known that polynomial interpolation at equidistant nodes can give bad approximation results and that rational interpolation is a promising alternative in this setting. In this paper we confirm this observation by proving that the Lebesgue constant of Berrut’s rational interpolant grows only logarithmically in the number of interpolation nodes. Moreover, the numerical results show tha...

An interesting strategy called configuration checking (CC) was recently proposed to handle the cycling problem in local search for Minimum Vertex Cover. A natural question is whether this CC also works SAT. The direct application of did not result stochastic (SLS) algorithms that can compete with current best SLS In paper, we propose a new heuristic based on SAT, which aspiration (CCA). It used...