Related papers: A recursive parameterisation of unitary matrices
For $n>3$, every $n\times n$ partial Cayley matrix with at most $n-1$ holes can be reconstructed by quadrangle criterion. Moreover, the holes can be filled in given order. Without additional assumptions, this is the best possible result.…
We propose a recursive method that makes use of the basic principle of unitarity to calculate the Landau singularities of n-point scattering amplitudes directly in kinematic space. For a vast class of Feynman diagrams, the method enables…
We introduce a new Baxterisation for R-matrices that depend separately on two spectral parameters. The Baxterisation is based on a new algebra, close to but different from the braid group. This allows us to recover the R-matrix of the…
Recursion formulae are derived for the calculation of two centre matrix elements of a radial function in relativistic quantum mechanics. The recursions are obtained between not necessarily diagonal radial eigensates using arbitrary radial…
We obtain explicitly the renormalization group equations for the quark mass matrices in terms of a set of rephasing invariant parameters. For a range of assumed high energy values for the mass ratios and mixing parameters, they are found to…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
The paper is devoted to the methods of solving simultaneous recurrences. Specifically, we discuss transformation of matrix recurrences to regular recurrences and propose a way of solving special matrix recurrences of order three by their…
We give a new procedure in Maple for finding the k-th power of a martix. The algorithm is based on the article [1].
We present a method for randomizing formulas for bilinear computation of matrix products. We consider the implications of such randomization when there are two sources of error: One due to the formula itself only being approximately…
Factorization of compact wavelet matrices into primitive ones has been known for more than 20 years. This method makes it possible to generate wavelet matrix coefficients and also to specify them by their first row. Recently, a new…
We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the…
A binary matrix can be scanned by moving a fixed rectangular window (submatrix) across it, rather like examining it closely under a microscope. With each viewing, a convenient measurement is the number of 1s visible in the window, which…
An $n$-by-$n$ ($n\ge 3$) weighted shift matrix $A$ is one of the form $$[{array}{cccc}0 & a_1 & & & 0 & \ddots & & & \ddots & a_{n-1} a_n & & & 0{array}],$$ where the $a_j$'s, called the weights of $A$, are complex numbers. Assume that all…
A procedure to obtain differentiation matrices is extended straightforwardly to yield new differentiation matrices useful to obtain derivatives of complex rational functions. Such matrices can be used to obtain numerical solutions of some…
Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the…
The purpose of the paper is to introduce two new algorithms. The first one computes a linear recursion for proper hypergeometric multisums, by treating one summation variable at a time, and provides rational certificates along the way. A…
It is well known that a family of $n\times n$ commuting matrices can be simultaneously triangularized by a unitary similarity transformation. The diagonal entries of the triangular matrices define the $n$ joint eigenvalues of the family. In…
Universally decodable matrices can be used for coding purposes when transmitting over slow fading channels. These matrices are parameterized by positive integers $L$ and $n$ and a prime power $q$. Based on Pascal's triangle we give an…
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…
Based on the column pivoted QR decomposition, we propose some randomized algorithms including pass-efficient ones for the generalized CUR decompositions of matrix pair and matrix triplet. Detailed error analyses of these algorithms are…