This paper gives the comparison of some iterative methods (Jacobi method, Gauss–Seidel method and the Successive over-relaxation method) for solving systems of linear equations with their asynchronous implementations. Experiments show the effectiveness of asynchronous iterative methods for solving linear algebra problems on parallel multiprocessor systems.

Higher order discretizations have not been widely successful in industrial applications to compressible flow simulation. Among several reasons for this, one may identify the lack of tailor-suited, best-practice relaxation techniques that compare favorably to highly tuned lower order methods, such as finite-volume schemes. In this paper we investigate efficient Spectral Difference discretization...

Ahstract In this paper it is assumed that the point (or block) Jacobi manix. B associated with the matrix A is weakly 2-cyclic consistently ordered with complex, in general, eigen-value spectrum, a(B), lying in the interior of the infinite unit strip. It is then our objec~ live to apply and ex.tend the Young-Eidson algorithm in order to determine the real optimum relaxation factor in the follow...

The performance of six variants of the successive overrelaxation methods (SOR) are considered for an algebraic system arising from a finite difference treatment of an elliptic equation of Partial Differential Equations (PDEs) on a triangular region. The consistency of the finite difference representation of the system is achieved. In the finite difference method one obtains an algebraic system ...

Solving nonlinear equations is a problem often needed to be dealt with in the practical engineering application. This paper discusses preconditioning methods based on Block Broyden method. It first introduces the Block Broyden method and preconditioning technique. Then it presents four different preconditioners for the Block Broyden method and discusses the implementation process. It also analy...

Abstract: Training a SVR (support vector regression) requires the solution of a very large QP (quadratic programming) optimization problem. Despite the fact that this type of problem is well understood, the existing training algorithms are very complex and slow. In order to solve these problems, this paper firstly introduces a new way to make SVR have the similar mathematic form as that of a su...