• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap

      Thumbnail
      View/Open
      Full printable version (1.062Mb)
      Author
      Acer, S.
      Kayaaslan, E.
      Aykanat, C.
      Date
      2013
      Journal Title
      SIAM Journal on Scientific Computing
      ISSN
      1064-8275
      Publisher
      Society for Industrial and Applied Mathematics
      Volume
      35
      Issue
      1
      Pages
      C99 - C121
      Language
      English
      Type
      Article
      Metadata
      Show full item record
      Please cite this item using this persistent URL
      http://hdl.handle.net/11693/21000
      Abstract
      We investigate the problem of symmetrically permuting a square sparse matrix into a block diagonal form with overlap. This permutation problem arises in the parallelization of an explicit formulation of the multiplicative Schwarz preconditioner and a more recent block overlapping banded linear solver as well as its application to general sparse linear systems. In order to formulate this permutation problem as a graph theoretical problem, we define a constrained version of the multiway graph partitioning by vertex separator (GPVS) problem, which is referred to as the ordered GPVS (oGPVS) problem. However, existing graph partitioning tools are unable to solve the oGPVS problem. So, we also show how the recursive bipartitioning framework can be utilized for solving the oGPVS problem. For this purpose, we propose a left-to-right bipartitioning approach together with a novel vertex fixation scheme so that existing 2-way GPVS tools that support fixed vertices can be effectively and efficiently utilized in the recursive bipartitioning framework. Experimental results on a wide range of matrices confirm the validity of the proposed approach. © 2013 Society for Industrial and Applied Mathematics.
      Published as
      http://dx.doi.org/10.1137/120861242
      Collections
      • Department of Computer Engineering 1107

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the webmaster. Phone: (312) 290 1771
      Copyright © Bilkent University | Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin