Ultra-arithmetic. I: Function data types

DOI10.1016/0378-4754(82)90045-3MaRDI QIDQ1168534zbMATH OpenOpenAlexFDO

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

Publication date 1982

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)90045-3

zbMATH Keywords

minimization problemFourier basisrounding errorrounding errorsSobolev imbedding theoremdigital computerChebyshev basisultra-arithmetic

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Roundoff error (65G50) Numerical analysis in abstract spaces (65J99)

Cites work

• scientific article; zbMATH DE number 3237034 (Why is no real title available?)
• scientific article; zbMATH DE number 3301601 (Why is no real title available?)
• Some new characterizations of the Chebyshev polynomials
• The Arithmetic of the Digital Computer: A New Approach

Cited in

(6)

• Ultra-arithmetic. II: Intervals of polynomials
• Efficient and validated numerical evaluation of abelian integrals
• A symbolic-numeric validation algorithm for linear ODEs with Newton-Picard method
• Enclosing Chebyshev expansions in linear time
• Rigorous uniform approximation of D-finite functions using Chebyshev expansions
• Set propagation in dynamical systems with generalised polynomial algebra and its computational complexity

This page was built for publication: Ultra-arithmetic. I: Function data types

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168534)