Related papers: Trilogy on Computing Maximal Eigenpair
Let $A \in (\mathbb{C}^{n})^{\otimes p}$ be a complex tensor of order $p$. The pair $(v,\eta)\in\mathbb{C}^n\times \mathbb{C}$ is called an h-eigenpair of $A$, if $v\neq0$ and it satisfies $Av^{p-1}=\eta^{p-2} v$, where $Av^{p-1}$ is the…
A generalized eigenvalue algorithm for tridiagonal matrix pencils is presented. The algorithm appears as the time evolution equation of a nonautonomous discrete integrable system associated with a polynomial sequence which has some…
We describe the analytic calculation of the master integrals required to compute the two-mass three-loop corrections to the $\rho$ parameter. In particular, we present the calculation of the master integrals for which the corresponding…
We describe an algorithm for computing Macaulay dual spaces for multi-graded ideals. For homogeneous ideals, the natural grading is inherited by the Macaulay dual space which has been leveraged to develop algorithms to compute the Macaulay…
Primal and dual algorithms are developed for solving the $n$-dimensional convex optimization problem of finding the Euclidean ball of minimum radius that covers $m$ given Euclidean balls, each with a given center and radius. Each algorithm…
We show that the max entropy algorithm is a randomized 1.49776 approximation for half-integral TSP, improving upon the previous known bound of 1.49993 from Karlin et al. This also improves upon the best-known approximation for half-integral…
Quiver representations arise naturally in many areas across mathematics. Here we describe an algorithm for calculating the vector space of sections, or compatible assignments of vectors to vertices, of any finite-dimensional representation…
Efficient methods for computing with matrices over finite fields often involve randomised algorithms, where matrices with a certain property are sought via repeated random selection. Complexity analyses for these algorithms require…
We introduce new and simple algorithms for the calculation of the number of perfect matchings of complex weighted, undirected graphs with and without loops. Our compact formulas for the hafnian and loop hafnian of $n \times n $ complex…
Emulators that can bypass computationally expensive scientific calculations with high accuracy and speed can enable new studies of fundamental science as well as more potential applications. In this work we discuss solving a system of…
Computing the determinant of a matrix with the univariate and multivariate polynomial entries arises frequently in the scientific computing and engineering fields. In this paper, an effective algorithm is presented for computing the…
The algebra of invariants of several 3 x 3 matrices under the action of the orthogonal group by simultaneous conjugation is considered over a field of characteristic different from two. The maximal degree of elements of minimal system of…
We develop an algorithm for sampling from the unitary invariant random matrix ensembles. The algorithm is based on the representation of their eigenvalues as a determinantal point process whose kernel is given in terms of orthogonal…
In various areas of applied numerics, the problem of calculating the logarithm of a matrix A emerges. Since series expansions of the logarithm usually do not converge well for matrices far away from the identity, the standard numerical…
Matrix multiplication is a fundamental computation in many scientific disciplines. In this paper, we show that novel fast matrix multiplication algorithms can significantly outperform vendor implementations of the classical algorithm and…
We introduce two families of random tridiagonal block matrices for which the joint eigenvalue distributions can be computed explicitly. These distributions are novel within random matrix theory, and exhibit interactions among eigenvalue…
In recent years, a number of fast algorithms for computing the determinant of a Toeplitz matrix were developed. The fastest algorithm we know so far is of order $k^2\log{n}+k^3$, where $n$ is the number of rows of the Toeplitz matrix and…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
We examine three methods for ranking by pairwise comparison: Principal Eigenvector, HodgeRank and Tropical Eigenvector. It is shown that the choice of method can produce arbitrarily different rank order.To be precise, for any two of the…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…