William_Kahan

William Kahan

William Kahan

Canadian mathematician and computer scientist


William "Velvel" Morton Kahan (born June 5, 1933) is a Canadian mathematician and computer scientist, who received the Turing Award in 1989 for "his fundamental contributions to numerical analysis",[2] was named an ACM Fellow in 1994,[2] and inducted into the National Academy of Engineering in 2005.[2]

Quick Facts Born, Nationality ...

Biography

Born to a Canadian Jewish family,[2] he attended the University of Toronto, where he received his bachelor's degree in 1954, his master's degree in 1956, and his Ph.D. in 1958, all in the field of mathematics. Kahan is now emeritus professor of mathematics and of electrical engineering and computer sciences (EECS) at the University of California, Berkeley.

Kahan was the primary architect behind the IEEE 754-1985 standard for floating-point computation (and its radix-independent follow-on, IEEE 854). He has been called "The Father of Floating Point", since he was instrumental in creating the original IEEE 754 specification.[2] Kahan continued his contributions to the IEEE 754 revision that led to the current IEEE 754 standard.

In the 1980s he developed the program "paranoia", a benchmark that tests for a wide range of potential floating-point bugs.[3] He also developed the Kahan summation algorithm, an important algorithm for minimizing error introduced when adding a sequence of finite-precision floating-point numbers. He coined the term "Table-maker's dilemma" for the unknown cost of correctly rounding transcendental functions to some preassigned number of digits.[4]

The Davis–Kahan–Weinberger dilation theorem is one of the landmark results in the dilation theory of Hilbert space operators and has found applications in many different areas.[5]

He is an outspoken advocate of better education of the general computing population about floating-point issues and regularly denounces decisions in the design of computers and programming languages that he believes would impair good floating-point computations.[6][7][8]

When Hewlett-Packard (HP) introduced the original HP-35 pocket scientific calculator, its numerical accuracy in evaluating transcendental functions for some arguments was not optimal. HP worked extensively with Kahan to enhance the accuracy of the algorithms, which led to major improvements. This was documented at the time in the Hewlett-Packard Journal.[9][10] He also contributed substantially to the design of the algorithms in the HP Voyager series and wrote part of their intermediate and advanced manuals.

See also


References

  1. "IEEE Emanuel R. Piore Award Recipients" (PDF). IEEE. Archived from the original (PDF) on November 24, 2010. Retrieved March 20, 2021.
  2. Haigh, Thomas (1989). "William ("Velvel") Morton Kahan". A. M. Turing Award. Retrieved 2017-05-27.
  3. Karpinski, Richard (1985), "Paranoia: A floating-point benchmark", Byte Magazine, 10 (2): 223–235
  4. Kahan, William. "A Logarithm Too Clever by Half". Retrieved 2008-11-14.
  5. Davis, Chandler; Kahan, W. M.; Weinberger, H. F. (1982). "Norm-Preserving Dilations and Their Applications to Optimal Error Bounds". SIAM Journal on Numerical Analysis. 19 (3): 445–469. Bibcode:1982SJNA...19..445D. doi:10.1137/0719029. hdl:10338.dmlcz/128534.
  6. Kahan, William (1 March 1998). "How Java's Floating-Point Hurts Everyone Everywhere" (PDF). Retrieved 1 March 2021.
  7. Haigh, Thomas (March 2016). "An interview with William M. Kahan" (PDF). Retrieved 1 March 2021.
  8. Kahan, William (31 July 2004). "Matlab's Loss is Nobody's Gain" (PDF). Retrieved 1 March 2021.
  9. Kahan, William M. (December 1979). "Personal Calculator Has Key to Solve Any Equation f(x) = 0" (PDF). Hewlett-Packard Journal. 30 (12): 20–26. Retrieved 2023-06-16.
  10. Kahan, William M. (August 1980). "Handheld Calculator Evaluates Integrals" (PDF). Hewlett-Packard Journal. 31 (8): 23–32. Retrieved 2023-06-16.

Share this article:

This article uses material from the Wikipedia article William_Kahan, and is written by contributors. Text is available under a CC BY-SA 4.0 International License; additional terms may apply. Images, videos and audio are available under their respective licenses.