Related papers: The discrete cosine transform on triangles
Over the last decade, signal processing on graphs has become a very active area of research. Specifically, the number of applications, for instance in statistical or deep learning, using frames built from graphs, such as wavelets on graphs,…
We put together the ingredients for an efficient operator calculus based on Krawtchouk polynomials, including Krawtchouk transforms and corresponding convolution structure which provide an inherently discrete alternative to Fourier…
1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our…
Random fields on the sphere play a fundamental role in the natural sciences. This paper presents a simulation algorithm parenthetical to the spectral turning bands method used in Euclidean spaces, for simulating scalar- or vector-valued…
The usage of linear transformations has great relevance for data decorrelation applications, like image and video compression. In that sense, the discrete Tchebichef transform (DTT) possesses useful coding and decorrelation properties. The…
The vertical slice transform takes a function on the n-dimensional unit sphere to integrals of that function over spherical slices parallel to the last coordinate axis. This transform arises in thermoacoustic tomography. We obtain new…
Motivated by the classical studies on transformations of conjugate nets, we develop the general geometric theory of transformations of their discrete analogues: the multidimensional quadrilateral lattices, i.e. lattices x: Z^N -> R^M, whose…
Using Chebyshev polynomialsof both kinds, we construct rational fractions which are convergents of the smallest root of $x^2-\alpha x+1$ for $\alpha=3,4,5,\dots$.Some of the underlying identities suggest an identity involving…
Bleher and Kuijlaars recently showed that the eigenvalue correlations from matrix ensembles with external source can be expressed by means of a kernel built out of special multiple orthogonal polynomials. We derive a Christoffel-Darboux…
We discuss efficient algorithms for the accurate forward and reverse evaluation of the discrete Fourier-Bessel transform (dFBT) as numerical tools to assist in the 2D polar convolution of two radially symmetric functions, relevant, e.g., to…
Transformations for enhancing sparsity in the approximation of color images by 2D atomic decomposition are discussed. The sparsity is firstly considered with respect to the most significant coefficients in the wavelet decomposition of the…
We study 2D discrete integrable equations of order 1 with respect to one independent variable and $m$ with respect to another one. A generalization of the multidimensional consistency property is proposed for this type of equations. The…
In this work, we describe examples for calculating the 1-D circular convolution of signals represented by 3-qubit superpositions. The case is considered, when the discrete Fourier transform of one of the signals is known and calculated in…
This study explores the complex dynamics of the rational function associated with the Modified Chebyshev's root-finding method. After introducing the basic preliminaries of discrete dynamical systems, we analyze the dynamical behavior of…
We present an alternative application of discrete Morse theory for two-particle graph configuration spaces. In contrast to previous constructions, which are based on discrete Morse vector fields, our approach is through Morse functions,…
Copulas allow a flexible and simultaneous modeling of complicated dependence structures together with various marginal distributions. Especially if the density function can be represented as the product of the marginal density functions and…
We present a new numerical approach that is able to solve the multi-dimensional radiative transfer equations in all opacity regimes on a Lagrangian, unstructured network of characteristics based on a stochastic point process. Our method…
A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be minimized, then the novel method for the finite field of…
We use a discrete multiscale analysis to study the asymptotic integrability of differential-difference equations. In particular, we show that multiscale perturbation techniques provide an analytic tool to derive necessary integrability…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…