The purpose of this paper is to introduce an implicit iteration process for approximating common fixed points of two asymptotically nonexpansive mappings and to prove strong convergence theorems in uniformly convex Banach spaces.

Sugiura, H. and T. Torii, A method for constructing generalized Runge-Kutta methods, Journal of Computational and Applied Mathematics 38 (1991) 399-410. In the implementation of an implicit Runge-Kutta formula, we need to solve systems of nonlinear equations. In this paper, we analyze the Newton iteration process and a modified Newton iteration process for solving these equations. Then we propo...

In this note, we introduce a new algorithm to deal with finite dimensional clustering with errors in variables. The design of this algorithm is based on recent theoretical advances (see Loustau (2013a,b)) in statistical learning with errors in variables. As the previous mentioned papers, the algorithm mixes different tools from the inverse problem literature and the machine learning community. ...

Over the last few years, the realm of foreign language learning has witnessed an abundance of research concerning the effectiveness of corrective feedback on the acquisition of grammatical features, with the study of other target language subsystems, such as pronunciation, being few and far between. In order to bridge this gap, the present study intended to investigate and compare the immediate...

A general numerical integration formula is presented that generates many of the commonly used one-dimensional finite-difference schemes. A number of these schemes are tested on a simple wave equation; three implicit and three explicit are chosen for further analysis with a nonlinear set of equations with known solutions. A seventh method of the implicit type not requiring iteration is also test...