This paper proposes a geometric iteration algorithm for computing point projection and inversion on planar parametric curves based on local biarc approximation. The iteration begins with initial estimation of the projection of the prescribed test point. For each iteration, we construct a biarc that locally approximates a segment on the original curve starting from the current projective point. ...

Vehicle manufacturers worldwide are increasingly relying on road simulation facilities that put simulated loads and stresses on vehicles and subassemblies in order to shrink development time. Road simulation algorithm is the key point of developing road simulation system. With the rapid progress of computer technology, more complex algorithms can be utilized. First, multi-input exciting method ...

Berinde [V. Berinde, Approximating fixed points of weak contractions using the Picard iteration, Nonlinear Anal. Forum {bf 9} (2004), 43-53] introduced almost contraction mappings and proved Banach contraction principle for such mappings. The aim of this paper is to introduce the notion of multivalued almost $Theta$- contraction mappings andto prove some best proximity point results for t...

This paper introduces a new averaged algorithm for finding a common fixed point of a countably infinite family of generalized k-strictly pseudocontractive multi-valued mappings. The new iterative sequence introduced is proved to be an approximating fixed point sequence for common fixed points of a countably infinite family of this class of mappings. Furthermore, under some mild assumptions, str...

Multi-view stereo estimates the depth maps of multiple perspective images in a scene and then fuses them to generate 3D point cloud scene, which is an essential technology reconstruction. In this paper, we propose deep learning method GDINet, applying probabilistic methods pyramid framework, can significantly improve reconstruction quality. detail, first establish Gaussian distribution for each...

Received: 09 Mar. 2012; Revised 23 Jul. 2012; Accepted 02 Sep. 2012 Received: May 8, 2012; Revised June 1, 2012; Accepted June 5, 2012 Abstract: In this paper, we’ll give some new conclusion of fixed point related to the multi-valued map, the calculation of fixed point index, and the solutions to nonlinear equations by using VIM. We apply the effective modification of its variation iteration me...

ABSTRACT— Digital signal processing algorithms are described by iterative data-flow graphs where nodes represent computations and edges represent communications. In this paper we propose a novel method to determine the iteration bound, which is the fundamental lower bound of the iteration period of a processing algorithm, by using the minimum cycle mean algorithm to achieve a lower polynomial t...

A new iterative learning controller is proposed for a general unknown discrete time-varying nonlinear non-affine system represented by NARMAX (Nonlinear Autoregressive Moving Average with eXogenous inputs) model. The proposed controller is composed of an iterative learning neural identifier and an iterative learning controller. Iterative learning control and iterative learning identification ar...

In this article, we introduce a new multi-step iteration for approximating a common fixed point of a finite class of multi-valued Bregman relatively nonexpansive mappings in the setting of reflexive Banach spaces. We prove a strong convergence theorem for the proposed iterative algorithm under certain hypotheses. Additionally, we also use our results for the solution of variational inequality p...

In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.