This paper proposes an implicit surface reconstruction algorithm based on Self-Organising Maps (SOMs). The SOM has the connectivity of a regular 3D grid, each node storing its signed distance from the surface. At each iteration of the basic algorithm, a new training set is created by sampling regularly along the normals of the input points. The main training iteration consists of a competitive ...

In this paper, we introduce and study a class of new Picard-Mann iterative methods with mixed errors for common fixed points of two different nonexpansive and contraction operators. We also give convergence and stability analysis of the new Picard-Mann iterative approximation and propose numerical examples to show that the new Picard-Mann iteration converges more effectively than the Picard ite...

preprint numerics no. 4/2007 norwegian university of science and technology trondheim, norway Abstract. In the last years, implicit SRK methods have been developed both for strong and weak approximation. For these methods, the stage values are only given implicitly. However, in practice these implicit equations are solved by iterative schemes like simple iteration, modified Newton iteration or ...

with kn ≥ 0, rn ≥ 0, kn → 1, rn → 0 n → ∞ , for each x, y ∈ C, n 0, 1, 2, . . . . If kn 1 and rn 0, 1.1 reduces to nonexpansive mapping; if rn 0, 1.1 reduces to asymptotically nonexpansive mapping; if kn 1, 1.1 reduces to asymptotically nonexpansive-type mapping. So, a generalized asymptotically nonexpansive mapping is much more general than many other mappings. Browder 1 introduced the followi...

It often happens that iteration processes used for solving the implicit relations arising in ODE-IVP methods only start to converge rapidly after a certain number of iterations. Fast convergence right from the beginning is particularly important if we want to use so-called step-parallel iteration in which the iteration method is concurrently applied at a number of step points. In this paper, we...

in this paper, an iterative method is proposed for solving the matrix inverse problem $ax=b$ for hermitian-generalized hamiltonian matrices with a submatrix constraint. by this iterative method, for any initial matrix $a_0$, a solution $a^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...

In this paper, we show that the modified Mann iteration with errors converges strongly to fixed point for uniformly L-Lipschitzian asymptotically Φ-pseudocontractive mappings in real Banach spaces. Meanwhile, it is proved that the convergence of Mann and Ishikawa iterations is equivalent for uniformly L-Lipschitzian asymptotically Φpseudocontractive mappings in real Banach spaces. Finally, we o...

The Waterfall model has dominated software development for many years, but iteration of processes is catching in. There is now a number of well-established iterative development process models that can be classified according to the levels where iteration is applied. Iteration can improve validation and verification by allowing earlier quality feedback. Moreover, there seems to be a secret marr...

In this paper, we introduce a generalized iteration scheme with errors for convergence to common fixed points of two nonexpansive mappings. This scheme contains a wide variety of existing iteration schemes as its special cases. The main feature of this scheme is that its special cases can handle both strong convergence like Halpern-type and weak convergence like Ishikawatype iteration schemes. ...