Orthogonal Polynomials: Computation
Reference work entry
First Online:
DOI: https://doi.org/10.1007/978-3-540-70529-1_386
Orthogonality and Polynomials
Orthogonality is defined in the linear space of polynomials with complex coefficients with respect to an inner product < , > which involves a measure of integration supported on some subset E of the complex plane. If this subset is finite, then the discrete orthogonality appears. Sequences of orthogonal polynomials (OP) are built when you apply the standard Gram-Schmidt process to the canonical basis \((z^{n})_{n\geq 0}\)
This is a preview of subscription content, log in to check access.
References
- 1.Garza, L., Marcellán, F.: Quadrature rules on the unit circle: a survey. In: Arvesú, J., Marcellán, F., Martínez Finkelshtein, A. (eds.) Recent Trends in Orthogonal Polynomials and Approximation Theory. Contemporary Mathematics, vol. 507, pp. 113–139. American Mathematical Society, Providence (2010)Google Scholar
- 2.Gautschi, W.: The interplay between classical analysis and (numerical) linear algebra-A tribute to Gene H. Golub. Electron. Trans. Numer. Anal. 13, 119–147 (2002)MathSciNetMATHGoogle Scholar
- 3.Gautschi, W.: Orthogonal Polynomials: Computation and Approximation. Numerical Mathematics and Scientific Computation. Oxford Science Publications/Oxford University Press, New York (2004)MATHGoogle Scholar
- 4.Gautschi, W.: Orthogonal polynomials, quadrature, and approximation: computational methods and software (in Matlab). In: Marcellán, F., Van Assche, W. (eds.) Orthogonal Polynomials and Special Functions: Computation and Applications. Lecture Notes in Mathematics, vol. 1883, pp. 1–77. Springer, Berlin/Heidelberg (2006)CrossRefGoogle Scholar
- 5.Simon, B.: Orthogonal Polynomials on the Unit Circle. American Mathematical Society Colloquium Publications, vol. 54 (2 volumes). American Mathematical Society, Providence (2005)Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2015