A simple division-free algorithm for computing Pfaffians

DOI10.1016/J.IPL.2024.106550MaRDI QIDQ7013208zbMATH OpenFDO

Authors Adam J. Przeździecki

Publication date 13 March 2025

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IPL.2024.106550

zbMATH Keywords

characteristic polynomialdivision-free algorithmsPfaffian

Mathematics Subject Classification ID

Group actions on combinatorial structures (05E18) Determinants, permanents, traces, other special matrix functions (15A15) Numerical computation of determinants (65F40) Complexity and performance of numerical algorithms (65Y20)

Cites work

• A Pfaffian formula for matching polynomials of outerplanar graphs
• A simple division-free algorithm for computing determinants
• An improved parallel processor bound in fast matrix inversion
• scientific article; zbMATH DE number 3112812 (Why is no real title available?)
• scientific article; zbMATH DE number 1201676 (Why is no real title available?)
• scientific article; zbMATH DE number 1775055 (Why is no real title available?)
• Nonintersecting paths, pfaffians, and plane partitions
• Schubert varieties and degeneracy loci
• The Faddeev-LeVerrier algorithm and the Pfaffian

This page was built for publication: A simple division-free algorithm for computing Pfaffians

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