Treffer: Newton sum rules of polynomials defined by a three-term recurrence relation
Title:
Newton sum rules of polynomials defined by a three-term recurrence relation
Authors:
Source:
Computers & Mathematics with Applications. 42:767-771
Publisher Information:
Elsevier BV, 2001.
Publication Year:
2001
Subject Terms:
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.), Computational Mathematics, Generalized Lucas polynomials, Computational Theory and Mathematics, Orthogonal polynomials, Jacobi matrix, Modelling and Simulation, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Numerical approximation and evaluation of special functions, 0101 mathematics, 01 natural sciences, Newton sum rules
Document Type:
Fachzeitschrift
Article
File Description:
application/xml
Language:
English
ISSN:
0898-1221
DOI:
10.1016/s0898-1221(01)00196-1
Access URL:
Rights:
Elsevier Non-Commercial
Accession Number:
edsair.doi.dedup.....007e6a032ea407fccae5d25f3414dabf
Database:
OpenAIRE
Weitere Informationen
The authors derive a general formula for computing the Newton sum rules of every polynomial belonging to a given polynomial set. Their techniques and tools involve a recursive computation of the coefficients of the given polynomial in terms of the coefficients of the three-term recurrence relation, the generalized Lucas polynomials of the the first kind, and the Newton-Girard formulas. Some numerical results are also presented in this paper.