In this paper, seven self-accelerating iterative methods with memory are derived from an optimal two-step Steffensen-type method without memory for solving nonlinear equations, their orders of convergence are proved to be increased from 4 to 2 6 , (5 17) / 2 ,5 and (5 33) / 2 , numerical examples are demonstrat-ed demonstrated to verify the theoretical results, and applications for solving syst...

Abslract-This article presents a self-organizing model of convergence for the early stages of the olfactory pathway. The model generates a chemotopic projection from olfactory receptor neurons onto glomeruli based on receptor aflinity distributions. The resulting glomerular images reveal an olfactory code consistent with neurobiology, whereby odor quality is encoded by a unique spatial pattern ...

We characterize the functionals which are Mosco-limits, in the L2(Ω) topology, of some sequence of functionals of the kind Fn(u) := ∫ Ω αn(x)|∇u(x)| dx , where Ω is a bounded domain of RN (N ≥ 3). It is known that this family of functionals is included in the closed set of Dirichlet forms. Here, we prove that the set of Dirichlet forms is actually the closure of the set of diffusion functionals...

We consider the convergence in norm of several iterative implementations of linear multiuser receivers, under the assumption of long random spreading sequences. We find that asymptotically, linear parallel interference cancellation diverges for systems loads of greater than about 17%. Using known results from the theory of iterative solutions for linear systems we derive optimal or near optimal...

This paper concerns reconstruction of 2D and 3D MR images from raw, sparsely and nonuniformly sampled k-space signals. In particular, it pertains to iterative Bayesian image reconstruction and acceleration of the attendant convergence to the ‘Maximum A Posteriori’ (MAP) image. Significant acceleration is achieved by weighting of the Likelihood term with the inverse of the sampling density. In a...

In this paper, we introduce a two-step iterative algorithm to prove a strong convergence result for approximating common fixed points of three contractive-like operators. Our algorithm basically generalizes an existing algorithm..Our iterative algorithm also contains two famous iterative algorithms: Mann iterative algorithm and Ishikawa iterative algorithm. Thus our result generalizes the corre...

In this paper, we presented a Multi-Objective Random Drift Particle Swarm Optimization algorithm (MORDPSO-CD) based on RDPSO and crowding distance sorting to improve the convergence and distribution with less computation cost. MORDPSO-CD makes the most of RDPSO to approach the true Pareto optimal solutions fast. We adopt the crowding distance sorting technique to update and maintain the archive...

The present article deals with convergence and smoothness analysis of geometric, nonlinear, subdivision schemes in the presence of extraordinary points. We discuss when the existence of a proximity condition between a linear scheme and its nonlinear analogue implies convergence of the nonlinear scheme (for dense enough input data). Furthermore, we obtain C1 smoothness of the nonlinear limit fun...

In this paper, we use a one-step iteration scheme to approximate common fixed points of two quasi-asymptotically nonexpansive mappings. We prove weak and strong convergence theorems in a uniformly convex Banach space. Our results generalize the corresponding results of Yao and Chen [15] to a wider class of mappings while extend those of Khan, Abbas and Khan [4] to an improved one-step iteration...

The purpose of this article is to identify the practical strategies of R&D (research and development) entities for developing converging technology in organizational context. Based on the multi-assignation technological domains of patents derived from entire government-supported R&D projects for 13 years, we find that technology convergence is likely to occur when a university solely develops t...