The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
DOI10.1007/978-3-030-43736-7_2OpenAlexW3038833321MaRDI QIDQ3300489
Cevdet Aykanat, Murat Manguoglu, Oguz Selvitopi, Seher Acer
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
Computational methods for sparse matrices (65F50) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Diagonalization, Jordan forms (15A20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- A new polynomial-time algorithm for linear programming
- Parallel image restoration using surrogate constraint methods
- A tearing-based hybrid parallel sparse linear system solver
- A tearing-based hybrid parallel banded linear system solver
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Finding good approximate vertex and edge partitions is NP-hard
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- Partitioning mathematical programs for parallel solution
- New variants of bundle methods
- An explicit formulation of the multiplicative Schwarz preconditioner
- Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs
- Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices
- Recent directions in netlist partitioning: a survey
- Parallel Minimum Norm Solution of Sparse Block Diagonal Column Overlapped Underdetermined Systems
- Decomposition Principle for Linear Programs
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Modification of the minimum-degree algorithm by multiple elimination
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On the Implementation of a Primal-Dual Interior Point Method
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- Improving the Run Time and Quality of Nested Dissection Ordering
- Graph Classes: A Survey
- Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- An Approximate Minimum Degree Ordering Algorithm
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- A parallel balance scheme for banded linear systems
- A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap
- Hybrid Parallel Linear System Solvers
- Nested Dissection of a Regular Finite Element Mesh
This page was built for publication: The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
