Learning the Domain of Sparse Matrices

Date

2016-12-20

Author

Salm, Suleyman
Manguoğlu, Murat
Aktulga, Hasan Metin

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

186
views

0
downloads

Large sparse linear system of equations arise in many areas of science and engineering. Although, there are several black-box general sparse solvers, usually they are not as effective as domain specific solvers. In addition, most solvers contain multiple choices during the solution process which can be tailored to a specific domain. A natural first step towards a black-box solver that is as effective as domain specific solvers is to come up with a technique to identify the application domain of the problem. In this work, we propose to use some computationally inexpensive matrix properties for the classification task, and apply several classifiers to identify the application domain. Experiments on a large set of sparse matrices show that the domain information is predicted with 75.9% overall accuracy, and matrices in a specific domain can be predicted with 99% accuracy.

Subject Keywords

Spike, Computationally inexpensive matrix properties, Sparse matrices

URI

https://hdl.handle.net/11511/37743

DOI

https://doi.org/10.1109/icmla.2016.124

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Parallel solution of sparse triangular linear systems on multicore platforms Çuğu, İlke; Manguoğlu, Murat; Department of Computer Engineering (2018) Many large-scale applications in science and engineering require the solution of sparse linear systems. One well-known approach is to solve these systems by factorizing the coefficient matrix into nonsingular sparse triangular matrices and solving the resulting sparse triangular systems via backward and forward sweep (substitution) operations. This can be considered as a direct solver or it is part of the preconditioning operation in an iterative scheme if incomplete factorization is computed. Often, these ...
How Generous is the ELLPACK Sparse Matrix Storage Scheme for Finite Element Computations Akinci, Gokay; YILMAZ, ASIM EGEMEN; Kuzuoğlu, Mustafa (2012-11-03) Sparse matrices are occasionally encountered during solutions of various problems by means of numerical methods, such as the finite element method. ELLPACK sparse matrix storage scheme, one of the most widely used methods due to its implementation ease, is investigated in this study. The scheme uses excessive memory due to its definition. For the conventional finite element method, where the node elements are used, the excessive memory caused by redundant entries in the ELLPACK sparse matrix storage scheme ...
Modified iterative methods for linear systems of equations Karasözen, Bülent (1998-01-01) An extension of the modified Jacobi and Gauss-Seidel methods for systems of linear equations has been introduced. The convergence properties of the proposed methods have been analyzed and compared with the classical and modified methods. The numerical results obtained for some linear systems show that the extended modified methods are superior to other modified iterative methods.
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 challenging task since solving the sparse lower triangular system in GSconstitutes a sequential bottleneck at each iteration. We propose a distributed-memory parallel GS(dmpGS) by implementing a parallel sparse triangular solver (stSpike) based on the Spike algorithm.stSpike d...
Solving optimal control time-dependent diffusion-convection-reaction equations by space time discretizations Seymen, Zahire; Karasözen, Bülent; Department of Mathematics (2013) Optimal control problems (OCPs) governed by convection dominated diffusion-convection-reaction equations arise in many science and engineering applications such as shape optimization of the technological devices, identification of parameters in environmental processes and flow control problems. A characteristic feature of convection dominated optimization problems is the presence of sharp layers. In this case, the Galerkin finite element method performs poorly and leads to oscillatory solutions. Hence, thes...

Citation Formats

S. Salm, M. Manguoğlu, and H. M. Aktulga, “Learning the Domain of Sparse Matrices,” 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37743.