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. ►...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computer physics communications Ročník 182; číslo 12; s. 2530 - 2532
Hlavní autoři: Rubow, Jürgen, Wolff, Ulli
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.12.2011
Témata:
Algorithms
Computation
Construction costs
Factorization
Majorana fermions
Pfaffian
Majorana fermions
Pfaffian
ISSN:0010-4655, 1879-2944
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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