Charles B. Dunham

31 papers Journal 31

Year	Rank	Type	Title / Venue / Authors
2003	J	`jnl`	Approximation with Taylor Matching at the Origin. Int. J. Comput. Math. Charles B. Dunham
2001	J	`jnl`	Wilkinson-type error analysis applied to double-precision accumulation under contamination, II. Int. J. Comput. Math. Charles B. Dunham
2000	J	`jnl`	Partially Wrong Completions. SIGACT News Charles B. Dunham
1999	J	`jnl`	Fitting approximations with fixed components at zeroFixed components at zero. Int. J. Comput. Math. Charles B. Dunham
1999	J	`jnl`	Wilkinson-type error analysis applied to double-precision accumulation under contamination. Int. J. Comput. Math. Charles B. Dunham
1998	J	`jnl`	Accurate evaluation of even and odd functions. Int. J. Comput. Math. Charles B. Dunham
1996	J	`jnl`	Generalized strong unicity constants in linear uniform approximation. Int. J. Comput. Math. Changzhong Zhu, Charles B. Dunham, Darrell Schmidt
1995	J	`jnl`	Minimax exponential approximation can be ILL-posed. Int. J. Comput. Math. Charles B. Dunham, C. Z. Zhu
1994	J	`jnl`	Uniform approximation by Mc Callig rationals. Numer. Algorithms Charles B. Dunham
1991	J	`jnl`	The remez algorithm for biased uniform approximation on an interval. Int. J. Comput. Math. Charles B. Dunham, C. Z. Zhu
1990	J	`jnl`	A cheap approximate solution to everett-type rational approximation problems. Int. J. Comput. Math. Charles B. Dunham
1987	J	`jnl`	Pessimization is unsolvable. SIGACT News Charles B. Dunham
1986	J	`jnl`	A simpler approach to the busy beaver problem. SIGACT News Charles B. Dunham
1986	J	`jnl`	The cycle burning problem. SIGACT News Charles B. Dunham
1984	J	`jnl`	A sequence of uncomputable functions. SIGACT News Charles B. Dunham
1983	J	`jnl`	The one-sided Remez algorithm. Computing Charles B. Dunham
1982	J	`jnl`	Choice of Basis for Chebyshev Approximation. ACM Trans. Math. Softw. Charles B. Dunham
1982	J	`jnl`	Remez algorithm for Chebyshev approximation with interpolation. Computing Charles B. Dunham
1982	J	`jnl`	The Necessity of Publishing Programs. Comput. J. Charles B. Dunham
1977	J	`jnl`	Remark on "Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]". ACM Trans. Math. Softw. Charles B. Dunham
1974	J	`jnl`	Chebyshev approximation by A+B Computing Charles B. Dunham
1974	J	`jnl`	Efficiency of Chebyshev Approximation on Finite Subsets. J. ACM Charles B. Dunham
1974	J	`jnl`	Failure of Loeb's method for rational L Computing Charles B. Dunham
1973	J	`jnl`	When Absolute Approximations are Optimal in Function Subroutines. Comput. J. Charles B. Dunham
1972	J	`jnl`	Approximation by alternating families on subsets. Computing Charles B. Dunham
1972	J	`jnl`	Best mean rational approximation. Computing Charles B. Dunham
1972	J	`jnl`	Minimax Nonlinear Approximation by Approximation on Subsets. Commun. ACM Charles B. Dunham
1970	J	`jnl`	Remarks on algorithms with numerical constants. Commun. ACM Charles B. Dunham
1969	J	`jnl`	Minimax logarithmic error. Commun. ACM Charles B. Dunham
1966	J	`jnl`	Convergence Problems in Maehly's Second Method: Part II. J. ACM Charles B. Dunham
1965	J	`jnl`	Convergence Problems in Maehly's Second Method. J. ACM Charles B. Dunham