paper

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.

arXiv comment6 pages, 1 figure, V2: Minor changes in the text and refs. added, to appear in CPC

References in corpus (10)

Cited by in corpus (5)