The study of the problem of Magneto Hydrodynamic viscous flow due to a shrinking sheet of Micropolar fluids has been solved numerically by using SOR method with Simpson (1/3) Rule. The similarity transformations have been used to reduce the highly nonlinear partial differential equations of motion to ordinary differential equations. The resulting equations are then integrated by using appropria...

We introduce a chip-level linear group-wise successive interference cancellation (GSIC) multiuser structure that is asymptotically equivalent to block successive over-relaxation (BSOR) iteration, which is known to outperform the conventional block GaussSeidel iteration by an order of magnitude in terms of convergence speed. The main advantage of the proposed scheme is that it uses directly the ...

We show that there is a polynomial-time algorithm with approximation guarantee 3 2 + ε for the s-t-path TSP, for any fixed ε > 0. It is well known that Wolsey’s analysis of Christofides’ algorithm also works for the s-t-path TSP with its natural LP relaxation except for the narrow cuts (in which the LP solution has value less than two). A fixed optimum tour has either a single edge in a narrow ...

Network community detection—the problem of dividing a network of interest into clusters for intelligent analysis—has recently attracted significant attention in diverse fields of research. To discover intrinsic community structure a quantitative measure called modularity has been widely adopted as an optimization objective. Unfortunately, modularity is inherently NP-hard to optimize and approxi...

The discretization of the two-dimensional convection-diffusion equation usually leads to a linear system whose matrix coefficient is block two-cyclic consistently ordered. For the solution of the resulting linear system, several efficient stationary iterative methods were proposed, among others, by Chin and Manteuffel (1988), Elman and Golub (1990), de Pillis (1991) and Eiermann, Niethammer and...

Accurate performance predictions are difficult to achieve for parallel applications executing on production distributed systems. Conventional point-valued performance parameters and prediction models are often inaccurate since they can only represent one point in a range of possible behaviors. We address this problem by allowing characteristic application and system data to be represented by a ...

The scalability and robustness of a class of non-overlapping domain decomposition preconditioners using 2-way nested dissection reordering is studied. In particular, three methods are considered: a nested symmetric successive over-relaxation (NSSOR), a nested version of modified ILU with rowsum constraint (NMILUR), and nested filtering factorization (NFF). The NMILUR preconditioner is exact wit...

Recently, several proposals for the generalization of Young’s SOR method to the saddle point problem or the augmented system has been presented. One of the most practical versions is the SOR-like method given by Golub et al., [(2001). SOR-like methods for augmented systems. BIT, 41, 71–85.], where the convergence and the determination of its optimum parameters were given. In this article, a ful...

For the augmented system of linear equations, Zhang and Lu (2008) recently studied the generalized symmetric SOR method (GSSOR) with two parameters. In this note, the optimal parameters of the GSSOR method are obtained, and numerical examples are given to illustrate the corresponding results. © 2014 Elsevier B.V. All rights reserved.