Waveform relaxation is a numerical method for solving large-scale systems of ordinary differential equations on parallel computers. It differs from standard iterative methods in that it computes the solution on many time levels or along a continuous time interval simultaneously. This paper deals with the acceleration of the standard waveform relaxation method by successive overrelaxation (SOR) ...

We present an approach to invariant matching. In this approach, an object or a pattern is invariantly represented by an object-centered description called an attributed relational structure (ARS) embedding invariant properties and relations between the primitives of the pattern such as line segments and points. Noise eeect is taken into account such that a scene can consist of noisy sub-parts o...

In this paper we present an eecient parallel implementation of relaxation iterative methods , such as the Gauss-Seidel (GS) and Successive-Over-Relaxation (SOR), for solving banded linear systems on distributed memory machines. We introduce a novel partitioning and scheduling scheme in our implementation which allows perfect overlapping of computation with communication, hence minimizing latenc...

Problem statement: A new variant of the Successive Overrelaxation (SOR) method for solving linear algebraic systems, the KSOR method was introduced. The treatment depends on the assumption that the current component can be used simultaneously in the evaluation in addition to the use the most recent calculated components as in the SOR method. Approach: Using the hidden explicit characterization ...

The eigenvalue problem Ax = \Bx, where A and B are large and sparse symmetric matrices, is considered. An iterative algorithm for computing the smallest eigenvalue and its corresponding eigenvector, based on the successive overrelaxation splitting of the matrices, is developed, and its global convergence is proved. An expression for the optimal overrelaxation factor is found in the case where A...

The finite difference discretization of the Poisson equation with Dirichlet boundary conditions leads to a large, sparse system of linear equations for the solution values at the interior mesh points. This problem is a popular and useful model problem for performance comparisons of iterative methods for the solution of linear systems. To use the successive overrelaxation (SOR) method in these c...

A curious phenomenon when it comes to solving the linear system formulation of the PageRank problem is that while the convergence rate of Gauss–Seidel shows an improvement over Jacobi by a factor of approximately two, successive overrelaxation (SOR) does not seem to offer a meaningful improvement over Gauss–Seidel. This has been observed experimentally and noted in the literature, but to the be...

Based on the fast stable convergence characteristics of successive over relaxation (SOR) iterative and Jacobi GaussSeidel (JGS) iterative, a blind adaptive SOR/JGS iterative Kalman multi-user detection (MUD) algorithm (SJK) is proposed for multiple access communication system as direct sequence spread spectrum code division multiple access (DSCDMA) system with multi-path fading channel. The pro...

In this research, a comparison of the convergence rate different basic methods is made in order to solve Poisson equation, which similar some resulting equations computational fluid mechanics. The Jacobi method, point Gauss-Seidel successive over-relaxation method (SOR), line Gauss (TDMA), ADI and Strongly Implicit (SIP) are among iterative approaches investigated, then compared find most optim...