Related papers: On Parametrization of Compact Wavelet Matrices
In the first part of these notes, we review some of the recent developments in the study of the spectral properties of Wigner matrices. In the second part, we present a new proof of a Wegner estimate for the eigenvalues of a large class of…
In this paper, we enhance a recent algorithm for approximate spectral factorization of matrix functions, extending its capabilities to precisely factorize rational matrices when an exact lower-upper triangular factorization is available.…
An analytic proof is proposed of Wiener's theorem on factorization of positive definite matrix-functions.
Matrix factorization is a popular approach for large-scale matrix completion. The optimization formulation based on matrix factorization can be solved very efficiently by standard algorithms in practice. However, due to the non-convexity…
In this article, we present a constructive method for computing the frame coefficients of finite wavelet frames over prime fields using tools from computational harmonic analysis and group theory.
We develop a method to construct algebraic invariants for hypermatrices. We then construct hyperdeterminants and exhibit a generalization of the Cayley-Hamilton theorem for hypermatrices.
We develop an efficient algorithm for sampling the eigenvalues of random matrices distributed according to the Haar measure over the orthogonal or unitary group. Our technique samples directly a factorization of the Hessenberg form of such…
In the present work, new classes of wavelet functions are presented in the framework of Clifford analysis. Firstly, some classes of new monogenic polynomials are provided based on 2-parameters weight functions. Such classes extend the well…
We introduce a conceptually simple and efficient algorithm for seamless parametrization, a key element in constructing quad layouts and texture charts on surfaces. More specifically, we consider the construction of parametrizations with…
We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…
A novel method to obtain parametrizations of complex inverse orthogonal matrices is provided. These matrices are natural generalizations of complex Hadamard matrices which depend on non zero complex parameters. The method we use is via…
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 show that any joint probability mass function (PMF) can be expressed as a product of parity check factors and factors of degree one with the help of some auxiliary variables, if the alphabet size is appropriate for defining a parity…
In this paper we present the applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems. In the general case we have the solution as a multiresolution expansion in the base of…
Given an arbitrary monic polynomial $f$ over a field $F$ of characteristic 0, we use companion matrices to construct a polynomial $M_f\in F[X]$ of minimum degree such that for each root $\alpha$ of $f$ in the algebraic closure of $F$,…
We show that real polarization method can be effectively used to geometrically quantize physical systems with compact phase space, like the spin. Our method enables us to construct a wave function of a qubit in both position and momentum…
In this paper we develop a plane wave type method for discretization of homogeneous Helmholtz equations with variable wave numbers. In the proposed method, local basis functions (on each element) are constructed by the geometric optics…
Wavelet theory has been well studied in recent decades. Due to their appealing features such as sparse multiscale representation and fast algorithms, wavelets have enjoyed many tremendous successes in the areas of signal/image processing…
A new family of wavelets is introduced, which is associated with Legendre polynomials. These wavelets, termed spherical harmonic or Legendre wavelets, possess compact support. The method for the wavelet construction is derived from the…
Graphlets are small connected induced subgraphs of a larger graph $G$. Graphlets are now commonly used to quantify local and global topology of networks in the field. Methods exist to exhaustively enumerate all graphlets (and their orbits)…