相关论文: Efficient numerical computation of the Pfaffian fo…

Evaluation of pfaffians arises in a number of physics applications, and for some of them a direct method is preferable to using the determinantal formula. We discuss two methods for the numerical evaluation of pfaffians. The first is…

We adapt the Faddeev-LeVerrier algorithm for the computation of characteristic polynomials to the computation of the Pfaffian of a skew-symmetric matrix. This yields a very simple, easy to implement and parallelize algorithm of…

The factorization of skew-symmetric matrices is a critically understudied area of dense linear algebra, particularly in comparison to that of general and symmetric matrices. While some algorithms can be adapted from the symmetric case, the…

This paper is dedicated to compute Pfaffian and determinant of one type of skew centrosymmetric matrices in terms of general number sequence of second order.

In this article, we present a high performance, portable and well templated implementation for computing and fast-updating Pfaffian and inverse of an even-ranked skew-symmetric (antisymmetric) matrix. It is achieved with a skew-symmetric,…

The partly symmetric real Ginibre ensemble consists of matrices formed as linear combinations of real symmetric and real anti-symmetric Gaussian random matrices. Such matrices typically have both real and complex eigenvalues. For a fixed…

We study the stochastic six-vertex model in half-space with generic integrable boundary weights, and define two families of multivariate rational symmetric functions. Using commutation relations between double-row operators, we prove a skew…

Orthogonal systems in $\mathrm{L}_2(\mathbb{R})$, once implemented in spectral methods, enjoy a number of important advantages if their differentiation matrix is skew-symmetric and highly structured. Such systems, where the differentiation…

We present an exact sampling algorithm for Pfaffian point processes based on a skew-symmetric analogue of the Cholesky factorization. This algorithm enables efficient sampling of a wide range of statistics arising in random matrix theory…

In this paper we develop algorithms for orthogonal similarity transformations of skew-symmetric matrices to simpler forms. The first algorithm is similar to the algorithm for the block antitriangular factorization of symmetric matrices, but…

We derive an expression for the product of the Pfaffians of two skew-symmetric matrices A and B as a sum of products of the traces of powers of AB and an expression for the inverse matrix A$^{-1}$, or equivalently B$^{-1}$, as a…

Correlation functions for matrix ensembles with orthogonal and unitarysymplectic rotation symmetry are more complicated to calculate than in the unitary case. The supersymmetry method and the orthogonal polynomials are two techniques to…

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.

We show that every skew-symmetric 6 x 6 matrix of linear forms with vanishing Pfaffian is congruent to one of finitely many types of matrices, each of which is characterised by a specific pattern of zeroes (and some other linear relations)…

We present a fast Jacobi-like algorithm for computing the eigenvalues, and optionally the eigenvectors, of a real normal matrix. The method gains a computational advantage by using Paardekooper's method for skew-symmetric matrices The…

We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as…

There are some distinguished ensembles of non-Hermitian random matrices for which the joint PDF can be written down explicitly, is unchanged by rotations, and furthermore which have the property that the eigenvalues form a Pfaffian point…

In this paper, we consider the problem of deriving new eigenvalue distributions of real-valued Wishart matrices that arises in many scientific and engineering applications. The distributions are derived using the tools from the theory of…

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

Spanning trees are a representative example of linear matroid bases that are efficiently countable. Perfect matchings of Pfaffian bipartite graphs are a countable example of common bases of two matrices. Generalizing these two examples,…