Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic (Q1647657): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10543-017-0683-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2755037429
@@ Property / OpenAlex ID: W2755037429 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5558293
@@ Property / cites work: Q5558293 / rank @@
+Normal rank
@@ Property / cites work @@
+A fast algorithm for evaluation of normalized Hermite functions
+Normal rank
@@ Property / cites work @@
+Error analysis of an algorithm for summing certain finite series
+Normal rank
@@ Property / cites work @@
+Q5533821
@@ Property / cites work: Q5533821 / rank @@
+Normal rank
@@ Property / cites work @@
+Accuracy and Stability of Numerical Algorithms
@@ Property / cites work: Accuracy and Stability of Numerical Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+An Error Analysis of the Modified Clenshaw Method for Evaluating Chebyshev and Fourier Series
+Normal rank
@@ Property / cites work @@
+Q3579593
@@ Property / cites work: Q3579593 / rank @@
+Normal rank
@@ Property / cites work @@
+The three-term recursion for Chebyshev polynomials is mixed forward-backward stable
+Normal rank