A factorization algorithm to compute Pfaffians

From MaRDI portal
Revision as of 15:53, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1943063

DOI10.1016/J.CPC.2011.07.010zbMATH Open1261.65031arXiv1102.3576OpenAlexW2083521163MaRDI QIDQ1943063FDOQ1943063

Jürgen Rubow, U. Wolff

Publication date: 15 March 2013

Published in: Computer Physics Communications (Search for Journal in Brave)

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.


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





Cites Work


Cited In (9)

Uses Software






This page was built for publication: A factorization algorithm to compute Pfaffians

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1943063)