Enclosing Chebyshev expansions in linear time
From MaRDI portal
Publication:4960945
Recommendations
- Accurate evaluation of a polynomial in Chebyshev form
- A test, based on conversion to the Bernstein polynomial basis, for an interval to be free of zeros applicable to polynomials in Chebyshev form and to transcendental functions approximated by Chebyshev series
- Rigorous uniform approximation of D-finite functions using Chebyshev expansions
- Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
- Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
Cites work
- scientific article; zbMATH DE number 1694758 (Why is no real title available?)
- scientific article; zbMATH DE number 1694759 (Why is no real title available?)
- scientific article; zbMATH DE number 3867259 (Why is no real title available?)
- scientific article; zbMATH DE number 3874497 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 5775425 (Why is no real title available?)
- scientific article; zbMATH DE number 4084894 (Why is no real title available?)
- scientific article; zbMATH DE number 53687 (Why is no real title available?)
- scientific article; zbMATH DE number 488523 (Why is no real title available?)
- scientific article; zbMATH DE number 524106 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 1862742 (Why is no real title available?)
- scientific article; zbMATH DE number 1916891 (Why is no real title available?)
- scientific article; zbMATH DE number 794708 (Why is no real title available?)
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- scientific article; zbMATH DE number 226866 (Why is no real title available?)
- scientific article; zbMATH DE number 2243090 (Why is no real title available?)
- scientific article; zbMATH DE number 3110365 (Why is no real title available?)
- Accelerating the solution of linear systems by iterative refinement in three precisions
- Accuracy and Stability of Numerical Algorithms
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Accurate Sum and Dot Product
- Accurate floating-point summation. II: Sign, \(K\)-fold faithful and rounding to nearest
- Accurate solution of dense linear systems. II: Algorithms using directed rounding
- Approximation theory and approximation practice
- Barycentric Lagrange Interpolation
- Barycentric formulas for interpolating trigonometric polynomials and their conjugates
- Chebyshev interpolation polynomial-based tools for rigorous computing
- Computational existence proofs for spherical \(t\)-designs
- Error Analysis for Polynomial Evaluation
- Error bounds from extra-precise iterative refinement
- Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
- Fast and parallel interval arithmetic
- Fast conversion algorithms for orthogonal polynomials
- Fast modular transforms
- Handbook of floating-point arithmetic
- Horner's rule for interval evaluation revisited
- Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
- Interval Methods for Systems of Equations
- Interval analysis and automatic result verification
- Introduction to Interval Analysis
- Iterative Refinement in Floating Point
- Lagrangian Interpolation at the Chebyshev Points xn, cos ( /n), = 0(1)n; some Unnoted Advantages
- Logarithmic Reduction of the Wrapping Effect with Application to Ordinary Differential Equations
- Numerical Methods for Special Functions
- Numerical Methods in Scientific Computing, Volume I
- Numerical recipes. The art of scientific computing.
- Rigorous and portable standard functions
- Rigorous integration of non-linear ordinary differential equations in Chebyshev basis
- Smooth random functions, random ODEs, and Gaussian processes
- Spherical $t_\epsilon $-designs for approximations on the sphere
- The Fundamental Theorem of Linear Algebra
- The SIAM 100-Digit Challenge
- The numerical stability of barycentric Lagrange interpolation
- The stability of barycentric interpolation at the Chebyshev points of the second kind
- Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic
- Ultra-arithmetic. I: Function data types
- Ultra-arithmetic. II: Intervals of polynomials
- Validated and numerically efficient Chebyshev spectral methods for linear ordinary differential equations
- Verification methods: rigorous results using floating-point arithmetic
Cited in
(5)- Chebyshev interpolation polynomial-based tools for rigorous computing
- Computing enclosures for the matrix exponential
- Chebyshev model arithmetic for factorable functions
- The Laurent-Horner method for validated evaluation of Chebyshev expansions
- Rigorous uniform approximation of D-finite functions using Chebyshev expansions
This page was built for publication: Enclosing Chebyshev expansions in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4960945)
