A load balancing strategy for parallel computation of sparse permanents

DOI10.1002/nla.1844zbMath1289.65119arXiv1112.6072OpenAlexW2962941190MaRDI QIDQ2864488

No author found.

Publication date: 6 December 2013

Published in: Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.6072

zbMATH Keywords

parallel computationapproximation algorithmsparse matrixpermanentload balancinghybrid algorithmaccelerated ratio

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Determinants, permanents, traces, other special matrix functions (15A15) Parallel numerical computation (65Y05) Numerical computation of determinants (65F40)

Uses Software

• SparseMatrix

Cites Work

• Unnamed Item
• Unnamed Item
• Calculation of the permanent of a sparse positive matrix
• A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes
• An efficient algorithm for computing permanental polynomials of graphs
• Approximating the permanent of graphs with large factors
• An analysis of Monte Carlo algorithm for estimating the permanent
• The permanent of 0-1 matrices and Kallman's algorithm
• A hybrid algorithm for computing permanents of sparse matrices
• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• Approximating the Permanent
• A Method for Finding Permanents of 0, 1 Matrices
• Bounds for Certain Multiprocessing Anomalies
• Bounds on Multiprocessing Timing Anomalies
• Clifford algebras and approximating the permanent

This page was built for publication: A load balancing strategy for parallel computation of sparse permanents