[1] A new, efficient, and highly accurate method for tracing magnetic separators in global magnetospheric simulations with arbitrary clock angle is presented. The technique is to begin at a magnetic null and iteratively march along the separator by finding where four magnetic topologies meet on a spherical surface. The technique is verified using exact solutions for separators resulting from an...

In present study, a three-step multi-objective optimization algorithm of cyclone separators is catered for the design objectives. First, the pressure drop (Dp) and collection efficiency (h) in a set of cyclone separators are numerically evaluated. Secondly, two meta models based on the evolved Group Method of Data Handling (GMDH) type neural networks are regarded to model the Dp and h as the re...

In this paper we present the Spike algorithm of Sameh and Polizzi in the context of domain decomposition methods. We present several variants that differ in their treatment of the separators, showing that one of these is equivalent to the Spike algorithm. Eijkhout and van de Geijn Spike factorizations Figure 1: A one-dimensionally partitioned domain with 4 subdomains and 3 separators

We introduce novel approaches of graph decomposition based on optimal separators and atoms generated by minimal clique separators. The decomposition process is applied to co-word graphs extracted from Web Of Science database. Two types of graphs are considered: co-keyword graphs based on the human indexation of abstracts and terminology graphs based on semi-automatic term extraction from abstra...

We present an eecient algorithm which computes the set of minimal separators of a graph in O(n 3) time per separator, thus gaining a factor of n 2 on the current best-time algorithms for this problem. Our process is based on a new structural result, derived from Kloks and Kratsch's work on listing all the minimal separators of a graph.

We present a new algorithm to compute small node separators on large, undirected graphs ensuring a user defined balance on the induced connected components. Our algorithm uses edge separators computed by the open source graph partitioning package KaHIP [42] and a new technique to transform them into node separators. Given an undirected graph G, our algorithm constructs a flow problem on a subgr...

We consider sparse matrices arising from nite-element or nite-diierence methods. The graphs of such matrices are embedded in two or three dimensional Euclidean space, and the coordinates of their vertices are readily available. Such coordinate information was used earlier to develop a parallel Cartesian nested dissection heuristic that computes a ll reducing ordering for a matrix with an embedd...

This paper derives a necessary and sufficient condition for robust stability of sampleddata systems, which is stated by using the notion of separators that are dealt with in an operator-theoretic framework. Such operator-theoretic treatment of separators provides a new perspective, which we call noncausal linear periodically time varying scaling and leads to reducing conservativeness in robust ...

An approach to log-linear modelling for a large contingency table is proposed in this paper. A main idea in this approach is that we group the random variables that are involved in the data into several subsets of variables with corresponding marginal contingency tables, build graphical log-linear models for the marginal tables, and then combine the marginal models using graphs of prime separat...