New explicit group S.O.R. methods suitable for use on an asynchronous MIMD computer are presented for the numerical solution of the sparse linear systems derived from the discretization of two-dimensional , second-order, elliptic boundary value problems. A comparison with existing implicit line S.O.R. schemes for the Dirichlet model problem shows the new schemes to be superior (Barlow and Evans...

0

in this paper, we present gauss-sidel and successive over relaxation (sor) iterative methods for finding the approximate solution system of fuzzy sylvester equations (sfse), ax + xb = c, where a and b are two m*m crisp matrices, c is an m*m fuzzy matrix and x is an m*m unknown matrix. finally, the proposed iterative methods are illustrated by solving one example.

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

In this work, the method of iterative Fourier transform phase reconstruction, conventionally used in holography and optical image reconstruction, is applied to phase only synthesis of antenna patterns. The method is applied to two types of pattern synthesis problems: "main lobe beam shaping" and "side-lobe-level reduction". The proposed method is most useful in the efficient employment of attai...