Related papers: A General Method for Generating Discrete Orthogona…
The aim of this paper is to study differential properties of orthogonal polynomials with respect to a discrete Laguerre-Sobolev bilinear form with mass point at zero. In particular we construct the orthogonal polynomials using certain…
The discrete cosine transform (DCT), introduced by Ahmed, Natarajan and Rao, has been used in many applications of digital signal processing, data compression and information hiding. There are four types of the discrete cosine transform. In…
Often, polynomials or rational functions, orthogonal for a particular inner product are desired. In practical numerical algorithms these polynomials are not constructed, but instead the associated recurrence relations are computed.…
When the boundary of a familiar object is shown by a series of isolated dots, humans can often recognize the object with ease. This ability can be sustained with addition of distracting dots around the object. However, such capability has…
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient…
Starting from the moment sequences of classical orthogonal polynomials we derive the orthogonality purely algebraically. We consider also the moments of ($q=1$) classical orthogonal polynomials, and study those cases in which the…
Multivariate orthogonal polynomials can be introduced by using a moment functional defined on the linear space of polynomials in several variables with real coefficients. We study the so-called Uvarov and Christoffel modifications obtained…
The most common method for calculating accurate numerical solutions for complicated linear differential equations - for example, finding eigenvalues and eigenfunctions of the Schrodinger equation for many-electron atoms - is the variational…
In this study, the orthogonalization process for different inner products is applied to pairwise comparisons. Properties of consistent approximations of a given inconsistent pairwise comparisons matrix are examined. A method of a derivation…
In this paper we propose a generic algorithm to calculate the rotation parameters of CORDIC angles required for the Discrete Cosine Transform algorithm (DCT). This leads us to increase the precision of calculation meeting any accuracy.Our…
It is well known that matrices with low Hessenberg-structured displacement rank enjoy fast algorithms for certain matrix factorizations. We show how $n\times n$ principal finite sections of the Gram matrix for the orthogonal polynomial…
This article introduces an algorithm to draw random discrete uniform variables within a given range of size n from a source of random bits. The algorithm aims to be simple to implement and optimal both with regards to the amount of random…
A rigorous and powerful theoretical framework is proposed to obtain systems of orthogonal functions (or shape modes) to represent optical surfaces. The method is general so it can be applied to different initial shapes and different…
In an exploration paper, {\it L. Chen, Algorithms for Deforming and Contracting Simply Connected Discrete Closed Manifolds (I)}, we designed algorithms for deforming and contracting a simply connected discrete closed manifold to a discrete…
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 give a complete classification of all simple current modular invariants, extending previous results for $(\Zbf_p)^k$ to arbitrary centers. We obtain a simple explicit formula for the most general case. Using orbifold techniques to this…
Closed-form generating functions for counting one-face rooted hypermaps with a known number of darts by number of vertices and edges is found, using matrix integral expressions relating to the reduced density operator of a bipartite quantum…
We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed…
In the present work, an attempted was made to develop a numerical algorithm by the use of new orthogonal hybrid functions formed from hybrid of piecewise constant orthogonal sample-and-hold functions and piecewise linear orthogonal…
In this paper, we discuss two simple parametrization methods for calculating Adomian polynomials for several nonlinear operators, which utilize the orthogonality of functions einx, where n is an integer. Some important properties of Adomian…