Computational issues in nanotechnology and stochastic computing. Ashok Srinivasan Department of Computer Science Florida State University. Motivation. Research areas Parallel algorithms Scientific computing Discrete algorithms Applications. Motivation ... 2.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Department of Computer Science
Florida State University
Conventional particle methods, with pair-wise interactions
Partition the vertices into components of equal size such the number of edges between vertices in different components is minimized
Heuristic: Compute the Fiedler vector of L. Partition vertices such that all vertices with Fiedler component smaller than the median are in one component, and the rest in another. Recursively apply this algorithm.
Given a similarity function f, find a permutation psuch that p(i) < p(j) < p(k) implies f(i,j) > f(i,k)
Heuristic: Compute the Fiedler vector of L. Order vertices by the values of the corresponding components of the Fiedler vector.
Edge cut and time using deflated matrix, relative to exact Fiedler vector, for inverse iterations. Solid line – test.graph, dash-dotted line – hammond.graph.
Comparison of current stationary process (solid line), with Jacobi (dash-dotted) and Gauss-Seidel (dashed), for test.graph.