We stand with Ukraine  

Charles B. Dunham

According to our database1, Charles B. Dunham authored at least 31 papers between 1965 and 2003.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2003
Approximation with Taylor Matching at the Origin.
[BibTeX]
[DOI]
Charles B. Dunham
Int. J. Comput. Math., 2003

2001
Wilkinson-type error analysis applied to double-precision accumulation under contamination, II.
[BibTeX]
[DOI]
Charles B. Dunham
Int. J. Comput. Math., 2001

2000
Partially Wrong Completions.
[BibTeX]
[DOI]
Charles B. Dunham
SIGACT News, 2000

1999
Wilkinson-type error analysis applied to double-precision accumulation under contamination.
[BibTeX]
[DOI]
Charles B. Dunham
Int. J. Comput. Math., 1999

Fitting approximations with fixed components at zeroFixed components at zero.
[BibTeX]
[DOI]
Charles B. Dunham
Int. J. Comput. Math., 1999

1998
Accurate evaluation of even and odd functions.
[BibTeX]
[DOI]
Charles B. Dunham
Int. J. Comput. Math., 1998

1996
Generalized strong unicity constants in linear uniform approximation.
[BibTeX]
[DOI]
Changzhong Zhu
,
Charles B. Dunham
,
Darrell Schmidt
Int. J. Comput. Math., 1996

1995
Minimax exponential approximation can be ILL-posed.
[BibTeX]
[DOI]
Charles B. Dunham
,
C. Z. Zhu
Int. J. Comput. Math., 1995

1994
Uniform approximation by Mc Callig rationals.
[BibTeX]
[DOI]
Charles B. Dunham
Numer. Algorithms, 1994

1991
The remez algorithm for biased uniform approximation on an interval.
[BibTeX]
[DOI]
Charles B. Dunham
,
C. Z. Zhu
Int. J. Comput. Math., 1991

1990
A cheap approximate solution to everett-type rational approximation problems.
[BibTeX]
[DOI]
Charles B. Dunham
Int. J. Comput. Math., 1990

1987
Pessimization is unsolvable.
[BibTeX]
[DOI]
Charles B. Dunham
SIGACT News, 1987

1986
A simpler approach to the busy beaver problem.
[BibTeX]
[DOI]
Charles B. Dunham
SIGACT News, 1986

The cycle burning problem.
[BibTeX]
[DOI]
Charles B. Dunham
SIGACT News, 1986

1984
A sequence of uncomputable functions.
[BibTeX]
[DOI]
Charles B. Dunham
SIGACT News, 1984

1983
The one-sided Remez algorithm.
[BibTeX]
[DOI]
Charles B. Dunham
Computing, 1983

1982
Choice of Basis for Chebyshev Approximation.
[BibTeX]
[DOI]
Charles B. Dunham
ACM Trans. Math. Softw., 1982

Remez algorithm for Chebyshev approximation with interpolation.
[BibTeX]
[DOI]
Charles B. Dunham
Computing, 1982

The Necessity of Publishing Programs.
[BibTeX]
[DOI]
Charles B. Dunham
Comput. J., 1982

1977
Remark on "Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]".
[BibTeX]
[DOI]
Charles B. Dunham
ACM Trans. Math. Softw., 1977

1974
Efficiency of Chebyshev Approximation on Finite Subsets.
[BibTeX]
[DOI]
Charles B. Dunham
J. ACM, 1974

Failure of Loeb's method for rational L<sub>1</sub> approximation.
[BibTeX]
[DOI]
Charles B. Dunham
Computing, 1974

Chebyshev approximation by A+B<sup>*</sup>phi(CX).
[BibTeX]
[DOI]
Charles B. Dunham
Computing, 1974

1973
When Absolute Approximations are Optimal in Function Subroutines.
[BibTeX]
[DOI]
Charles B. Dunham
Comput. J., 1973

1972
Approximation by alternating families on subsets.
[BibTeX]
[DOI]
Charles B. Dunham
Computing, 1972

Best mean rational approximation.
[BibTeX]
[DOI]
Charles B. Dunham
Computing, 1972

Minimax Nonlinear Approximation by Approximation on Subsets.
[BibTeX]
[DOI]
Charles B. Dunham
Commun. ACM, 1972

1970
Remarks on algorithms with numerical constants.
[BibTeX]
[DOI]
Charles B. Dunham
Commun. ACM, 1970

1969
Minimax logarithmic error.
[BibTeX]
[DOI]
Charles B. Dunham
Commun. ACM, 1969

1966
Convergence Problems in Maehly's Second Method: Part II.
[BibTeX]
[DOI]
Charles B. Dunham
J. ACM, 1966

1965
Convergence Problems in Maehly's Second Method.
[BibTeX]
[DOI]
Charles B. Dunham
J. ACM, 1965


  Loading...