in this paper we consider the solutions of linear systems of saddle point problems‎. ‎by using the spectrum of a quadratic matrix polynomial‎, ‎we study the eigenvalues of the iterative matrix of the hermitian and skew hermitian splitting method‎.

* Correspondence: fuquanxia@sina. com Department of Mathematics, Sichuan Normal University, Chengdu, Sichuan 610066, P. R. China Full list of author information is available at the end of the article Abstract In this paper, a projective splitting method for solving a class of generalized mixed variational inequalities is considered in Hilbert spaces. We investigate a general iterative algorithm...

this paper proposes a triangulation method for a digitized surface whose points are located on a regular lattice. the method relies on an iterative and adaptive splitting of triangular faces of an initial polyhedral surface. assuming a bijection between the digitized surface and its approximation, a partition of the data base is performed. the method allows the measurement of the local quality ...

Iterative splitting methods have a huge amount to compute matrix exponential. Here, the acceleration and recovering of higher-order schemes can be achieved. From a theoretical point of view, iterative splitting methods are at least alternating Picards fix-point iteration schemes. For practical applications, it is important to compute very fast matrix exponentials. In this paper, we concentrate ...

In this paper, we present new preconditioned generalized mixed-type splitting (GMTS) methods for solving weighted linear least square problems. We compare the spectral radii of the iteration matrices of the preconditioned and the original methods. The comparison results show that the preconditioned GMTS methods converge faster than the GMTS method whenever the GMTS method is convergent. Finally...

This paper proposes a triangulation method for a digitized surface whose points are located on a regular lattice. The method relies on an iterative and adaptive splitting of triangular faces of an initial polyhedral surface. Assuming a bijection between the digitized surface and its approximation, a partition of the data base is performed. The method allows the measurement of the local quality ...

A class of splitting iterative methods are considered for solving fuzzy system of linear equations, which covers Jacobi, Gauss Seidel, SOR, SSOR and their block variance proposed. Theoretical analysis showed that for a regular splitting, the corresponding iterative method converge to the unique fuzzy solution for any initial vector and fuzzy right hand side vector. Finally, we illustrate our ap...

In this paper we consider the solutions of linear systems of saddle point problems‎. ‎By using the spectrum of a quadratic matrix polynomial‎, ‎we study the eigenvalues of the iterative matrix of the Hermitian and skew Hermitian splitting method‎.

This paper proposes a triangulation method for a digitized surface whose points are located on a regular lattice. The method relies on an iterative and adaptive splitting of triangular faces of an initial polyhedral surface. Assuming a bijection between the digitized surface and its approximation, a partition of the data base is performed. The method allows the measurement of the local quality ...