I am a Ph.D. Candidate at Computer Engineering Department of Bilkent University in Turkey. I am working with Prof. Dr. Cevdet Aykanat. I received my B.S. and M.S. degrees from the same department in 2009 and 2011, respectively. My research interests are combinatorial scientific computing and parallel algorithms. I am specifically interested in matrix reordering and graph/hypergraph partitioning problems.
My e-mail address is acer[at]cs[dot]bilkent[dot]edu[dot]tr.
Research News: oGPVS/BDO software package is ready!
In the recent work, "A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap, Seher Acer, Enver Kayaaslan, Cevdet Aykanat, SIAM J. Scientific Computing 35(1) (2013)", we developed a tool, namely oGPVS/BDO, for permuting sparse square matrices into Block Diagonal form with Overlap (BDO form) using ordered Graph Partitioning by Vertex Separators (oGPVS). A matrix in BDO form is a block diagonal matrix where consecutive diagonal blocks may overlap. Here are some examples of how a matrix permuted using oGPVS/BDO tool looks like:
6-way BDO form of copter2
6-way BDO form of 1138_bus
Besides the diagonal blocks structure, oGPVS/BDO tool achieves the minimization of the total overlap size between diagonal blocks and a balance on the number of nonzeros of the diagonal blocks. For more theoretical details, please see the related paper. For more practical details, please see the user manual of the tool. For the oGPVS/BDO library, related source code, and a stand-alone program, please download the oGPVS/BDO package . If you encounter any bugs, please notify me.