Premium
New classes of orthogonal polynomials
Author(s) -
Srivastava Vipin,
Ramesh Naidu A.
Publication year - 2005
Publication title -
international journal of quantum chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.484
H-Index - 105
eISSN - 1097-461X
pISSN - 0020-7608
DOI - 10.1002/qua.20890
Subject(s) - orthogonalization , monomial , orthogonality , orthogonal polynomials , mathematics , kravchuk polynomials , class (philosophy) , classical orthogonal polynomials , monomial basis , discrete orthogonal polynomials , set (abstract data type) , pure mathematics , hahn polynomials , interval (graph theory) , weight function , combinatorics , gegenbauer polynomials , computer science , algorithm , mathematical analysis , geometry , artificial intelligence , programming language
We show that two new classes of orthogonal polynomials can be derived by applying two orthogonalization procedures due to Löwdin to a set of monomials. They are new in that they possess novel properties in terms of their inner products with the monomials. Each class comprises sets of orthogonal polynomials that satisfy orthogonality conditions with respect to a weight function on a certain interval. © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2006