Buscar
Mostrando ítems 1-10 de 22
Zeros of classical orthogonal polynomials of a discrete variable
(Amer Mathematical Soc, 2013-04-01)
In this paper we obtain sharp bounds for the zeros of classical orthogonal polynomials of a discrete variable, considered as functions of a parameter, by using a theorem of A. Markov and the so-called Hellmann-Feynman ...
Zeros of classical orthogonal polynomials of a discrete variable
(Amer Mathematical Soc, 2014)
ZEROS OF CLASSICAL ORTHOGONAL POLYNOMIALS OF A DISCRETE VARIABLE
(Amer Mathematical SocProvidenceEUA, 2013)
Zeros of classical orthogonal polynomials of a discrete variable
(Amer Mathematical Soc, 2014)
APPROXIMATE CALCULATION OF SUMS I: BOUNDS FOR THE ZEROS OF GRAM POLYNOMIALS
(Siam Publications, 2014-01-01)
Let N be a positive integer and x(j) be N equidistant points. We propose an algorithmic approach for approximate calculation of sums of the form Sigma(N)(j=1) F(x(j)). The method is based on the Gaussian type quadrature ...
APPROXIMATE CALCULATION OF SUMS I: BOUNDS FOR THE ZEROS OF GRAM POLYNOMIALS
(Siam Publications, 2015)
APPROXIMATE CALCULATION OF SUMS I: BOUNDS FOR THE ZEROS OF GRAM POLYNOMIALS
(Siam Publications, 2015)
AN EFFICIENT ALGORITHM FOR THE CLASSICAL LEAST SQUARES APPROXIMATION
(Siam Publications, 2020-01-01)
We explore the computational issues concerning a new algorithm for the classical least-squares approximation of N samples by an algebraic polynomial of degree at most n when the number N of the samples is very large. The ...
APPROXIMATE CALCULATION OF SUMS II: GAUSSIAN TYPE QUADRATURE
(Siam Publications, 2016-01-01)
The present paper is a continuation of a recent article [SIAM T. Numer. Anal., 52 (2014), pp. 1867-1886], where we proposed an algorithmic approach for approximate calculation of sums of the form Sigma(N)(j=1) f (j). The ...