z-logo
open-access-imgOpen Access
Is the recurrence relation for orthogonal polynomials always stable?
Author(s) -
Walter Gautschi
Publication year - 1993
Publication title -
bit numerical mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.904
H-Index - 59
eISSN - 1572-9125
pISSN - 0006-3835
DOI - 10.1007/bf01989750
Subject(s) - kravchuk polynomials , discrete orthogonal polynomials , recurrence relation , orthogonal polynomials , classical orthogonal polynomials , recursion (computer science) , hahn polynomials , mathematics , wilson polynomials , legendre polynomials , gegenbauer polynomials , laguerre polynomials , difference polynomials , relation (database) , jacobi polynomials , phenomenon , connection (principal bundle) , pure mathematics , algebra over a field , mathematical analysis , algorithm , computer science , physics , geometry , quantum mechanics , database

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom