Pages that link to "Item:Q2946533"
From MaRDI portal
The following pages link to Chebyshev interpolation polynomial-based tools for rigorous computing (Q2946533):
Displaying 15 items.
- Reusing Chebyshev points for polynomial interpolation (Q747725) (← links)
- Chebyshev rational interpolation (Q1370341) (← links)
- Chebyshev model arithmetic for factorable functions (Q1675562) (← links)
- A validated real function calculus (Q1949769) (← links)
- Application of Chebyshev, and Legendre polynomials on discrete point set to function interpolation and solving Fredholm integral equations (Q1973541) (← links)
- On the filtered polynomial interpolation at Chebyshev nodes (Q2029171) (← links)
- A symbolic-numeric validation algorithm for linear ODEs with Newton-Picard method (Q2051589) (← links)
- Set propagation in dynamical systems with generalised polynomial algebra and its computational complexity (Q2206505) (← links)
- Rigorous integration of non-linear ordinary differential equations in Chebyshev basis (Q2346283) (← links)
- Accurate polynomial interpolation by using the Bernstein basis (Q2407866) (← links)
- A rigorous implicit \(C^1\) Chebyshev integrator for delay equations (Q2665531) (← links)
- Rigorous uniform approximation of D-finite functions using Chebyshev expansions (Q2967967) (← links)
- Enclosing Chebyshev Expansions in Linear Time (Q4960945) (← links)
- A certificate-based approach to formally verified approximations (Q5875414) (← links)
- Efficient and validated numerical evaluation of abelian integrals (Q6604153) (← links)
