Computation of the entropy of polynomials orthogonal on an interval.
We give an effective method to compute the entropy for polynomials orthogonal on a segment of the real axis that uses as input data only the coefficients of the recurrence relation satisfied by these polynomials. This algorithm is based on a series expression for the mutual energy of two probability...
Main Authors: | Buyarov, V., Dehesa, J. S., Martínez-Finkelshtein, Andrei, Sánchez-Lara, J. F. |
---|---|
Format: | info:eu-repo/semantics/article |
Language: | English |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/10835/1639 |
Similar Items
-
Orthogonality of Jacobi polynomials with general parameters.
by: Kuijlaars, A. B. J., et al.
Published: (2012) -
Discrete entropies of orthogonal polynomials
by: Aptekarev, A. I., et al.
Published: (2012) -
Asymptotic upper bounds for the entropy of orthogonal polynomials in the Szegő class.
by: Beckermann, B., et al.
Published: (2012) -
Properties of Matrix Orthogonal Polynomials via their Riemann-Hilbert Characterization
by: Grünbaum, F. Alberto, et al.
Published: (2012) -
Asymptotics of orthogonal polynomials with respect to an analytic weight with algebraic singularities on the circle
by: Martínez-Finkelshtein, Andrei, et al.
Published: (2012)