William Kahan

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
William Morton Kahan
William Kahan.jpg
Born (1933-06-05) June 5, 1933 (age 85)
NationalityCanadian
Alma materUniversity of Toronto
Known forIEEE 754
Kahan summation algorithm
AwardsTuring Award (1989)
IEEE Emanuel R. Piore Award (2000)
National Academy of Engineering
ACM Fellow
Scientific career
FieldsMathematics
Computer Science
InstitutionsUniversity of California, Berkeley
ThesisGauss-Seidel Methods Of Solving Large Systems Of Linear Equations (1958)
Doctoral advisorByron Alexander Griffith
Doctoral studentsJames Demmel

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"[1] , was named an ACM Fellow in 1994,[1] and inducted into the National Academy of Engineering in 2005.[1]

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.[1] 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] It would go on to detect the infamous Pentium division bug, and continues to have important uses to this day. 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 "The 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 may impair good floating-point computations.

When Hewlett–Packard introduced the original HP-35 pocket scientific calculator, its numerical accuracy in evaluating transcendental functions for some arguments was not optimal. Hewlett–Packard 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.[6][7] 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[edit]

References[edit]

  1. ^ a b c d Haigh, Thomas (1989). "William ("Velvel") Morton Kahan". A. M. Turing Award. Retrieved 2017-05-27.
  2. ^ WILLIAM (“VELVEL”) MORTON KAHAN AM Turing Award, Author: Thomas Haigh
  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. doi:10.1137/0719029.
  6. ^ 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 2008-11-14.
  7. ^ Kahan, William M. (August 1980). "Handheld Calculator Evaluates Integrals" (PDF). Hewlett-Packard Journal. 31 (8): 23–32. Retrieved 2008-11-14.

External links[edit]