Log In Sign Up

A faster hafnian formula for complex matrices and its benchmarking on the Titan supercomputer

by   Andreas Björklund, et al.

We introduce new and simple algorithms for the calculation of the number of perfect matchings of complex weighted, undirected graphs with and without loops. Our compact formulas for the hafnian and loop hafnian of n × n complex matrices run in O(n^3 2^n/2) time, are embarrassingly parallelizable and, to the best of our knowledge, are the fastest exact algorithms to compute these quantities. Despite our highly optimized algorithm, numerical benchmarks on the Titan supercomputer with matrices up to size 56 × 56 indicate that one would require the 288,000 CPUs of this machine for about a month and a half to compute the hafnian of a 100 × 100 matrix.


page 1

page 2

page 3

page 4


Run-Time Efficient RNN Compression for Inference on Edge Devices

Recurrent neural networks can be large and compute-intensive, yet many a...

A non-commutative algorithm for multiplying (7 × 7) matrices using 250 multiplications

We present a non-commutative algorithm for multiplying (7x7) matrices us...

RedisGraph GraphBLAS Enabled Graph Database

RedisGraph is a Redis module developed by Redis Labs to add graph databa...

Mixed Moments for the Product of Ginibre Matrices

We study the ensemble of a product of n complex Gaussian i.i.d. matrices...

A simple analysis of flying capacitor converter

The paper aims to emphasise how switched systems can be analysed with el...

Multiplying Matrices Without Multiplying

Multiplying matrices is among the most fundamental and compute-intensive...

A compact formula for the derivative of a 3-D rotation in exponential coordinates

We present a compact formula for the derivative of a 3-D rotation matrix...

Code Repositories


Calculation of Hafnians for real and complex matrices

view repo