Enclosing Chebyshev Expansions in Linear Time

DOI10.1145/3319395zbMath1486.65047OpenAlexW2964730797WikidataQ113310012 ScholiaQ113310012MaRDI QIDQ4960945

Behnam Hashemi

Publication date: 24 April 2020

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3319395

zbMATH Keywords

Chebyshev polynomialsClenshaw algorithmINTLABiterative refinementChebfunrigorous computing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50) Algorithms with automatic result verification (65G20) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Related Items (2)

The Laurent-Horner method for validated evaluation of Chebyshev expansions ⋮ Computing Enclosures for the Matrix Exponential

Uses Software

• Chebfun

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interval analysis and automatic result verification
• The stability of barycentric interpolation at the Chebyshev points of the second kind
• Computational existence proofs for spherical \(t\)-designs
• Fast conversion algorithms for orthogonal polynomials
• Barycentric formulas for interpolating trigonometric polynomials and their conjugates
• Ultra-arithmetic. I: Function data types
• Fast modular transforms
• Fast and parallel interval arithmetic
• Ultra-arithmetic. II: Intervals of polynomials
• Evaluation of Chebyshev polynomials by a three-term recurrence in floating-point arithmetic
• Horner's rule for interval evaluation revisited
• Accurate solution of dense linear systems. II: Algorithms using directed rounding
• Rigorous integration of non-linear ordinary differential equations in Chebyshev basis
• Verification methods: Rigorous results using floating-point arithmetic
• Chebyshev interpolation polynomial-based tools for rigorous computing
• Spherical $t_\epsilon $-designs for approximations on the sphere
• Numerical Methods in Scientific Computing, Volume I
• Error bounds from extra-precise iterative refinement
• Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
• Introduction to Interval Analysis
• Logarithmic Reduction of the Wrapping Effect with Application to Ordinary Differential Equations
• Interval Methods for Systems of Equations
• Error Analysis for Polynomial Evaluation
• The Fundamental Theorem of Linear Algebra
• Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic
• Handbook of Floating-Point Arithmetic
• Accelerating the Solution of Linear Systems by Iterative Refinement in Three Precisions
• Interval Enclosures of Upper Bounds of Roundoff Errors Using Semidefinite Programming
• Validated and Numerically Efficient Chebyshev Spectral Methods for Linear Ordinary Differential Equations
• Smooth Random Functions, Random ODEs, and Gaussian Processes
• Barycentric Lagrange Interpolation
• The numerical stability of barycentric Lagrange interpolation
• Accuracy and Stability of Numerical Algorithms
• The SIAM 100-Digit Challenge
• Accurate Floating-Point Summation Part I: Faithful Rounding
• Numerical Methods for Special Functions
• Iterative Refinement in Floating Point
• Lagrangian Interpolation at the Chebyshev Points xn,     cos (  /n),   = 0(1)n; some Unnoted Advantages
• Accurate Sum and Dot Product
• Rigorous and portable standard functions

This page was built for publication: Enclosing Chebyshev Expansions in Linear Time