A factorization algorithm to compute Pfaffians
arXiv:1102.3576 · doi:10.1016/j.cpc.2011.07.010
Abstract
We describe an explicit algorithm to factorize an even antisymmetric N^2 matrix into triangular and trivial factors. This allows for a straight forward computation of Pfaffians (including their signs) at the cost of N^3/3 flops.
6 pages, 1 figure, V2: Minor changes in the text and refs. added, to appear in CPC
References in corpus (7)
- Efficient numerical computation of the Pfaffian for dense and banded skew-symmetric matrices
- Cluster simulation of relativistic fermions in two space-time dimensions
- First results from simulations of supersymmetric lattices
- Numeric and symbolic evaluation of the pfaffian of general skew-symmetric matrices
- Simulating the All-Order Hopping Expansion II: Wilson Fermions
- Exact Algorithm for Sampling the 2D Ising Spin Glass
- Anomalous discrete chiral symmetry in the Gross-Neveu model and loop gas simulations
Cited by in corpus (5)
- Efficient numerical computation of the Pfaffian for dense and banded skew-symmetric matrices
- Complexity of quantum impurity problems
- Parallel software for lattice N=4 supersymmetric Yang--Mills theory
- Pfaffian formula for fermion parity fluctuations in a superconductor and application to Majorana fusion detection
- Discrete integrable systems and condensation algorithms for Pfaffians