Related papers: An algorithm for the computation of the decomposit…
Holonomy R-matrices parametrized by finite-dimensional representations are constructed for quantized universal enveloping algebras of simple Lie algebras at roots of 1.
A uniqueness theorem for an LU decomposition of a totally nonnegative matrix is obtained.
In this note, we study a factorization result for graded decomposition maps associated with the specializations of graded algebras. We obtain results previously known only in the ungraded setting.
We will generalize the combinatorial algorithms for computing $\pi(x)$ to compute sums ${F(x) = \sum_{p \leq x} p^k}$ for $k \in \mathbb{Z}_{\geq 0}$. The detailed exposition of algorithms is included along with implementation details.
We prove a Kato square root estimate with anisotropically degenerate matrix coefficients. We do so by doing the harmonic analysis using an auxiliary Riemannian metric adapted to the operator. We also derive $L^2$-solvability estimates for…
The problem of decomposing a given covariance matrix as the sum of a positive semi-definite matrix of given rank and a positive semi-definite diagonal matrix, is considered. We present a projection-type algorithm to address this problem.…
The aim of the paper is to build a universal R-matrix for the multiparameter deformation of any reductive Lie algebra. Such deformations, formulated in the recent past by Truini and Varadarajan, have the property of universality in a…
We generalize the Wiener-Hopf factorization of Laurent series to more general commutative coefficient rings, and we give explicit formulas for the decomposition. We emphasize the algebraic nature of this factorization.
We give a necessary and sufficient condition on parameters for Ariki-Koike algebras (resp. cyclotomic q-Schur algebras) to be of finite representation type.
A large family of "standard" coboundary Hopf algebras is investigated. The existence of a universal R-matrix is demonstrated for the case when the parameters are in general position. Special values of the parameters are characterized by the…
Jacobi-type iterative algorithms for the eigenvalue decomposition, singular value decomposition, and Takagi factorization of complex matrices are presented. They are implemented as compact Fortran 77 subroutines in a freely available…
In this paper, we present FPT-algorithms for special cases of the shortest lattice vector, integer linear programming, and simplex width computation problems, when matrices included in the problems' formulations are near square. The…
Recent work in the field of signal processing has shown that the singular value decomposition of a matrix with entries in certain real algebras can be a powerful tool. In this article we show how to generalise the QR decomposition and SVD…
For any unitary matrix there exists a ZXZ decomposition, according to a theorem by Idel and Wolf. For any even-dimensional unitary matrix there exists a block-ZXZ decomposition, according to a theorem by F\"uhr and Rzeszotnik. We conjecture…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
In this paper we introduce the algorithm and the fixed point hardware to calculate the normalized singular value decomposition of a non-symmetric matrices using Givens fast (approximate) rotations. This algorithm only uses the basic…
We use filtrations of the Grassmannian model to produce explicit algebraic formulae for all harmonic maps of finite uniton number from a Riemann surface, and so all harmonic maps from the 2-sphere, to the unitary group for a general class…
Randomized algorithms provide solutions to two ubiquitous problems: (1) the distributed calculation of a principal component analysis or singular value decomposition of a highly rectangular matrix, and (2) the distributed calculation of a…
In addition to the diagonalization of a normal matrix by a unitary similarity transformation, there are two other types of diagonalization procedures that sometimes arise in quantum theory applications -- the singular value decomposition…
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…