The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
From MaRDI portal
Publication:3300489
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
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 1113880 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A new polynomial-time algorithm for linear programming
- A parallel balance scheme for banded linear systems
- A recursive bipartitioning algorithm for permuting sparse square matrices into block diagonal form with overlap
- A tearing-based hybrid parallel banded linear system solver
- A tearing-based hybrid parallel sparse linear system solver
- An Approximate Minimum Degree Ordering Algorithm
- An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
- An explicit formulation of the multiplicative Schwarz preconditioner
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- Covering edges by cliques with regard to keyword conflicts and intersection graphs
- Decomposition Principle for Linear Programs
- Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies
- Finding good approximate vertex and edge partitions is NP-hard
- Graph Classes: A Survey
- Hybrid Parallel Linear System Solvers
- Hypergraph Partitioning-Based Fill-Reducing Ordering for Symmetric Matrices
- Improving the Run Time and Quality of Nested Dissection Ordering
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Modification of the minimum-degree algorithm by multiple elimination
- Nested Dissection of a Regular Finite Element Mesh
- New variants of bundle methods
- On the Implementation of a Primal-Dual Interior Point Method
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- Parallel image restoration using surrogate constraint methods
- Parallel minimum norm solution of sparse block diagonal column overlapped underdetermined systems
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Partitioning hypergraphs in scientific computing applications through vertex separators on graphs
- Partitioning mathematical programs for parallel solution
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Recent directions in netlist partitioning: a survey
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)
