default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKathy Driver
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j18]Oksana Bihun
, Kathy Driver:
Orthogonal sequences constructed from quasi-orthogonal ultraspherical polynomials. Numer. Algorithms 85(2): 503-522 (2020)
2010 – 2019
- 2019
- [j17]Kathy Driver, Martin E. Muldoon:
Sharp parameter intervals for interlacing of zeros of equal degree Laguerre polynomials. J. Approx. Theory 248 (2019) - 2018
- [j16]Kathy Driver, Kerstin Jordaan:
Zeros of Jacobi polynomials Pn(α, β), -2 < α, β < -1. Numer. Algorithms 79(4): 1075-1085 (2018) - 2015
- [j15]Kathy Driver, Martin E. Muldoon:
Common and interlacing zeros of families of Laguerre polynomials. J. Approx. Theory 193: 89-98 (2015) - 2012
- [j14]Kathy Driver, Kerstin Jordaan:
Bounds for extreme zeros of some classical orthogonal polynomials. J. Approx. Theory 164(9): 1200-1204 (2012) - [j13]Kathy Driver:
Interlacing of zeros of Gegenbauer polynomials of non-consecutive degree from different sequences. Numerische Mathematik 120(1): 35-44 (2012) - 2011
- [j12]Diego Dominici, Kathy Driver, Kerstin Jordaan:
Polynomial solutions of differential-difference equations. J. Approx. Theory 163(1): 41-48 (2011) - [j11]Alan F. Beardon, Kathy Driver, Kerstin Jordaan:
Zeros of polynomials embedded in an orthogonal sequence. Numer. Algorithms 57(3): 399-403 (2011)
2000 – 2009
- 2009
- [j10]Kathy Driver:
A note on the interlacing of zeros and orthogonality. J. Approx. Theory 161(2): 508-510 (2009) - [j9]Kathy Driver, Kerstin Jordaan:
Zeros of linear combinations of Laguerre polynomials from different sequences. J. Comput. Appl. Math. 233(3): 719-722 (2009) - 2008
- [j8]Kathy Driver, Kerstin Jordaan, Norbert Mbuyi:
Interlacing of the zeros of Jacobi polynomials with different parameters. Numer. Algorithms 49(1-4): 143-152 (2008) - 2007
- [j7]Kathy Driver, Kerstin Jordaan:
Interlacing of zeros of shifted sequences of one-parameter orthogonal polynomials. Numerische Mathematik 107(4): 615-624 (2007) - 2005
- [j6]Alan F. Beardon, Kathy Driver:
The zeros of linear combinations of orthogonal polynomials. J. Approx. Theory 137(2): 179-186 (2005) - [j5]Dov Aharonov, Alan F. Beardon, Kathy Driver:
Fibonacci, Chebyshev, and Orthogonal Polynomials. Am. Math. Mon. 112(7): 612-630 (2005) - 2002
- [j4]Kathy Driver, Kerstin Jordaan:
Zeros of 3 F2 (d, e - n, b, c ;z) Polynomials. Numer. Algorithms 30(3-4): 323-333 (2002) - 2001
- [j3]Kathy Driver, Manfred Möller:
Zeros of the Hypergeometric Polynomials F(-n, b; -2n; z). J. Approx. Theory 110(1): 74-87 (2001)
1990 – 1999
- 1999
- [j2]Annie A. M. Cuyt, Kathy Driver, Jieqing Tan, Brigitte Verdonk:
Exploring multivariate Padé approximants for multiple hypergeometric series. Adv. Comput. Math. 10(1): 29-49 (1999) - [j1]Kathy Driver, Peter L. Duren:
Asymptotic zero distribution of hypergeometric polynomials. Numer. Algorithms 21(1-4): 147-156 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
