| 2003 |
|---|
| 9 | EE | Charles B. Dunham:
Approximation with Taylor Matching at the Origin.
Int. J. Comput. Math. 80(8): 1019-1024 (2003) |
| 1982 |
|---|
| 8 | | Charles B. Dunham:
The Necessity of Publishing Programs.
Comput. J. 25(1): 61-62 (1982) |
| 1977 |
|---|
| 7 | EE | Charles B. Dunham:
Remark on "Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]".
ACM Trans. Math. Softw. 3(1): 112 (1977) |
| 1974 |
|---|
| 6 | EE | Charles B. Dunham:
Efficiency of Chebyshev Approximation on Finite Subsets.
J. ACM 21(2): 311-313 (1974) |
| 1973 |
|---|
| 5 | | Charles B. Dunham:
When Absolute Approximations are Optimal in Function Subroutines.
Comput. J. 16(3): 265 (1973) |
| 1972 |
|---|
| 4 | | Charles B. Dunham:
Minimax Nonlinear Approximation by Approximation on Subsets.
Commun. ACM 15(5): 351 (1972) |
| 1969 |
|---|
| 3 | EE | Charles B. Dunham:
Minimax logarithmic error.
Commun. ACM 12(10): 581-582 (1969) |
| 1966 |
|---|
| 2 | EE | Charles B. Dunham:
Convergence Problems in Maehly's Second Method: Part II.
J. ACM 13(1): 108-113 (1966) |
| 1965 |
|---|
| 1 | EE | Charles B. Dunham:
Convergence Problems in Maehly's Second Method.
J. ACM 12(2): 181-186 (1965) |
