Introduction to Orthogonal Polynomials: Definition and basic properties
|
|
- Prosper Cain
- 5 years ago
- Views:
Transcription
1 Introduction to Orthogonal Polynomials: Definition and basic properties Prof. Dr. Mama Foupouagnigni African Institute for Mathematical Sciences, Limbe, Cameroon and Department of Mathematics, Higher Teachers Training College University of Yaounde I, Cameroon AIMS-Volkswagen Stiftung Workshop on Introduction to Orthogonal Polynomials and Applications Hotel Prince de Galles, Douala, Cameroon, October 5-12, 2018
2 Table of Contents 1 Why should we study orthogonal polynomials? 2 An example of a system of orthogonal polynomials 3 Construction of a system of orthogonal polynomials 4 Definition of orthogonal polynomials 5 Basis properties of orthogonal polynomials 6 Tutorials: Solving assignments
3 Main objectives 1 Give an example of a system of orthogonal polynomials 2 Provide a method for constructing a system orthogonal Polynomials 3 Define the notion of orthogonal polynomials; 4 Provide (with some illustrations on the proof) some basic properties such as: the uniqueness of a family of orthogonal polynomials; the matrix representation; the three-term recurrence relation, the Christoffel-Darboux formula and some of its consequences such as the interlacing properties of the zeros. 5 Finally we discuss and solve, as a short tutorial, some assignments given within the first talk which are mainly proof of some results provided earlier.
4 Why should we study orthogonal polynomials? Orthogonal polynomials are to be seen as a sequence of polynomials (p n ) n with deg(p n ) = n with orthogonality property. They are very useful in practice in various domains of mathematics, physics, engineering and so on because of the many properties and relations they satisfy: 1 Orthogonality (all of them) 2 Three term recurrence relation (all of them) 3 Darboux-Christoffel formula (all of them) 4 Matrix representation (all of them); 5 Gauss quadrature (all of them): used for approximation of integrals; 6 second-order holonomic differential, difference or q-difference equation (classical ones); 7 Fourth-order holonomic differential, difference or q-difference equations (Laguerre-Hahn class); 8 Rodrigues formula (classical ones); 9 Partial differential, difference or q-difference equations (OP of several variables); 10 Expansion of continuous function with integrable square derivable in terms of Fourier series of OP (classical OP);
5 AMS subject classification for Orthogonal Polynomials
6 The Chebyshev polynomials of the first kind Chebyshev polynomials of the first kind are defined by T n (x) = cos(nθ), x = cos θ, 0 < θ < π (1) {w0} and fulfil the following properties: 1 T n is a polynomial of degree n in x: This can be seen from the recurrence relation T n+1 (x) + T n 1 (x) = 2xT n (x), n 1, T 0 (x) = 1, T 1 (x) = x; (2) {w1} 2 (T n ) n satisfies the orthogonality relation π 1 dx cos(nθ) cos(mθ)dθ = k n δ n,m = T n (x) T m (x) (3) x 2 (with k 0 = π, k n = π 2, n 1), obtained using the change of variable {w2} x = cos θ, 0 < θ < π and the linearization formula 2 cos nθ cos mθ = cos(n + m)θ + cos(n m)θ. 3 Monic Chebyshev polynomial of degree n is the polynomial deviating less { from zero on [ 1, 1] among monic polynomials } of degree n: min max q n(x), q n R[x], q n (x) = x n x 1 4 Second-order holonomic differential equation: = max 1 x 1 21 n T n (x) = 2 1 n. (4) {w3} (1 x 2 ) T n (x) x T n(x) + n 2 T n (x) = 0, n 0. (5) {w4}
7 First 10 Chebyshev I Polynomials From the three-term recurrence relation, one can generate any T n : T n+1 (x) = 2xT n (x) T n 1 (x), n 1, T 0 (x) = 1, T 1 (x) = x; T 2 (x) = 2 x 2 1, T 3 (x) = 4 x 3 3 x, T 4 (x) = 8 x 4 8 x 2 + 1, T 5 (x) = 16 x 5 20 x x, (6) {w5} T 6 (x) = 32 x 6 48 x x 2 1, T 7 (x) = 64 x x x 3 7 x, T 8 (x) = 128 x x x 4 32 x 2 + 1, T 9 (x) = 256 x x x x x. The zeros x n,k of T n ranked in increasing order are: ( ) (2(n k) + 1 x n,k = cos π, k = 1..n. 2n (7) {w6}
8 Graphic of the first 10 Chebyshev I Polynomials
9 Orthogonality relations for the Chebyshev I Polynomials Summing up, we have seen that the Chebyshev polynomials T n satisfy: and the orthogonality condition: deg(t n ) = n 0; 1 dx 1 T n (x) T m (x) = 0, n m, dx T n (x) T n (x) 1 x 2 1 x , n 0. The polynomial sequence (T n ) n is said to be orthogonal with respect to the weight function ρ(x) = 1 1 x 2 defined over the interval ] 1, 1[. It is an orthogonal polynomial sequence. Assignment 1: Establish relations (1)-(7).
10 Construction of a system of orthogonal polynomials:part 1 Let us consider a scalar product (, ) defined on R[x] R[x] where R[x] is the ring of polynomials with real variable. As scalar product, it fulfills the following properties: (p, p) 0, p R[x], and (p, p) = 0 = p = 0, (8) {w7} (p, q) = (q, p), p, q R[x], (9) (λ p, q) = λ (p, q), λ R, p, q R[x], (10) (p + q, r) = (p, r) + (q, r), p, q, r R[x]. (11) As examples of scalar products on R[x] with connections to known systems of orthogonal polynomials, we mention: (p, q) = 1 1 connected to Chebyshev polynomials; (p, q) = dx p(x) q(x), (12) {w8} 1 x 2 N w k p(k) q(k), N N { }, (13) {w9} k=0 leading to orthogonal polynomials of a discrete variable.
11 Construction of a system of orthogonal polynomials: Part 2 Theorem (Gram-Schmidt orthogonalisation process) The polynomial systems (q n ) n and (p n ) n defined recurrently by the relations n 1 q 0 = 1, q n = x n satisfy the relations k=0 (q k, x n ) (q k, q k ) q k, n 1, p k = deg(q n ) = deg(p n ) = n, n 0, (q n, q m ) = 0, n m, (q n, q n ), 0 n n, (p n, p m ) = 0, n m, (p n, p n ) = 1, n n. q k, k 0, (14) {w10 (qk, q k ) The proof is done by induction on n: Assignment 2. The polynomial systems (q n ) n and (p n ) n are said to be orthogonal with respect to the scalar product (, ). They represent the same orthogonal polynomial system with different normalisation: (q n ) n is monic (to say the coefficient of the leading monomial is equal to 1) while (p n ) n is orthonormal ( (p n, p n ) = 1).
12 Definition of orthogonal polynomials: Part 1 Orthogonality with respect to a scalar product A system (p n ) n of polynomials is said to be orthogonal with respect to the scalar product (, ) if it satisfies the following 2 conditions deg(p n ) = n, n 0, (15) {w11 (p n, p m ) = 0, n m, (p n, p n ) 0, n n. (16) {w12 When scalar product is defined by a Stieltjes integral When the scalar product (, ) is defined by a Stieltjes integral (p, q) = b a p(x) q(x) dα(x), (17) {w13 where α is an appropriate real-valued function, then (16) reads b p n (x) p m (x) dα(x) = 0, n m, b a a p n (x) p n (x) dα(x) 0, n 0. (18) {w14
13 Definition of the Stieltjes integral
14 Definition of orthogonal polynomials: Part 2 When scalar product is defined by the Riemann When the scalar product is defined by a Stieltjes integral (17) with dα(x) = w(x) dx where w is an appropriate function, then (16) reads b a p n (x) p m (x) w(x) dx = 0, n m, b a p n (x) p n (x) w(x) dx 0, n 0. (p n ) n is said to be orthogonal with respect to the weight function w. Because of the form of the orthogonality relation, the variable here is continuous. When scalar product is defined by a special Stieltjes function When the scalar product is defined by a Stieltjes integral (17) where w is an appropriate step function on N or on {0, 1,..., N}, then (14) reads N (p, q) = w(k) p(k) q(k), N N { }. (19) {w17 k=0 (p n ) n is said to be orthogonal with respect to the discrete weight function w. Because of the form of the orthogonality relation, the variable is discrete. Assignment 3: Find the first five monic polynomials orthogonal with respect to the weight w(x) = 1 defined on the interval [ 1, 1].
15 Basis properties of orthogonal polynomials: Part 1 In this section, we will assume that the polynomial sequence (p n ) n satisfies deg(p n ) = n, n 0 and the orthogonality relation (18) which we recall here: b a p n (x) p m (x) dα(x) = 0, n m, b a p n (x) p n (x) dα(x) 0, n 0. Then we have the following properties: Lemma (Equivalent orthogonality relation) The orthogonality relation (18) is equivalent to b a p n (x) x m dα(x) = 0, n 1, 0 m n 1, b a p n (x) x n dα(x) 0, n 0. The previous equation implies that p n is orthogonal to any polynomial of degree less than n. (20) {w18
16 Basis properties of orthogonal polynomials Theorem (Uniqueness of an orthogonal polynomial system) To a scalar product (, ) on R[x] is associated a unique up to a multiplicative factor system of orthogonal polynomials: If (p n ) n and (q n ) n are both orthogonal with respect to a scalar product (, ), then there exists a sequence (α n ) n with α n 0, n 0 such that p n = α n q n, n 0. Proof s Indication: For a fixed n 1, we expand p n in terms of the (q k ) k and obtain n p n = c k,n q k, with Hence k=0 c k,n = (p n, q k ) = 0, for 0 k n 1. (q k, q k ) p n = (p n, q n ) (q n, q n ) q n.
17 Basis properties of orthogonal polynomials Theorem (Matrix representation of a system of orthogonal polynomials) Denoting by µ n the moment with respect to the Stieltjes measure dα µ n = b and n the Hankel determinant defined by a x n dα(x), n 0, n = det(µ k+j ) 0 k,j n 0, n 0, then the monic polynomial sequence orthogonal with respect to the Stieltjes measure dα is given by p n = 1 n 1 µ 0 µ 1 µ n 1 µ n µ 1 µ 1 µ n 1 µ n (21) {w19 µ n 1 µ n µ 2n 2 µ 2n 1 1 x x n 1 x n. Assignment 4: Proof of the theorem. Proof s indication: Prove that (p n, x k ) = 0, 0 k n 1, (p n, x n ) 0.
18 Basis properties of orthogonal polynomials Theorem (Three-term recurrence relation) Any polynomial sequence (p n ), orthogonal with respect to a scalar product (, ) defined by the Stieltjes integral satisfies the following relation called three-term recurrence relation x p n (x) = with a n a n+1 p n+1 + ( bn a n b n+1 a n+1 ) p n + a n 1 a n d 2 n d 2 n 1 p n 1, p 1 = 0, p 0 = 1, (22) {w20 p n = a n x n + b n x n 1 + low factors, (23) {w21 and d 2 n = (p n, p n ).. Assignment 5: Prove this theorem. Remark When (p n ) is monic (ie. a n = 1) or orthonormal (ie. d n = 1), then Equation (refw20) can be written respectively in the following forms: p n+1 = (x β n ) p n γ n p n 1, p 1 = 0, p 0 = 1, x p n = α n+1 p n+1 + β n p n + α n p n 1, p 1 = 0, p 0 = 1.
19 Basis properties of orthogonal polynomials: TTRR Proof s indication For fixed n 0, we expand x p n in the basis {p 0, p 1,..., p n+1 } to obtain Hence n+1 x p n = c k,n p k, k=0 c k,n = (xp n, p k ) (p k, p k ) = (p n, xp k ) = 0, 0 k < n 1. (p k, p k ) x p n = c n+1,n p n+1 + c n,n p n + c n 1,n p n 1. (24) {w22 Inserting (23) and (24) into (22) and identifying the leading coefficients of the monomials x n+1 and x n yields c n+1,n = a n a n+1, c n,n = ( bn b ) n+1. (25) {w23 a n a n+1
20 Basis properties of orthogonal polynomials Three-term recurrence relation Using twice (24) combined with the scalar product gives c n,n 1 dn 2 = (x p n, p n 1 ) = (p n, x p n 1 ) = c n 1,n dn 1 2 from where we deduct using (25) that c n 1,n = a n 1 a n d 2 n d 2 n 1.
21 Basis properties of orthogonal polynomials Theorem (Christofell-Darboux formula) Any system of orthogonal polynomials satisfying the three-term recurrence relation xp n (x) = a ( n bn p n+1 + b ) n+1 p n + a n 1 dn 2 p n 1, p 1 = 0, p 0 = 1, a n+1 a n a n+1 a n d 2 n 1 satisfies a so-called Christofell-Darboux formula given respectively in its initial form and confluent form as n k=0 p k (x)p k (y) d 2 k n k=0 p k (x)p k (x) d 2 k = a n a n+1 1 d 2 n = a n a n+1 1 d 2 n p n+1 (x) p n (y) p n+1 (y) p n (x), x y (26) {w24 x y ( p n+1 (x) p n (x) p n+1 (x) p n(x) ). (27) {w25 Assignment 6: Prove the Christoffel-Darboux formula and its confluent form
22 Basis properties of orthogonal polynomials Proof of the Christoffel-Darboux formula For the proof of (26), we multiply by p k (y) Equation (24) in which n is replaced by k to obtain x p k (x) p k (y) = c k+1,k p k+1 (x) p k (y) + c k,k p k (x) p k (y) + c k 1,k p k 1 (x) p k (y). Interchanging the role of x and y in the previous equation, we obtain y p k (x) p k (y) = c k+1,k p k+1 (y) p k (x) + c k,k p k (x) p k (y) + c k 1,k p k 1 (y) p k (x). Subtracting the last equation from the last but one, we obtain that p k (x) p k (y) d 2 k A k+1 (x, y) = c k+1,k d 2 k = A k+1(x, y) A k (x, y), x y (p k+1 (x) p k (y) p k+1 (y) p k (x)) taking into account the relation c k+1,k = c k,k+1. dk 2 dk+1 2 Equation (27) is obtained by taking the limit of (26) when y goes to x. = a k a k+1 1 d 2 k
23 Basic properties of Orthogonal Polynomials Theorem (On the zeros of orthogonal polynomials) If (p n ) n is an orthogonal polynomial system, the we have: 1 p n and p n+1 have no common zero. The same applies for P n and P n; 2 p n has n real simple zeros x n,k satisfying a < x n,k < b, 1 k n. 3 if x n,1 < x n,2 < < x n,n are the n zeros of p n, then a < x n+1,k < x n,k < x n+1,k+1, 1 k n.
24 Graphic of the first 10 Chebyshev I Polynomials
25 Tutorials: Solving assignments As tutorial, please solve assignment 1 to 6.
26 Thanks for your kind attention
Legendre s Equation. PHYS Southern Illinois University. October 18, 2016
Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying
More informationOrthogonal Polynomials and Gaussian Quadrature
Orthogonal Polynomials and Gaussian Quadrature 1. Orthogonal polynomials Given a bounded, nonnegative, nondecreasing function w(x) on an interval, I of the real line, we consider the Hilbert space L 2
More informationAPPENDIX B GRAM-SCHMIDT PROCEDURE OF ORTHOGONALIZATION. Let V be a finite dimensional inner product space spanned by basis vector functions
301 APPENDIX B GRAM-SCHMIDT PROCEDURE OF ORTHOGONALIZATION Let V be a finite dimensional inner product space spanned by basis vector functions {w 1, w 2,, w n }. According to the Gram-Schmidt Process an
More informationi x i y i
Department of Mathematics MTL107: Numerical Methods and Computations Exercise Set 8: Approximation-Linear Least Squares Polynomial approximation, Chebyshev Polynomial approximation. 1. Compute the linear
More informationApproximation theory
Approximation theory Xiaojing Ye, Math & Stat, Georgia State University Spring 2019 Numerical Analysis II Xiaojing Ye, Math & Stat, Georgia State University 1 1 1.3 6 8.8 2 3.5 7 10.1 Least 3squares 4.2
More informationOrthogonal polynomials
Orthogonal polynomials Gérard MEURANT October, 2008 1 Definition 2 Moments 3 Existence 4 Three-term recurrences 5 Jacobi matrices 6 Christoffel-Darboux relation 7 Examples of orthogonal polynomials 8 Variable-signed
More informationCurve Fitting and Approximation
Department of Physics Cotton College State University, Panbazar Guwahati 781001, Assam December 6, 2016 Outline Curve Fitting 1 Curve Fitting Outline Curve Fitting 1 Curve Fitting Topics in the Syllabus
More informationSPECTRAL METHODS: ORTHOGONAL POLYNOMIALS
SPECTRAL METHODS: ORTHOGONAL POLYNOMIALS 31 October, 2007 1 INTRODUCTION 2 ORTHOGONAL POLYNOMIALS Properties of Orthogonal Polynomials 3 GAUSS INTEGRATION Gauss- Radau Integration Gauss -Lobatto Integration
More informationScientific Computing
2301678 Scientific Computing Chapter 2 Interpolation and Approximation Paisan Nakmahachalasint Paisan.N@chula.ac.th Chapter 2 Interpolation and Approximation p. 1/66 Contents 1. Polynomial interpolation
More informationORTHOGONAL POLYNOMIALS
ORTHOGONAL POLYNOMIALS 1. PRELUDE: THE VAN DER MONDE DETERMINANT The link between random matrix theory and the classical theory of orthogonal polynomials is van der Monde s determinant: 1 1 1 (1) n :=
More informationPower Series Solutions to the Legendre Equation
Department of Mathematics IIT Guwahati The Legendre equation The equation (1 x 2 )y 2xy + α(α + 1)y = 0, (1) where α is any real constant, is called Legendre s equation. When α Z +, the equation has polynomial
More informationAdvanced Computational Fluid Dynamics AA215A Lecture 2 Approximation Theory. Antony Jameson
Advanced Computational Fluid Dynamics AA5A Lecture Approximation Theory Antony Jameson Winter Quarter, 6, Stanford, CA Last revised on January 7, 6 Contents Approximation Theory. Least Squares Approximation
More informationPower Series Solutions to the Legendre Equation
Power Series Solutions to the Legendre Equation Department of Mathematics IIT Guwahati The Legendre equation The equation (1 x 2 )y 2xy + α(α + 1)y = 0, (1) where α is any real constant, is called Legendre
More information8.2 Discrete Least Squares Approximation
Chapter 8 Approximation Theory 8.1 Introduction Approximation theory involves two types of problems. One arises when a function is given explicitly, but we wish to find a simpler type of function, such
More informationChapter 1 Divide and Conquer Algorithm Theory WS 2016/17 Fabian Kuhn
Chapter 1 Divide and Conquer Algorithm Theory WS 2016/17 Fabian Kuhn Formulation of the D&C principle Divide-and-conquer method for solving a problem instance of size n: 1. Divide n c: Solve the problem
More informationVectors in Function Spaces
Jim Lambers MAT 66 Spring Semester 15-16 Lecture 18 Notes These notes correspond to Section 6.3 in the text. Vectors in Function Spaces We begin with some necessary terminology. A vector space V, also
More informationChapter 1 Divide and Conquer Polynomial Multiplication Algorithm Theory WS 2015/16 Fabian Kuhn
Chapter 1 Divide and Conquer Polynomial Multiplication Algorithm Theory WS 2015/16 Fabian Kuhn Formulation of the D&C principle Divide-and-conquer method for solving a problem instance of size n: 1. Divide
More informationORTHOGONAL POLYNOMIALS FOR THE OSCILLATORY-GEGENBAUER WEIGHT. Gradimir V. Milovanović, Aleksandar S. Cvetković, and Zvezdan M.
PUBLICATIONS DE L INSTITUT MATHÉMATIQUE Nouvelle série, tome 8498 2008, 49 60 DOI: 02298/PIM0898049M ORTHOGONAL POLYNOMIALS FOR THE OSCILLATORY-GEGENBAUER WEIGHT Gradimir V Milovanović, Aleksandar S Cvetković,
More informationMATH 312 Section 6.2: Series Solutions about Singular Points
MATH 312 Section 6.2: Series Solutions about Singular Points Prof. Jonathan Duncan Walla Walla University Spring Quarter, 2008 Outline 1 Classifying Singular Points 2 The Method of Frobenius 3 Conclusions
More informationOrthogonal polynomials
Korteweg-de Vries Institute, University of Amsterdam T.H.Koornwinder@uva.nl http://www.science.uva.nl/~thk/ Notes of two lectures given at the LHCPHENOnet School Integration, Summation and Special Functions
More informationInterpolation and Cubature at Geronimus Nodes Generated by Different Geronimus Polynomials
Interpolation and Cubature at Geronimus Nodes Generated by Different Geronimus Polynomials Lawrence A. Harris Abstract. We extend the definition of Geronimus nodes to include pairs of real numbers where
More information5.1 Learning using Polynomial Threshold Functions
CS 395T Computational Learning Theory Lecture 5: September 17, 2007 Lecturer: Adam Klivans Scribe: Aparajit Raghavan 5.1 Learning using Polynomial Threshold Functions 5.1.1 Recap Definition 1 A function
More informationLEGENDRE POLYNOMIALS AND APPLICATIONS. We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.
LEGENDRE POLYNOMIALS AND APPLICATIONS We construct Legendre polynomials and apply them to solve Dirichlet problems in spherical coordinates.. Legendre equation: series solutions The Legendre equation is
More informationPUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include
PUTNAM TRAINING POLYNOMIALS (Last updated: December 11, 2017) Remark. This is a list of exercises on polynomials. Miguel A. Lerma Exercises 1. Find a polynomial with integral coefficients whose zeros include
More informationBest approximation in the 2-norm
Best approximation in the 2-norm Department of Mathematical Sciences, NTNU september 26th 2012 Vector space A real vector space V is a set with a 0 element and three operations: Addition: x, y V then x
More informationProgram : M.A./M.Sc. (Mathematics) M.A./M.Sc. (Final) Paper Code:MT-08 Numerical Analysis Section A (Very Short Answers Questions)
Program : M../M.Sc. (Mathematics) M../M.Sc. (Final) Paper Code:MT-08 Numerical nalysis Section (Very Short nswers Questions) 1. Write two examples of transcendental equations. (i) x 3 + sin x = 0 (ii)
More informationMAT Linear Algebra Collection of sample exams
MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system
More informationLinear Independence. Stephen Boyd. EE103 Stanford University. October 9, 2017
Linear Independence Stephen Boyd EE103 Stanford University October 9, 2017 Outline Linear independence Basis Orthonormal vectors Gram-Schmidt algorithm Linear independence 2 Linear dependence set of n-vectors
More informationON LINEAR COMBINATIONS OF
Física Teórica, Julio Abad, 1 7 (2008) ON LINEAR COMBINATIONS OF ORTHOGONAL POLYNOMIALS Manuel Alfaro, Ana Peña and María Luisa Rezola Departamento de Matemáticas and IUMA, Facultad de Ciencias, Universidad
More informationQuadratures and integral transforms arising from generating functions
Quadratures and integral transforms arising from generating functions Rafael G. Campos Facultad de Ciencias Físico-Matemáticas, Universidad Michoacana, 58060, Morelia, México. rcampos@umich.mx Francisco
More informationNumerical Linear Algebra Chap. 2: Least Squares Problems
Numerical Linear Algebra Chap. 2: Least Squares Problems Heinrich Voss voss@tu-harburg.de Hamburg University of Technology Institute of Numerical Simulation TUHH Heinrich Voss Numerical Linear Algebra
More informationMathematical Methods wk 1: Vectors
Mathematical Methods wk : Vectors John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationMathematical Methods wk 1: Vectors
Mathematical Methods wk : Vectors John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationInner products. Theorem (basic properties): Given vectors u, v, w in an inner product space V, and a scalar k, the following properties hold:
Inner products Definition: An inner product on a real vector space V is an operation (function) that assigns to each pair of vectors ( u, v) in V a scalar u, v satisfying the following axioms: 1. u, v
More informationHankel determinants, continued fractions, orthgonal polynomials, and hypergeometric series
Hankel determinants, continued fractions, orthgonal polynomials, and hypergeometric series Ira M. Gessel with Jiang Zeng and Guoce Xin LaBRI June 8, 2007 Continued fractions and Hankel determinants There
More informationSYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS
SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS J MC LAUGHLIN Abstract Let fx Z[x] Set f 0x = x and for n 1 define f nx = ff n 1x We describe several infinite
More informationMathematical Induction Again
Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 12, 2017 Outline Mathematical Induction Simple POMI Examples
More informationChebyshev approximation
faculty of science and engineering Chebyshev approximation Bètawetenschappelijk Onderzoek: Wiskunde July 017 Student: M.H. Mudde First supervisor: Dr. A. E. Sterk Second supervisor: Prof. dr. A. J. van
More informationOPSF, Random Matrices and Riemann-Hilbert problems
OPSF, Random Matrices and Riemann-Hilbert problems School on Orthogonal Polynomials in Approximation Theory and Mathematical Physics, ICMAT 23 27 October, 2017 Plan of the course lecture 1: Orthogonal
More informationMathematical Induction Again
Mathematical Induction Again James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University January 2, 207 Outline Mathematical Induction 2 Simple POMI Examples
More informationBivariate Lagrange interpolation at the Padua points: The generating curve approach
Journal of Approximation Theory 43 (6) 5 5 www.elsevier.com/locate/jat Bivariate Lagrange interpolation at the Padua points: The generating curve approach Len Bos a, Marco Caliari b, Stefano De Marchi
More informationIntroduction to orthogonal polynomials. Michael Anshelevich
Introduction to orthogonal polynomials Michael Anshelevich November 6, 2003 µ = probability measure on R with finite moments m n (µ) = R xn dµ(x)
More information3. Coding theory 3.1. Basic concepts
3. CODING THEORY 1 3. Coding theory 3.1. Basic concepts In this chapter we will discuss briefly some aspects of error correcting codes. The main problem is that if information is sent via a noisy channel,
More informationMoreover this binary operation satisfies the following properties
Contents 1 Algebraic structures 1 1.1 Group........................................... 1 1.1.1 Definitions and examples............................. 1 1.1.2 Subgroup.....................................
More informationLecture 4.6: Some special orthogonal functions
Lecture 4.6: Some special orthogonal functions Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4340, Advanced Engineering Mathematics
More informationd 1 µ 2 Θ = 0. (4.1) consider first the case of m = 0 where there is no azimuthal dependence on the angle φ.
4 Legendre Functions In order to investigate the solutions of Legendre s differential equation d ( µ ) dθ ] ] + l(l + ) m dµ dµ µ Θ = 0. (4.) consider first the case of m = 0 where there is no azimuthal
More informationLecture 6, Sci. Comp. for DPhil Students
Lecture 6, Sci. Comp. for DPhil Students Nick Trefethen, Thursday 1.11.18 Today II.3 QR factorization II.4 Computation of the QR factorization II.5 Linear least-squares Handouts Quiz 4 Householder s 4-page
More informationTwo special equations: Bessel s and Legendre s equations. p Fourier-Bessel and Fourier-Legendre series. p
LECTURE 1 Table of Contents Two special equations: Bessel s and Legendre s equations. p. 259-268. Fourier-Bessel and Fourier-Legendre series. p. 453-460. Boundary value problems in other coordinate system.
More informationInverses. Stephen Boyd. EE103 Stanford University. October 28, 2017
Inverses Stephen Boyd EE103 Stanford University October 28, 2017 Outline Left and right inverses Inverse Solving linear equations Examples Pseudo-inverse Left and right inverses 2 Left inverses a number
More informationSpectral Theory of Orthogonal Polynomials
Spectral Theory of Orthogonal Polynomials Barry Simon IBM Professor of Mathematics and Theoretical Physics California Institute of Technology Pasadena, CA, U.S.A. Lecture 1: Introduction and Overview Spectral
More informationChapter 4. Series Solutions. 4.1 Introduction to Power Series
Series Solutions Chapter 4 In most sciences one generation tears down what another has built and what one has established another undoes. In mathematics alone each generation adds a new story to the old
More informationNonlinear Integral Equation Formulation of Orthogonal Polynomials
Nonlinear Integral Equation Formulation of Orthogonal Polynomials Eli Ben-Naim Theory Division, Los Alamos National Laboratory with: Carl Bender (Washington University, St. Louis) C.M. Bender and E. Ben-Naim,
More informationAn Analysis of Five Numerical Methods for Approximating Certain Hypergeometric Functions in Domains within their Radii of Convergence
An Analysis of Five Numerical Methods for Approximating Certain Hypergeometric Functions in Domains within their Radii of Convergence John Pearson MSc Special Topic Abstract Numerical approximations of
More informationLinear Algebra. and
Instructions Please answer the six problems on your own paper. These are essay questions: you should write in complete sentences. 1. Are the two matrices 1 2 2 1 3 5 2 7 and 1 1 1 4 4 2 5 5 2 row equivalent?
More information1. Algebra 1.5. Polynomial Rings
1. ALGEBRA 19 1. Algebra 1.5. Polynomial Rings Lemma 1.5.1 Let R and S be rings with identity element. If R > 1 and S > 1, then R S contains zero divisors. Proof. The two elements (1, 0) and (0, 1) are
More informationBIVARIATE LAGRANGE INTERPOLATION AT THE PADUA POINTS: THE IDEAL THEORY APPROACH
BIVARIATE LAGRANGE INTERPOLATION AT THE PADUA POINTS: THE IDEAL THEORY APPROACH LEN BOS, STEFANO DE MARCHI, MARCO VIANELLO, AND YUAN XU Abstract The Padua points are a family of points on the square [,
More information18.S34 (FALL 2007) PROBLEMS ON ROOTS OF POLYNOMIALS
18.S34 (FALL 2007) PROBLEMS ON ROOTS OF POLYNOMIALS Note. The terms root and zero of a polynomial are synonyms. Those problems which appeared on the Putnam Exam are stated as they appeared verbatim (except
More informationON THE CHEBYSHEV POLYNOMIALS. Contents. 2. A Result on Linear Functionals on P n 4 Acknowledgments 7 References 7
ON THE CHEBYSHEV POLYNOMIALS JOSEPH DICAPUA Abstract. This paper is a short exposition of several magnificent properties of the Chebyshev polynomials. The author illustrates how the Chebyshev polynomials
More informationINTERPOLATION. and y i = cos x i, i = 0, 1, 2 This gives us the three points. Now find a quadratic polynomial. p(x) = a 0 + a 1 x + a 2 x 2.
INTERPOLATION Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y). As an example, consider defining and x 0 = 0, x 1 = π/4, x
More informationClass notes: Approximation
Class notes: Approximation Introduction Vector spaces, linear independence, subspace The goal of Numerical Analysis is to compute approximations We want to approximate eg numbers in R or C vectors in R
More informationSolutions: Problem Set 3 Math 201B, Winter 2007
Solutions: Problem Set 3 Math 201B, Winter 2007 Problem 1. Prove that an infinite-dimensional Hilbert space is a separable metric space if and only if it has a countable orthonormal basis. Solution. If
More informationAn idea how to solve some of the problems. diverges the same must hold for the original series. T 1 p T 1 p + 1 p 1 = 1. dt = lim
An idea how to solve some of the problems 5.2-2. (a) Does not converge: By multiplying across we get Hence 2k 2k 2 /2 k 2k2 k 2 /2 k 2 /2 2k 2k 2 /2 k. As the series diverges the same must hold for the
More informationOn Orthogonal Polynomials in Several Variables
Fields Institute Communications Volume 00, 0000 On Orthogonal Polynomials in Several Variables Yuan Xu Department of Mathematics University of Oregon Eugene, Oregon 97403-1222 Abstract. We report on the
More informationJumping Sequences. Steve Butler 1. (joint work with Ron Graham and Nan Zang) University of California Los Angelese
Jumping Sequences Steve Butler 1 (joint work with Ron Graham and Nan Zang) 1 Department of Mathematics University of California Los Angelese www.math.ucla.edu/~butler UCSD Combinatorics Seminar 14 October
More informationFurther Mathematical Methods (Linear Algebra) 2002
Further Mathematical Methods (Linear Algebra) Solutions For Problem Sheet 9 In this problem sheet, we derived a new result about orthogonal projections and used them to find least squares approximations
More informationChapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations
Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2
More informationThis ODE arises in many physical systems that we shall investigate. + ( + 1)u = 0. (λ + s)x λ + s + ( + 1) a λ. (s + 1)(s + 2) a 0
Legendre equation This ODE arises in many physical systems that we shall investigate We choose We then have Substitution gives ( x 2 ) d 2 u du 2x 2 dx dx + ( + )u u x s a λ x λ a du dx λ a λ (λ + s)x
More informationBMT 2016 Orthogonal Polynomials 12 March Welcome to the power round! This year s topic is the theory of orthogonal polynomials.
Power Round Welcome to the power round! This year s topic is the theory of orthogonal polynomials. I. You should order your papers with the answer sheet on top, and you should number papers addressing
More information1/30: Polynomials over Z/n.
1/30: Polynomials over Z/n. Last time to establish the existence of primitive roots we rely on the following key lemma: Lemma 6.1. Let s > 0 be an integer with s p 1, then we have #{α Z/pZ α s = 1} = s.
More informationINTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES
Indian J Pure Appl Math, 49: 87-98, March 08 c Indian National Science Academy DOI: 0007/s36-08-056-9 INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES João Lita da Silva Department of Mathematics and
More informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationMathematical Induction Assignments
1 Mathematical Induction Assignments Prove the Following using Principle of Mathematical induction 1) Prove that for any positive integer number n, n 3 + 2 n is divisible by 3 2) Prove that 1 3 + 2 3 +
More informationMATRIX INTEGRALS AND MAP ENUMERATION 2
MATRIX ITEGRALS AD MAP EUMERATIO 2 IVA CORWI Abstract. We prove the generating function formula for one face maps and for plane diagrams using techniques from Random Matrix Theory and orthogonal polynomials.
More informationGeneral Power Series
General Power Series James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University March 29, 2018 Outline Power Series Consequences With all these preliminaries
More informationIndex. for Ɣ(a, z), 39. convergent asymptotic representation, 46 converging factor, 40 exponentially improved, 39
Index Abramowitz function computed by Clenshaw s method, 74 absolute error, 356 Airy function contour integral for, 166 Airy functions algorithm, 359 asymptotic estimate of, 18 asymptotic expansions, 81,
More informationMeasures, orthogonal polynomials, and continued fractions. Michael Anshelevich
Measures, orthogonal polynomials, and continued fractions Michael Anshelevich November 7, 2008 MEASURES AND ORTHOGONAL POLYNOMIALS. MEASURES AND ORTHOGONAL POLYNOMIALS. µ a positive measure on R. 2 MEASURES
More informationSpecial classes of polynomials
Special classes of polynomials Gospava B. Djordjević Gradimir V. Milovanović University of Niš, Faculty of Technology Leskovac, 2014. ii Preface In this book we collect several recent results on special
More informationMeasures, orthogonal polynomials, and continued fractions. Michael Anshelevich
Measures, orthogonal polynomials, and continued fractions Michael Anshelevich November 7, 2008 MEASURES AND ORTHOGONAL POLYNOMIALS. µ a positive measure on R. A linear functional µ[p ] = P (x) dµ(x), µ
More informationENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS. Special Functions GEORGE E. ANDREWS RICHARD ASKEY RANJAN ROY CAMBRIDGE UNIVERSITY PRESS
ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS Special Functions GEORGE E. ANDREWS RICHARD ASKEY RANJAN ROY CAMBRIDGE UNIVERSITY PRESS Preface page xiii 1 The Gamma and Beta Functions 1 1.1 The Gamma
More informationRecurrence Relations and Fast Algorithms
Recurrence Relations and Fast Algorithms Mark Tygert Research Report YALEU/DCS/RR-343 December 29, 2005 Abstract We construct fast algorithms for decomposing into and reconstructing from linear combinations
More informationOn Gauss-type quadrature formulas with prescribed nodes anywhere on the real line
On Gauss-type quadrature formulas with prescribed nodes anywhere on the real line Adhemar Bultheel, Ruymán Cruz-Barroso,, Marc Van Barel Department of Computer Science, K.U.Leuven, Celestijnenlaan 2 A,
More informationMultiple Orthogonal Polynomials
Summer school on OPSF, University of Kent 26 30 June, 2017 Introduction For this course I assume everybody is familiar with the basic theory of orthogonal polynomials: Introduction For this course I assume
More informationBackground and Definitions...2. Legendre s Equation, Functions and Polynomials...4 Legendre s Associated Equation and Functions...
Legendre Polynomials and Functions Reading Problems Outline Background and Definitions...2 Definitions...3 Theory...4 Legendre s Equation, Functions and Polynomials...4 Legendre s Associated Equation and
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationPolynomial approximation via de la Vallée Poussin means
Summer School on Applied Analysis 2 TU Chemnitz, September 26-3, 2 Polynomial approximation via de la Vallée Poussin means Lecture 2: Discrete operators Woula Themistoclakis CNR - National Research Council
More informationExercise 11. Isao Sasano
Exercise Isao Sasano Exercise Calculate the value of the following series by using the Parseval s equality for the Fourier series of f(x) x on the range [, π] following the steps ()-(5). () Calculate the
More informationGAUSS-LAGUERRE AND GAUSS-HERMITE QUADRATURE ON 64, 96 AND 128 NODES
GAUSS-LAGUERRE AND GAUSS-HERMITE QUADRATURE ON 64, 96 AND 128 NODES RICHARD J. MATHAR Abstract. The manuscript provides tables of abscissae and weights for Gauss- Laguerre integration on 64, 96 and 128
More informationApproximation Theory
Approximation Theory Function approximation is the task of constructing, for a given function, a simpler function so that the difference between the two functions is small and to then provide a quantifiable
More informationA trigonometric orthogonality with respect to a nonnegative Borel measure
Filomat 6:4 01), 689 696 DOI 10.98/FIL104689M Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat A trigonometric orthogonality with
More informationMath 255 Honors: Gram-Schmidt Orthogonalization on the Space of Polynomials
Math 55 Honors: Gram-Schmidt Orthogonalization on the Space of Polynomials David Moore May, 03 Abstract Gram-Schmidt Orthogonalization is a process to construct orthogonal vectors from some basis for a
More informationINNER PRODUCT SPACE. Definition 1
INNER PRODUCT SPACE Definition 1 Suppose u, v and w are all vectors in vector space V and c is any scalar. An inner product space on the vectors space V is a function that associates with each pair of
More informationMath Assignment 11
Math 2280 - Assignment 11 Dylan Zwick Fall 2013 Section 8.1-2, 8, 13, 21, 25 Section 8.2-1, 7, 14, 17, 32 Section 8.3-1, 8, 15, 18, 24 1 Section 8.1 - Introduction and Review of Power Series 8.1.2 - Find
More informationZeros of Jacobi Polynomials and associated. Inequalities
Zeros of Jacobi Polynomials and associated Inequalities Nina Mancha A Dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, in fulfilment of the requirements
More information14 Fourier analysis. Read: Boas Ch. 7.
14 Fourier analysis Read: Boas Ch. 7. 14.1 Function spaces A function can be thought of as an element of a kind of vector space. After all, a function f(x) is merely a set of numbers, one for each point
More informationBasic Algebra. Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series
Basic Algebra Final Version, August, 2006 For Publication by Birkhäuser Boston Along with a Companion Volume Advanced Algebra In the Series Cornerstones Selected Pages from Chapter I: pp. 1 15 Anthony
More informationMATH 220: INNER PRODUCT SPACES, SYMMETRIC OPERATORS, ORTHOGONALITY
MATH 22: INNER PRODUCT SPACES, SYMMETRIC OPERATORS, ORTHOGONALITY When discussing separation of variables, we noted that at the last step we need to express the inhomogeneous initial or boundary data as
More informationswapneel/207
Partial differential equations Swapneel Mahajan www.math.iitb.ac.in/ swapneel/207 1 1 Power series For a real number x 0 and a sequence (a n ) of real numbers, consider the expression a n (x x 0 ) n =
More informationThe Generating Functions for Pochhammer
The Generating Functions for Pochhammer Symbol { }, n N Aleksandar Petoević University of Novi Sad Teacher Training Faculty, Department of Mathematics Podgorička 4, 25000 Sombor SERBIA and MONTENEGRO Email
More information(Inv) Computing Invariant Factors Math 683L (Summer 2003)
(Inv) Computing Invariant Factors Math 683L (Summer 23) We have two big results (stated in (Can2) and (Can3)) concerning the behaviour of a single linear transformation T of a vector space V In particular,
More informationSolving Linear Systems Using Gaussian Elimination. How can we solve
Solving Linear Systems Using Gaussian Elimination How can we solve? 1 Gaussian elimination Consider the general augmented system: Gaussian elimination Step 1: Eliminate first column below the main diagonal.
More information