Related papers: Computing Spectral Elimination Ideals
We show that unitary representations of simply connected, semisimple algebraic groups over local fields of characteristic zero obey a spectral gap absorption principle: that is, that spectral gap is preserved under tensor products. We do…
Spectral methods have emerged as a simple yet surprisingly effective approach for extracting information from massive, noisy and incomplete data. In a nutshell, spectral methods refer to a collection of algorithms built upon the eigenvalues…
In this paper we factorize matrix polynomials into a complete set of spectral factors using a new design algorithm and we provide a complete set of block roots (solvents). The procedure is an extension of the (scalar) Horner method for the…
This chapter of the forthcoming Handbook of Graphical Models contains an overview of basic theorems and techniques from algebraic geometry and how they can be applied to the study of conditional independence and graphical models. It also…
The problem of computation of the joint (generalized) spectral radius of matrix sets has been discussed in a number of publications. In the paper an iteration procedure is considered that allows to build numerically Barabanov norms for the…
In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F{y} to have finite difference Groebner bases and an algorithm to compute the finite difference Groebner…
The correspondence between commutative rings of ordinary differential operators (ODOs) and algebraic curves was established by Burchnall and Chaundy, Krichever and Mumford, among many others. To make this correspondence computationally…
Spectral tetris is a fexible and elementary method to construct unit norm frames with a given frame operator, having all of its eigenvalues greater than or equal to two. One important application of spectral tetris is the construction of…
We demonstrate a method to parallelize the computation of a Gr\"obner basis for a homogenous ideal in a multigraded polynomial ring. Our method uses anti-chains in the lattice $\mathbb N^k$ to separate mutually independent S-polynomials for…
Hyperspectral unmixing, the process of estimating a common set of spectral bases and their corresponding composite percentages at each pixel, is an important task for hyperspectral analysis, visualization and understanding. From an…
We relate the notions of spectral gap for unitary representations and subfactors with definability of certain important sets in the corresponding structures. We give several applications of this relationship.
We give an efficient algorithm which can obtain a relative error approximation to the spectral norm of a matrix, combining the power iteration method with some techniques from matrix reconstruction which use random sampling.
In an earlier paper we solved a long-standing problem which goes back to Laurent Schwartz's work on mean-periodic functions. Namely, we completely characterised those locally compact Abelian groups having spectral synthesis. The method is…
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…
Our main result is an elementary derivation of the spectral decomposition of hypermatrices generated by arbitrary combinations of Kronecker products and direct sums of cubic side length 2
We present a spectral analysis for matrix scaling and operator scaling. We prove that if the input matrix or operator has a spectral gap, then a natural gradient flow has linear convergence. This implies that a simple gradient descent…
The slice decomposition is a bijective method for enumerating planar maps (graphs embedded in the sphere) with control over face degrees. In this paper, we extend the slice decomposition to the richer setting of hypermaps, naturally…
Motivated by applications to the theory of error-correcting codes, we give methods for computing a generating set for the ideal generated by $\beta$-graded polynomials vanishing on certain subsets of a simplicial complete toric variety $X$…
This paper presents a Bayesian algorithm for linear spectral unmixing of hyperspectral images that accounts for anomalies present in the data. The model proposed assumes that the pixel reflectances are linear mixtures of unknown endmembers,…
Angle-resolved photoemission spectra are calculated microscopically for the two-dimensional attractive Hubbard model. A system of self-consistent T-matrix equations are solved numerically in the real-time domain. The single-particle…