Ultra-arithmetic. II: Intervals of polynomials

DOI10.1016/0378-4754(82)90046-5zbMath1402.65040OpenAlexW2014575142MaRDI QIDQ1636021

Charles L. Epstein, T. J. Rivlin, Willard L. Miranker

Publication date: 4 June 2018

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-4754(82)90046-5

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30)

Related Items (3)

Rigorous uniform approximation of D-finite functions using Chebyshev expansions ⋮ Enclosing Chebyshev Expansions in Linear Time ⋮ A symbolic-numeric validation algorithm for linear ODEs with Newton-Picard method

Cites Work

• Unnamed Item
• Unnamed Item
• Ultra-arithmetic. I: Function data types
• Some new characterizations of the Chebyshev polynomials
• Bounds on a polynomial

This page was built for publication: Ultra-arithmetic. II: Intervals of polynomials