An improved Ritt-Wu’s decomposition (of an algebraic set into the union of irreducible varieties) algorithm is given. The algorithm has been used to prove geometric theorems that Wu’s original method addresses. Unlike Wu’s original approach, nondegenerate conditions are given explicitly at the beginning, not generated during the proof process. A program based on this improved version of the alg...

In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...

in this paper, an unsupervised classification method using spatial contextual information for polarimetric sar (polsar) image classification is proposed. first, an unsupervised classification based on 2d h/▁α plane was performed, using cloude/pottier target decomposition algorithm. in order to compute the initial values of the cluster centers and hence a rapid convergence of the algorithm, the ...

This paper proposes a simplified solution procedure to the model presented by Akinc and Roodman. The Benders’ decomposition procedure for analyzing this model has been developed, and its shortcomings have been highlighted. Here, the special nature of the problem is exploited which allowed us to develop a new algorithm through surrogating method. The two methods are compared by several numerical...

This paper mainly designed a new method of using the Parallel LU Decomposition Algorithm for solving large-scale dense linear equations on the basis of the strategy of divide and rule,and analyzed the speedup and efficiency of the Parallel LU Decomposition Algorithm. In theory, it could improve the efficiency of problem-solving. In addition, the extension of Parallel LU Decomposition Algorithm,...