Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Charles B. Dunham

dblp:74/6970 · DBLP profile ↗
← Back
7ranked-venue papers
7as first author
0since 2021 · last 1982
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 5 · 5 first-authorTheory of computation · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Mathematical optimization · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
approximation theory		 0.031974
Efficiency of Chebyshev Approximation on Finite Subsets · J. ACM 1974
Convergence Problems in Maehly's Second Method: Part II · J. ACM 1966
Convergence Problems in Maehly's Second Method · J. ACM 1965
Mathematical optimization › approximation theory
chebyshev approximation		 0.031974
Efficiency of Chebyshev Approximation on Finite Subsets · J. ACM 1974
Convergence Problems in Maehly's Second Method: Part II · J. ACM 1966
Convergence Problems in Maehly's Second Method · J. ACM 1965

Methods — techniques the papers use, named apart from their topics

remez algorithm · 0.0numerical analysis · 0.0
YearPublicationVenuePosition
1982 The Necessity of Publishing Programs
abstract
Reasons are given why programs for numerical algorithms should be published.
Charles B. Dunham
 Comput. J.1
1982 Choice of Basis for Chebyshev Approximation
abstract
In Chebyshev approximation on a finite interval by polynomials or ordinary rationals usmg the Fraser-Hart version of the Remez second algorithm, a choice of basis for polynomials must be made.The power basis and Chebyshev polynomial Tk basis are compared.
Charles B. Dunham
 ACM Trans. Math. Softw.1
1977 Remark on "Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]"
abstract
No abstract available.
Charles B. Dunham
 ACM Trans. Math. Softw.1
1974 Efficiency of Chebyshev Approximation on Finite Subsets
abstract
Chebyshev approximation on an interval and closed subsets by a Haar subspace are considered. The closeness of best approximations on subsets to the best approximation on the interval is examined. It is shown that under favorable conditions the difference is O ((density of the subset) 2 ), making it unnecessary to use very large finite subsets to get good approximations on the interval.
Charles B. Dunham
 J. ACM1
1973 When Absolute Approximations are Optimal in Function Subroutines
abstract
We show that in a very common case best absolute approximations are optimal in subroutines for mathematical functions.
Charles B. Dunham
 Comput. J.1
1966 Convergence Problems in Maehly's Second Method: Part II
abstract
Maehly's second method is a general algorithm for finding the best Chebyshev approximation to a continuous function on a finite interval. This paper examines the convergence properties of Maehly's second method, a modification, and the more commonly used algorithm of Remez, using both analytical and numerical results.
Charles B. Dunham
 J. ACM1
1965 Convergence Problems in Maehly's Second Method
abstract
Maehly's second method is an algorithm for finding lhe best Chebyshev approximation to a continuous function (m a finite interval.This note describes a small simplification of the computation.It also exhibits simple examples in which the method fails to c(mverge a~d it~troduces a modification of the method in the polynomial e~tse.[nlroduction Let f(x) be a given function which is to be approximated as well as possible on [%~]bY F(5, x), a function of n -4-1 parameters // = (a0, al,.-.,a~).Having defined the error e(z) = f(x) -F(//, x), one seeks the a which minimizes ',l ell = max I e(x) l = max If(x) --F(a,x) l .a<_<x<6 a<_.z<<_B
Charles B. Dunham
 J. ACM1