Charles B. Dunham

Publication Activity (10 Years)

Years Active: 1965-2003
Publications (10 Years): 0

Publications

Charles B. Dunham
Approximation with Taylor Matching at the Origin. Int. J. Comput. Math. 80 (8) (2003)
Charles B. Dunham
Wilkinson-type error analysis applied to double-precision accumulation under contamination, II. Int. J. Comput. Math. 77 (2) (2001)
Charles B. Dunham
Partially Wrong Completions. SIGACT News 31 (2) (2000)
Charles B. Dunham
Fitting approximations with fixed components at zeroFixed components at zero. Int. J. Comput. Math. 71 (1) (1999)
Charles B. Dunham
Wilkinson-type error analysis applied to double-precision accumulation under contamination. Int. J. Comput. Math. 71 (3) (1999)
Charles B. Dunham
Accurate evaluation of even and odd functions. Int. J. Comput. Math. 68 (1-2) (1998)
Changzhong Zhu, Charles B. Dunham, Darrell Schmidt
Generalized strong unicity constants in linear uniform approximation. Int. J. Comput. Math. 62 (1-2) (1996)
Charles B. Dunham, C. Z. Zhu
Minimax exponential approximation can be ILL-posed. Int. J. Comput. Math. 59 (1-2) (1995)
Charles B. Dunham
Uniform approximation by Mc Callig rationals. Numer. Algorithms 7 (2) (1994)
Charles B. Dunham, C. Z. Zhu
The remez algorithm for biased uniform approximation on an interval. Int. J. Comput. Math. 39 (3-4) (1991)
Charles B. Dunham
A cheap approximate solution to everett-type rational approximation problems. Int. J. Comput. Math. 34 (3-4) (1990)
Charles B. Dunham
Pessimization is unsolvable. SIGACT News 18 (3) (1987)
Charles B. Dunham
The cycle burning problem. SIGACT News 18 (1) (1986)
Charles B. Dunham
A simpler approach to the busy beaver problem. SIGACT News 17 (3) (1986)
Charles B. Dunham
A sequence of uncomputable functions. SIGACT News 16 (3) (1984)
Charles B. Dunham
The one-sided Remez algorithm. Computing 30 (3) (1983)
Charles B. Dunham
Choice of Basis for Chebyshev Approximation. ACM Trans. Math. Softw. 8 (1) (1982)
Charles B. Dunham
The Necessity of Publishing Programs. Comput. J. 25 (1) (1982)
Charles B. Dunham
Remez algorithm for Chebyshev approximation with interpolation. Computing 28 (1) (1982)
Charles B. Dunham
Remark on "Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]". ACM Trans. Math. Softw. 3 (1) (1977)
Charles B. Dunham
Efficiency of Chebyshev Approximation on Finite Subsets. J. ACM 21 (2) (1974)
Charles B. Dunham
phi(CX). Computing 13 (3-4) (1974)
Charles B. Dunham
approximation. Computing 13 (3-4) (1974)
Charles B. Dunham
When Absolute Approximations are Optimal in Function Subroutines. Comput. J. 16 (3) (1973)
Charles B. Dunham
Best mean rational approximation. Computing 9 (2) (1972)
Charles B. Dunham
Approximation by alternating families on subsets. Computing 9 (4) (1972)
Charles B. Dunham
Minimax Nonlinear Approximation by Approximation on Subsets. Commun. ACM 15 (5) (1972)
Charles B. Dunham
Remarks on algorithms with numerical constants. Commun. ACM 13 (9) (1970)
Charles B. Dunham
Minimax logarithmic error. Commun. ACM 12 (10) (1969)
Charles B. Dunham
Convergence Problems in Maehly's Second Method: Part II. J. ACM 13 (1) (1966)
Charles B. Dunham
Convergence Problems in Maehly's Second Method. J. ACM 12 (2) (1965)