Related papers: The Faddeev-LeVerrier algorithm and the Pfaffian
Consider a semi-infinite skew-symmetric moment matrix, $m_{\iy}$ evolving according to the vector fields $\pl m / \pl t_k=\Lb^k m+m \Lb^{\top k} ,$ where $\Lb$ is the shift matrix. Then the skew-Borel decomposition $ m_{\iy}:= Q^{-1} J…
We derive a numerical algorithm for evaluating the Riemannian logarithm on the Stiefel manifold with respect to the canonical metric. In contrast to the existing optimization-based approach, we work from a purely matrix-algebraic…
We present an algorithm that computes Friedl and L\"uck's twisted $L^2$-Euler characteristic for a suitable regular CW complex, employing Oki's matrix expansion algorithm to indirectly evaluate the Dieudonn\'e determinant. The algorithm…
We will propose a new algorithm for finding critical points of cost functions defined on a differential manifold. We will lift the initial cost function to a manifold that can be embedded in a Riemannian manifold (Euclidean space) and will…
We compute all massive partition functions or characteristic polynomials and their complex eigenvalue correlation functions for non-Hermitean extensions of the symplectic and chiral symplectic ensemble of random matrices. Our results are…
We consider the computation of two normal forms for matrices over the univariate polynomials: the Popov form and the Hermite form. For matrices which are square and nonsingular, deterministic algorithms with satisfactory cost bounds are…
Many applications, including rank aggregation and crowd-labeling, can be modeled in terms of a bivariate isotonic matrix with unknown permutations acting on its rows and columns. We consider the problem of estimating such a matrix based on…
We find a local $(d+1) \times (d+1)$ Riemann-Hilbert problem characterizing the skew-orthogonal polynomials associated to the partition function of the Gaussian Orthogonal Ensemble of random matrices with a potential function of degree $d$.…
The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…
In the last decade matrix polynomials have been investigated with the primary focus on adequate linearizations and good scaling techniques for computing their eigenvalues and eigenvectors. In this article we propose a new method for…
The affine Grassmannian is a noncompact smooth manifold that parameterizes all affine subspaces of a fixed dimension. It is a natural generalization of Euclidean space, points being zero-dimensional affine subspaces. We will realize the…
We discuss a progress in calculation of Feynman integrals which has been done with help of the Gegenbauer Polynomial Technique and demonstrate the results for most complicated parts of O(1/N^3) contributions to critical exponents of \phi^4…
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.
A matrix factorization problem is considered. The matrix to be factorized is algebraic, has dimension 2 X 2 and belongs to Moiseev's class. A new method of factorization is proposed. First, the matrix factorization problem is reduced to a…
We exhibit a randomized algorithm which given a matrix $A\in \mathbb{C}^{n\times n}$ with $\|A\|\le 1$ and $\delta>0$, computes with high probability an invertible $V$ and diagonal $D$ such that $\|A-VDV^{-1}\|\le \delta$ using…
A combinatorial construction proves an identity for the product of the Pfaffian of a skew-symmetric matrix by the Pfaffian of one of its submatrices. Several applications of this identity are followed by a brief history of Pfaffians.
In this paper, the author present a reliable symbolic computational algorithm for inverting a general comrade matrix by using parallel computing along with recursion. The computational cost of our algorithm is O(n^2). The algorithm is…
We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…
We present a new algorithm for solving an eigenvalue problem for a real symmetric arrowhead matrix. The algorithm computes all eigenvalues and all components of the corresponding eigenvectors with high relative accuracy in $O(n^{2})$…
For a Hermitian matrix $H \in \mathbb C^{n,n}$ and symmetric matrices $S_0, S_1,\ldots,S_k \in \mathbb C^{n,n}$, we consider the problem of computing the supremum of $\left\{ \frac{v^*Hv}{v^*v}:~v\in \mathbb C^{n}\setminus…