The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
DOI10.1007/978-3-030-43736-7_2OpenAlexW3038833321MaRDI QIDQ3300489FDOQ3300489
Authors: Oguz Selvitopi, Seher Acer, Murat Manguoglu, Cevdet Aykanat 
Publication date: 29 July 2020
Published in: Parallel Algorithms in Computational Science and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-43736-7_2
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Parallel algorithms in computer science (68W10) Diagonalization, Jordan forms (15A20)
Cites Work
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Title not available (Why is that?)
- On the Implementation of a Primal-Dual Interior Point Method
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A new polynomial-time algorithm for linear programming
- Nested Dissection of a Regular Finite Element Mesh
- An Approximate Minimum Degree Ordering Algorithm
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Graph Classes: A Survey
- Finding good approximate vertex and edge partitions is NP-hard
- New variants of bundle methods
- Recent directions in netlist partitioning: a survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- Decomposition Principle for Linear Programs
- Modification of the minimum-degree algorithm by multiple elimination
- Title not available (Why is that?)
- Partitioning mathematical programs for parallel solution
- Improving the Run Time and Quality of Nested Dissection Ordering
- Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- Parallel image restoration using surrogate constraint methods
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- A tearing-based hybrid parallel banded linear system solver
- An explicit formulation of the multiplicative Schwarz preconditioner
- Partitioning hypergraphs in scientific computing applications through vertex separators on graphs
- A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap
- A tearing-based hybrid parallel sparse linear system solver
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- Hybrid Parallel Linear System Solvers
- Title not available (Why is that?)
- A parallel balance scheme for banded linear systems
- Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices
- Parallel minimum norm solution of sparse block diagonal column overlapped underdetermined systems
Uses Software
This page was built for publication: The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300489)
