This paper proposes a k-group alignment algorithm for multiple alignment as a practical method. In iterative improvement methods for multiple alignment, the so-called group-togroup two-dimensional dynamic programming has been used, and in this respect our proposal is to extend the ordinary two-group dynamic programming to a k-group alignment programming. This extension is conceptually straightf...

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...

It is well-known that for many project scheduling problems the space AS of active schedules contains at least one optimal solution for each feasible instance, so restricting heuristic construction methods to AS will improve algorithmic efficiency without foresaking the chance to eventually find an optimal schedule. Yet, for some problems such results are not directly applicable. We address one ...

Practical simulators require high-performance iterative methods and efficient implementations of various boundary conditions, which reflect real-world effects. A nobel Bit-representation technique is proposed to enhance the performance of such a code. This technique is applied to the implementation of iterative kernels that treat various boundary conditions. The first advantage of this approach...