Charles B. Dunham - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 31 from 31

2003

Approximation with Taylor Matching at the OriginCharles B. Dunham. ijcm, 80(8):1019-1024, 2003. [doi]

2001

Wilkinson-type error analysis applied to double-precision accumulation under contamination, IICharles B. Dunham. ijcm, 77(2):299-303, 2001. [doi]

2000

Partially Wrong CompletionsCharles B. Dunham. sigact, 31(2):69, 2000. [doi]

1999

Fitting approximations with fixed components at zeroFixed components at zeroCharles B. Dunham. ijcm, 71(1):97-98, 1999. [doi]

Wilkinson-type error analysis applied to double-precision accumulation under contaminationCharles B. Dunham. ijcm, 71(3):369-372, 1999. [doi]

1998

Accurate evaluation of even and odd functionsCharles B. Dunham. ijcm, 68(1-2):189-191, 1998. [doi]

1996

Generalized strong unicity constants in linear uniform approximationChangzhong Zhu, Charles B. Dunham, Darrell Schmidt. ijcm, 62(1-2):73-87, 1996. [doi]

1995

Minimax exponential approximation can be ILL-posedCharles B. Dunham, C. Z. Zhu. ijcm, 59(1-2):67-70, 1995. [doi]

1994

Uniform approximation by Mc Callig rationalsCharles B. Dunham. na, 7(2):201-204, 1994. [doi]

1991

The remez algorithm for biased uniform approximation on an intervalCharles B. Dunham, C. Z. Zhu. ijcm, 39(3-4):213-216, 1991. [doi]

1990

A cheap approximate solution to everett-type rational approximation problemsCharles B. Dunham. ijcm, 34(3-4):255-257, 1990. [doi]

1987

Pessimization is unsolvableCharles B. Dunham. sigact, 18(3):37, 1987. [doi]

1986

The cycle burning problemCharles B. Dunham. sigact, 18(1):51, 1986. [doi]

A simpler approach to the busy beaver problemCharles B. Dunham. sigact, 17(3):29, 1986. [doi]

1984

A sequence of uncomputable functionsCharles B. Dunham. sigact, 16(3):48, 1984. [doi]

1983

The one-sided Remez algorithmCharles B. Dunham. computing, 30(3):275-278, 1983. [doi]

1982

The Necessity of Publishing ProgramsCharles B. Dunham. cj, 25(1):61-62, 1982.

Choice of Basis for Chebyshev ApproximationCharles B. Dunham. TOMS, 8(1):21-25, 1982. [doi]

Remez algorithm for Chebyshev approximation with interpolationCharles B. Dunham. computing, 28(1):75-78, 1982. [doi]

1977

Remark on Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4] Charles B. Dunham. TOMS, 3(1):112, 1977. [doi]

1974

Efficiency of Chebyshev Approximation on Finite SubsetsCharles B. Dunham. JACM, 21(2):311-313, 1974. [doi]

Chebyshev approximation by A+B:::*:::phi(CX)Charles B. Dunham. computing, 13(3-4):205-213, 1974. [doi]

Failure of Loeb s method for rational L::1:: approximationCharles B. Dunham. computing, 13(3-4):235-237, 1974. [doi]

1973

When Absolute Approximations are Optimal in Function SubroutinesCharles B. Dunham. cj, 16(3):265, 1973.

1972

Minimax Nonlinear Approximation by Approximation on SubsetsCharles B. Dunham. CACM, 15(5):351, 1972.

Approximation by alternating families on subsetsCharles B. Dunham. computing, 9(4):261-265, 1972. [doi]

Best mean rational approximationCharles B. Dunham. computing, 9(2):87-93, 1972. [doi]

1970

Remarks on algorithms with numerical constantsCharles B. Dunham. CACM, 13(9):575, 1970. [doi]

1969

Minimax logarithmic errorCharles B. Dunham. CACM, 12(10):581-582, 1969. [doi]

1966

Convergence Problems in Maehly s Second Method: Part IICharles B. Dunham. JACM, 13(1):108-113, 1966. [doi]

1965

Convergence Problems in Maehly s Second MethodCharles B. Dunham. JACM, 12(2):181-186, 1965. [doi]

Sign in or sign up to see more results.

runs on WebDSL