A hybrid algorithm for computing permanents of sparse matrices (Q2369215)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A hybrid algorithm for computing permanents of sparse matrices |
scientific article |
Statements
A hybrid algorithm for computing permanents of sparse matrices (English)
0 references
28 April 2006
0 references
For computing permanents of sparse matrices, a hybrid algorithm is proposed. The new method is constructed by combining an improved direct expansion method with a method due to Ryser and later improved by Nijenhuis and Wilf (named R-NW in this paper). In the worst case, the computational complexity of the hybrid algorithm is the same as that of R-NW. Numerical examples show that it saves drastically by using structural information of matrices.
0 references
permanent
0 references
direct expansion
0 references
hybrid method
0 references
0 references
0 references