Fast evaluation and root finding for polynomials with floating-point coefficients
Abstract
References
Recommendations
On coefficients of Carlitz cyclotomic polynomials
Let n Z + , and n ( x ) be the nth classical cyclotomic polynomial. In 4, Theorem 1, D. Lehmer showed that the geometric mean of { s ( 1 ) : s , n Z + , s n } e 2.71828 , as n ∞ . Replacing Z by F q T , and the nth elementary cylcotomic polynomial n ( x ...
Computing recurrence coefficients of multiple orthogonal polynomials
Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a (r+2)-term recurrence relation connecting the type II multiple orthogonal polynomials near the diagonal (the so-called step-line recurrence relation) and ...
Connection and linearization coefficients of the Askey-Wilson polynomials
The linearization problem is the problem of finding the coefficients C"k(m,n) in the expansion of the product P"n(x)Q"m(x) of two polynomial systems in terms of a third sequence of polynomials R"k(x),P"n(x)Q"m(x)=@?k=0n+mC"k(m,n)R"k(x). The polynomials ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Other conferences](/cms/asset/cffa1264-12ec-46fd-b43b-0772c73bced0/3597066.cover.jpg)
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 41Total Downloads
- Downloads (Last 12 months)37
- Downloads (Last 6 weeks)2
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign inFull Access
View options
View or Download as a PDF file.
PDFeReader
View online with eReader.
eReaderHTML Format
View this article in HTML Format.
HTML Format