In th is paper, an algorithm is presented for identification of real eigenvalues on right half of the s-plane, for linear systems, hence determining instability of the system. The proposed approach is based on Gerschgorin theorem and a new approach of Bisection method. The method is efficient since there is no need to determine all real eigenvalues and also characteristic polynomial of the syst...

In this thesis, we describe a polynomial time algorithm that, for every input graph, either outputs the minimum bisection of the graph or halts without output. More importantly, we show that the algorithm chooses the former course with high probability for many natural classes of graphs. In particular, for every fixed d > 3, all sufficiently large n and all b = o(ni-1/d2lJ), the algorithm finds...

In the paper, we describe a polynomial time algorithm that, for every input graph, either outputs the minimum bisection of the graph or halts without output. More importantly, we show that the algorithm chooses the former course with high probability for many natural classes of graphs. In particular, for every fixed d 2 3, all suffciently large n and all b = o(nl l / lT j ) , the algorithm find...

In rough set theory, attribute reduction aims to retain the discernability of the original attribute set, and many attribute reduction algorithms have been proposed in literatures. However, these methods are computationally time-consuming for large scale datasets. We develop a bisection method for attribute reduction and the main opinion is to partition the universe into smaller ones by using p...

In this paper we compare nested dissection orderings obtained by diierent graph bisection heuristics. In the context of parallel sparse matrix factorization the quality of an ordering is not only determined by its ll reducing capability, but also depends on the dif-culty with which a balanced mapping of the load onto the processors of the parallel computer can be found. Our analysis shows that ...

Integer least square problem is widely used in wireless communications, cryptography and some other fields. In this study, the authors propose a radius bisection algorithm with restart strategy to solve the ILS problem. Compared with the original sphere-decoding method, the algorithm can solve the ILS problem with higher speed and lower complexity. Also, users can specify a stop criterion to co...

The simplest model of this form is for the graph bisection problem. This is the problem of partitioning the vertices of a graph into two equal-sized sets while minimizing the number of edges bridging the sets. To create an instance of the planted bisection problem, we first choose a paritition of the vertices into equal-sized sets V 1 and V 2. When then choose probabilities p > q, and place edg...

Lazar & Mykland (1999) showed that an empirical likelihood defined by two estimating equations with a nuisance parameter need not be Bartlett correctable. This paper shows that Bartlett correction of empirical likelihood in the presence of a nuisance parameter depends critically on the way the nuisance parameter is removed when formulating the likelihood for the parameter of interest. We establ...

First we introduce a mesh density function that serves as a criterion to decide, where a simplicial mesh should be fine (dense) and where it should be coarse. Further, we propose a new bisection algorithm that chooses for bisection an edge in a given mesh associated with the maximum value of the mesh density function. Dividing this edge at its midpoint, we correspondingly bisect all simplices s...

We present a tool, Bisect, for balanced decomposition of spatial domains. In addition to applying a nested bisection algorithm to determine the boundaries of each subdomain, Bisect replicates a user speciied zone along the boundaries of the subdomain in order to minimize future interactions between subdomains. Results of running the tool on the Cray T3D system using both shared memory operation...