A factorization algorithm to compute Pfaffians

We describe an explicit algorithm to factorize an even antisymmetric N 2 matrix into triangular and trivial factors. The construction resembles the Crout algorithm for LU factorization. It allows for a straight forward computation of Pfaffians (including their signs) at the cost of N 3 / 3 flops. ►...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer physics communications Jg. 182; H. 12; S. 2530 - 2532
Hauptverfasser: Rubow, Jürgen, Wolff, Ulli
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.12.2011
Schlagworte:
Algorithms
Computation
Construction costs
Factorization
Majorana fermions
Pfaffian
Majorana fermions
Pfaffian
ISSN:0010-4655, 1879-2944
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We describe an explicit algorithm to factorize an even antisymmetric N 2 matrix into triangular and trivial factors. The construction resembles the Crout algorithm for LU factorization. It allows for a straight forward computation of Pfaffians (including their signs) at the cost of N 3 / 3 flops. ► Explicit algorithm to compute Pfaffians of even antisymmetric N × N matrices in N 3 time. ► Improved precision by pivoting. ► Test application for the Wilson lattice fermion matrix in two dimensions.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ObjectType-Article-2
ObjectType-Feature-1
ISSN:0010-4655
1879-2944
DOI:10.1016/j.cpc.2011.07.010