Rigorous uniform approximation of D-finite functions using Chebyshev expansions

DOI10.1090/mcom/3135zbMath1361.65045arXiv1407.2802MaRDI QIDQ2967967

Marc Mezzarobba, Alexandre Benoit, Mioara Joldes

Publication date: 9 March 2017

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.2802

zbMATH Keywords

complexity; asymptotics; linear differential equations; recurrence relation; error bound; computer algebra; Chebyshev series; polynomial approximations; D-finite functions; Miller algorithm; interpolation polynomials; rigorous computing; Clenshaw method; functional enclosure

Mathematics Subject Classification ID

34A30: Linear ordinary differential equations and systems

65L05: Numerical methods for initial value problems involving ordinary differential equations

65L70: Error bounds for numerical methods for ordinary differential equations

65G20: Algorithms with automatic result verification

Related Items

Computation and Applications of Mathieu Functions: A Historical Perspective, A certificate-based approach to formally verified approximations, A symbolic-numeric validation algorithm for linear ODEs with Newton-Picard method, Linear differential equations as a data structure, A rigorous implicit \(C^1\) Chebyshev integrator for delay equations

Uses Software

• Maple
• MACSYMA
• Sollya
• chebop

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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient and accurate computation of upper bounds of approximation errors
• The chebop system for automatic solution of differential equations
• New fast algorithms for polynomial interpolation and evaluation on the Chebyshev node set
• Differentiably finite power series
• Ultra-arithmetic. I: Function data types
• A holonomic systems approach to special functions identities
• A mathematical analysis of Miller's algorithm
• Galois theory of difference equations
• Ultra-arithmetic. II: Intervals of polynomials
• Analytic theory of singular difference equations
• Taylor forms -- use and limits.
• On the relation between global properties of linear difference and differential equations with polynomial coefficients. II
• Effective asymptotics of linear recurrences with rational coefficients
• Optimal and nearly optimal algorithms for approximating polynomial zeros
• A unified approach to the tau method and Chebyshev series expansion techniques
• Lösungstypen von Differenzgleichungen und Summengleichungen in normierten abelschen Gruppen
• Computing numerically with functions instead of numbers
• Chebyshev series expansion of inverse polynomials
• A Fast and Well-Conditioned Spectral Method
• Chebyshev expansions for solutions of linear differential equations
• Chebyshev interpolation polynomial-based tools for rigorous computing
• Modern Computer Arithmetic
• Chebyshev Methods for Ordinary Differential Equations
• Reduction to Canonical Forms and the Stokes Phenomenon in the Theory of Linear Difference Equations
• The Holonomic Toolkit
• Power series composition and change of basis
• Sollya: An Environment for the Development of Numerical Codes
• Trigonometric Interpolation of Empirical and Analytical Functions