SciELO - Scientific Electronic Library Online

 
vol.53 issue2The formal derivative operator and multifactorial numbersCategorical definitions and properties via generators author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • On index processCited by Google
  • Have no similar articlesSimilars in SciELO
  • On index processSimilars in Google

Share


Revista Colombiana de Matemáticas

Print version ISSN 0034-7426

Rev.colomb.mat. vol.53 no.2 Bogotá July/Dec. 2019  Epub Mar 20, 2020

 

Artículos originales

On Symmetric (1,1)-Coherent Pairs and Sobolev Orthogonal polynomials: an algorithm to compute Fourier coefficients

Sobre (1,1) pares coherentes simétricos y polinomios ortogonales Sobolev: un algoritmo para calcular coeficientes de Fourier

HERBERT DUEÑAS RUIZ1 

FRANCISCO MARCELLÁN2 

ALEJANDRO MOLANO3 

1 Departamento de Matemáticas Universidad Nacional de Colombia Ciudad Universitaria Bogotá, Colombia e-mail: haduenasr@unal.edu.co

2 Departamento de Matemáticas Universidad Carlos III de Madrid Avenida de la Universidad 30, 28911 Legan Es, Spain e-mail: pacomarc@ing.uc3m.es

3 Escuela de Matemáticas y Estadística Universidad Pedagógica y Tecnológica de Colombia Escuela de Matemáticas y Estadística Carrera 18-22, 150461 Duitama, Colombia e-mail: luis.molano01@uptc.edu.co


ABSTRACT.

In the pioneering paper [13], the concept of Coherent Pair was introduced by Iserles et al. In particular, an algorithm to compute Fourier Coefficients in expansions of Sobolev orthogonal polynomials defined from coherent pairs of measures supported on an infinite subset of the real line is described. In this paper we extend such an algorithm in the framework of the so called Symmetric (1,1) -Coherent Pairs presented in [8].

Key words and phrases. Orthogonal polynomials; Symmetric (1,1)-coherent pairs; Sobolev-Fourier series

RESUMEN.

En el artículo pionero [13], fue introducido el concepto de Par Coherente por Iserles et al. En particular, allí es descrito un algoritmo para calcular coeficientes de Fourier de expansiones de polinomios ortogonales de tipo Sobolev definidos a partir de pares de medidas coherentes soportadas en un subconjunto infinito de la recta real. En esta contribución extendemos tal algoritmo en el contexto de los llamados Pares Simétricos (1,1) -Coherentes presentados en [8].

Palabras y frases clave. Polinomios ortogonales; Pares Simetricos (1, 1) -Coherentes; Series Sobolev-Fourier

Full text available only in PDF format.

Acknowledgements.

The authors thank the referees for the careful revision of the manuscript. Their suggestions and criticisms have contributed to improving the presentation. The work by Francisco Marcellán has been supported by Agencia Estatal de Investigación of Spain, grant PGC2018-096504-B-C33. The work by Alejandro Molano has been partially supported by Dirección de Investigaciones, Universidad Pedagógica y Tecnológica de Colombia, research project code 1922.

References

[1] P. Althammer, Eine erweiterung des orthogonalitatsbegriffes bei polynomen und deren anwendung auf die beste approximation, J. Reine Angew. Math. 211 (1962), 192-204. [ Links ]

[2] A. C. Berti and A. Sri Ranga, Companion orthogonal polynomials: some applications, Appl. Numer. Math. 39 (2001), 127-149. [ Links ]

[3] C. Brezinski, A direct proof of the Christoffel-Darboux identity and its equivalence to the recurrence relationship, J Comput Appl Math. 32 (1990), no. 1, 17-25. [ Links ]

[4] T. S. Chihara, An Introduction to Orthogonal Polynomials, Gordon and Breach, 1978. [ Links ]

[5] M. N. de Jesuós, F. Marcellóan, J. Petronilho, and N. Pinzón-Cortés, (M,N) - coherent pairs of order (m,k) and Sobolev orthogonal polynomials, J. Comput. Appl. Math. 256 (2014), 16-35. [ Links ]

[6] M. N. de Jesús and J. Petronilho, On linearly related sequences of derivatives of orthogonal polynomials, J. Math. Anal. Appl. 347 (2008), 482-492. [ Links ]

[7] A. M. Delgado, Ortogonalidad no estándar: problemas directos e inversos, Tesis doctoral, Universidad Carlos III de Madrid, 2006. [ Links ]

[8] A. M. Delgado and F. Marcellán, On an extension ofsymmetric coherent pairs of orthogonal polynomials, J. Comput. Appl. Math. 178 (2005), 155-168. [ Links ]

[9] H. Duenas, F. Marcellán, and A. Molano, Asymptotics of Sobolev orthogonal polynomials for Hermite (1,1)-coherent pairs, J. Math. Anal. Appl. 467 (2018), no. 1, 601-621. [ Links ]

[10] ______, A classification of symmetric (1, 1)-coherent pairs, Mathematics 7 (2019), no. 2-213, 1-32 [ Links ]

[11] J. Favard, Sur les polynômes de Tchebicheff, C.R. Acad. Sci. Paris 200 (1935), 2052-2053. [ Links ]

[12] B. Fischer and G. H. Golub, How to generate unknown orthogonal polynomials out of known orthogonal polynomials, J. Comput. Appl. Math. 43 (1992), 99-115. [ Links ]

[13] A. Iserles, P. E. Koch, S. P. Nørsett, and J. M. Sanz-Serna, On polynomials orthogonal with respect to certain Sobolev inner products, J. Approx. Theory 65 (1991), 151-175. [ Links ]

[14] M. Ismail and D. R. Masson, Generalized orthogonality and continued fractions, J. Approx. Theory 83 (1995), 1-40. [ Links ]

[15] D. C. Lewis, Polynomial least square approximations, Amer. J. Math. 69 (1947), 273-278. [ Links ]

[16] F. Marcellón and R. Alvarez Nodarse, On the "Favard theorem" and its extensions, J. Comput. Appl. Math. 127 (2001), 231-254. [ Links ]

[17] F. Marcellán and Y. Xu, On Sobolev orthogonal polynomials, Expo. Math. 33 (2015), no. 3, 308-352. [ Links ]

[18] P. Maroni, Une théorie algébrique des polynômes orthogonaux. Application aux polynomes orthogonaux semi-classiques, In Orthogonal polynomials and their applications (Erice, 1990), C. Brezinski, L. Gori, A, Ronveaux Editors, IMACS Ann. Comput. Appl. Math. 9 (1991), 95-130. [ Links ]

[19] H. G. Meijer, A short history oforthogonal polynomials in a Sobolev space I. The non-discrete case, Niew Archief voor Wiskunde 14 (1996), 93-113. [ Links ]

Received: February 2019; Accepted: July 2019

2010 Mathematics Subject Classification. 33C45, 42C05

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons BY