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...
मुख्य लेखकों: | Buyarov, V., Dehesa, J. S., Martínez-Finkelshtein, Andrei, Sánchez-Lara, J. F. |
---|---|
स्वरूप: | info:eu-repo/semantics/article |
भाषा: | English |
प्रकाशित: |
2012
|
विषय: | |
ऑनलाइन पहुंच: | http://hdl.handle.net/10835/1639 |
समान संसाधन
-
Orthogonality of Jacobi polynomials with general parameters.
द्वारा: Kuijlaars, A. B. J., और अन्य
प्रकाशित: (2012) -
Discrete entropies of orthogonal polynomials
द्वारा: Aptekarev, A. I., और अन्य
प्रकाशित: (2012) -
Asymptotic upper bounds for the entropy of orthogonal polynomials in the Szegő class.
द्वारा: Beckermann, B., और अन्य
प्रकाशित: (2012) -
Properties of Matrix Orthogonal Polynomials via their Riemann-Hilbert Characterization
द्वारा: Grünbaum, F. Alberto, और अन्य
प्रकाशित: (2012) -
Asymptotics of orthogonal polynomials with respect to an analytic weight with algebraic singularities on the circle
द्वारा: Martínez-Finkelshtein, Andrei, और अन्य
प्रकाशित: (2012)