Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Murat Manguoğlu
E-mail
mmanguog@metu.edu.tr
Department
Department of Computer Engineering
ORCID
0000-0002-9639-3907
Scopus Author ID
23994437100
Publications
Theses Advised
Open Courses
Projects
A distributed memory parallel randomized Kaczmarz for sparse system of equations
Bölükbaşı, Ercan Selçuk; TORUN, FAHREDDİN ŞÜKRÜ; Manguoğlu, Murat (2024-01-01)
Kaczmarz algorithm is an iterative projection method for solving system of linear equations that arise in science and engineering problems in various application domains. In addition to classical Kaczmarz, there are random...
ENHANCING BLOCK CIMMINO FOR SPARSE LINEAR SYSTEMS WITH DENSE COLUMNS VIA SCHUR COMPLEMENT
TORUN, FAHREDDİN ŞÜKRÜ; Manguoğlu, Murat; Aykanat, Cevdet (2023-01-01)
The block Cimmino is a parallel hybrid row-block projection iterative method successfully used for solving general sparse linear systems. However, the convergence of the method degrades when angles between subspaces spanne...
Partitioning and Reordering for Spike-Based Distributed-Memory Parallel Gauss--Seidel
Torun, Tugba; Torun, F. Sukru; Manguoğlu, Murat; Aykanat, Cevdet (2022-04-01)
Gauss--Seidel (GS) is a widely used iterative method for solving sparse linear sys-tems of equations and also known to be effective as a smoother in algebraic multigrid methods.Parallelization of GS is a...
A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers
Mehrmann, Volker; Manguoğlu, Murat (2021-01-01)
We propose a two-level iterative scheme for solving general sparse linear systems. The proposed scheme consists of a sparse preconditioner that increases the norm of the skew-symmetric part relative to the rest and makes t...
A parallel multithreaded sparse triangular linear system solver
Cugu, Ilke; Manguoğlu, Murat (Elsevier BV, 2020-07-15)
We propose a parallel sparse triangular linear system solver based on the Spike algorithm. Sparse triangular systems are required to be solved in many applications. Often, they are a bottleneck due to their inherently sequ...
Parallel Hybrid Sparse Linear System Solvers
Manguoğlu, Murat; Sameh, Ahmed (Birkhäuser Basel, 2020-07-01)
The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
Selvitopi, Oguz; Acer, Seher; Manguoğlu, Murat; Aykanat, Cevdet (null, 2020-07-01)
The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
Selvitopi, Oğuz; Acer, Seher; Manguoğlu, Murat; Aykanat, Cevdet (Birkhäuser, 2020-01-01)
Parallel Hybrid Sparse Linear System Solvers
Manguoğlu, Murat; Sameh, Ahmed (Birkhäuser, 2020-01-01)
A parallel bio-inspried shortest path algorithm
arslan, hilal; Manguoğlu, Murat (Springer Science and Business Media LLC, 2019-08-01)
Physarum polycephalum is an amoeba-like organism and is able to find the shortest path in a labyrinth. Inspired by P. polycephalum, recently, a mathematical model and an algorithm (Physarum Solver) was developed. There are...
F
P
1
2
3
4
5
N
E
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX