This paper presents a new 4-points Explicit Group Unsymmetric Successive Overrelaxation (USSOR) iterative method to approximate the solution of the linear systems derived from the discretisation of self-adjoint elliptic partial equations. Several studies have been carried out by many researchers on the USSOR iterative method, for example, the analysis of its convergence [1], an upper bound for ...

It is proposed to parse feature structure-based grammars in several steps. Each step is aimed to eliminate as many invalid analyses as possible as e ciently as possible. To this end the set of feature constraints is divided into three subsets, a set of context-free constraints, a set of ltering constraints and a set of structure-building constraints, which are solved in that order. The best pro...

By simply transforming the quadratic matrix equation into an equivalent fixed-point equation, we construct a successive approximation method and a Newton’s method based on this fixed-point equation. Under suitable conditions, we prove the local convergence of these two methods, as well as the linear convergence speed of the successive approximation method and the quadratic convergence speed of ...

We propose an algorithm for deinterlacing of interlaced video sequences. It successively builds approximations to the deinterlaced sequence by weighting various interpolation methods. A particular example given here uses four interpolation methods, weighted according to the errors each one introduces. Due to weighting, it is an adaptive algorithm. It is also time-recursive, since the motion-com...