Ultra-arithmetic. I: Function data types
type: Item
instance of: scholarly article
title: Ultra-arithmetic. I: Function data types
zbMATH Open document ID: 0493.42005
DOI: 10.1016/0378-4754(82)90045-3
author: Willard L. Miranker
author: T. J. Rivlin
author: Charles L. Epstein
published in: Mathematics and Computers in Simulation
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 42A10
Mathematics Subject Classification ID: 65G50
Mathematics Subject Classification ID: 65J99
zbMATH DE Number: 3776169
zbMATH Keywords: digital computer
zbMATH Keywords: Fourier basis
zbMATH Keywords: Chebyshev basis
zbMATH Keywords: ultra-arithmetic
zbMATH Keywords: rounding error
zbMATH Keywords: minimization problem
zbMATH Keywords: Sobolev imbedding theorem
zbMATH Keywords: rounding errors
MaRDI profile type: Publication
full work available at URL: 0378-4754(82)90045-3
OpenAlex ID: W1998798933
cites work: The Arithmetic of the Digital Computer: A New Approach
cites work: Some new characterizations of the Chebyshev polynomials
cites work: Q5583224
cites work: Q5524570
description: scientific article; zbMATH DE number 3776169