Abstract. An algorithm dubbed double Divide and Conquer is recently proposed, which first computes only singluar values by a part of Divide and Conquer and then computes the corresponding singular vectors by the twisted factorization. It accurately computes bidiagonal SVD in O(n) flops and is suited for parallelization when singular values are isolated. However, the twisted factorization can fa...

Algorithmic skeletons intend to simplify parallel programming by providing recurring forms of program structure as predefined components. We present a new distributed task parallel skeleton for a very general class of divide and conquer algorithms for MIMD machines with distributed memory. Our approach combines skeletal internal task parallelism with stream parallelism. This approach is compare...

We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.

This paper presents a Divide and Conquer strategy to estimate the kinematic parameters of parallel symmetrical mechanisms. The Divide and Conquer kinematic identification is designed and performed independently for each leg of the mechanism. The estimation of the kinematic parameters is performed using the inverse calibration method. The identification poses are selected optimizing the observab...

The divide and conquer method is a typical granular computing method using multiple levels of abstraction and granulations. So far, although some achievements based on divided and conquer method in the rough set theory have been acquired, the systematic methods for knowledge reduction based on divide and conquer method are still absent. In this paper, the knowledge reduction approaches based on...

Divide-and-conquer is one of the most basic techniques in thedesign and analysisof algorithms, and yet, until recently, therehavebeen essentially no performanceguaranteesknown for approximation algorithms based on this approach. This chapter will present approximation algorithmsfor several NPhard graph-theoretic cut problems, and their subsequent application asa tool for the “divide” part of di...