Enclosing Chebyshev expansions in linear time

DOI10.1145/3319395zbMATH Open1486.65047OpenAlexW2964730797WikidataQ113310012 ScholiaQ113310012MaRDI QIDQ4960945FDOQ4960945

Authors: 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

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

zbMATH Keywords

Chebyshev polynomialsiterative refinementINTLABClenshaw algorithmChebfunrigorous computing

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• 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
• Chebyshev interpolation polynomial-based tools for rigorous computing

Uses Software

• Chebfun

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)