Numerical Performance of an Asynchronous Jacobi Iteration
نویسندگان
چکیده
We examine the eeect of removing synchronisation points from a parallel implementation of a simple iterative algorithm|Jacobi's method for linear systems. We nd that in some cases the asynchronous version requires fewer iterations to converge than its synchronous counterpart. We show that this behaviour can be explained in terms of the presence or absence of oscillations in the sequence of error vectors in the synchronous version, and that removing the synchronisation point can damp the oscillations.
منابع مشابه
PARMI: A Publish/Subscribe Based Asynchronous RMI Framework for Cluster Computing
This paper presents a publish/subscribe based asynchronous remote method invocation framework (PARMI) aiming to improve performance and programming flexibility. PARMI enables high-performance communication among heterogeneous distributed processors. Based on publish/subscribe paradigm, PARMI realizes asynchronous communication and computation by decoupling objects in space and time. The design ...
متن کاملBit Error Performance for Asynchronous Ds Cdma Systems Over Multipath Rayleigh Fading Channels (RESEARCH NOTE)
In recent years, there has been considerable interest in the use of CDMA in mobile communications. Bit error rate is one of the most important parameters in the evaluation of CDMA systems. In this paper, we develop a technique to find an accurate approximation to the probability of bit error for asynchronous direct–sequence code division multiple–access (DS/CDMA) systems by modeling the multipl...
متن کاملComplexity Reduction Approach with Jacobi Iterative Method for Solving Composite Trapezoidal Algebraic Equations
In this paper, application of the complexity reduction approach based on halfand quarter-sweep iteration concepts with Jacobi iterative method for solving composite trapezoidal (CT) algebraic equations is discussed. The performances of the methods for CT algebraic equations are comparatively studied by their application in solving linear Fredholm integral equations of the second kind. Furthermo...
متن کاملAn Efficient Numerical Method for a Class of Boundary Value Problems, Based on Shifted Jacobi-Gauss Collocation Scheme
We present a numerical method for a class of boundary value problems on the unit interval which feature a type of exponential and product nonlinearities. Also, we consider singular case. We construct a kind of spectral collocation method based on shifted Jacobi polynomials to implement this method. A number of specific numerical examples demonstrate the accuracy and the efficiency of the propos...
متن کاملA Jacobi-Davidson Method for Solving Complex Symmetric Eigenvalue Problems
We discuss variants of the Jacobi–Davidson method for solving the generalized complex-symmetric eigenvalue problem. The Jacobi–Davidson algorithm can be considered as an accelerated inexact Rayleigh quotient iteration. We show that it is appropriate to replace the Euclidean inner product xy in C by the bilinear form x y. The Rayleigh quotient based on this bilinear form leads to an asymptotical...
متن کامل