Algorithm 923: Efficient numerical computation of the Pfaffian for dense and banded skew-symmetric matrices

From MaRDI portal
Publication:2989173

DOI10.1145/2331130.2331138zbMATH Open1365.65116arXiv1102.3440OpenAlexW3102903233WikidataQ56335971 ScholiaQ56335971MaRDI QIDQ2989173FDOQ2989173


Authors:


Publication date: 19 May 2017

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Abstract: Computing the Pfaffian of a skew-symmetric matrix is a problem that arises in various fields of physics. Both computing the Pfaffian and a related problem, computing the canonical form of a skew-symmetric matrix under unitary congruence, can be solved easily once the skew-symmetric matrix has been reduced to skew-symmetric tridiagonal form. We develop efficient numerical methods for computing this tridiagonal form based on Gauss transformations, using a skew-symmetric, blocked form of the Parlett-Reid algorithm, or based on unitary transformations, using block Householder transformations and Givens rotations, that are applicable to dense and banded matrices, respectively. We also give a complete and fully optimized implementation of these algorithms in Fortran, and also provide Python, Matlab and Mathematica implementations for convenience. Finally, we apply these methods to compute the topological charge of a class D nanowire, and show numerically the equivalence of definitions based on the Hamiltonian and the scattering matrix.


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




Recommendations





Cited In (25)

Uses Software





This page was built for publication: Algorithm 923: Efficient numerical computation of the Pfaffian for dense and banded skew-symmetric matrices

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