Vance Faber

Vance Faber
Born (1944-12-01) December 1, 1944
Buffalo, New York
Residence Seattle, Washington
Nationality American
Fields Mathematician
Alma mater Washington University in Saint Louis

Vance Faber (born December 1, 1944 in Buffalo, New York) is a mathematician, known for his work in combinatorics, applied linear algebra and image processing.

Faber received his Ph.D. in 1971 from Washington University in Saint Louis. His advisor was Franklin Tepper Haimo.[1]

Faber was a professor at University of Colorado at Denver during the 1970s. He spent parts of 3 years at the National Center for Atmospheric Research in Boulder on a NASA postdoctoral fellowship where he wrote a second thesis on the numerical solution of the Shallow Water Equations under the direction of numerical analyst Paul Swarztrauber. In the 1980s and 1990s he was on the staff of the Computer Research and Applications Group at Los Alamos National Laboratory. He was Group Leader from 1990 to 1995.

From 1998 to 2003 Faber was CTO and Head of Research for three different small companies building imaging software: LizardTech, Mapping Science and Cytoprint. He is currently a consultant.

In 1981, Gene Golub offered a US$500 prize for "the construction of a 3-term conjugate gradient like descent method for non-symmetric real matrices or a proof that there can be no such method". Faber and his co-author Thomas A. Manteuffel won this prize for their 1984 paper, in which they gave conditions for the existence of such a method and showed that, in general, there can be no such method.[2][3]

See also

References

  1. Vance Faber at the Mathematics Genealogy Project
  2. Tichý, Petr (2008), On short recurrences for generating orthogonal Krylov subspace bases (PDF).
  3. Faber, Vance; Manteuffel, Thomas (1984), "Necessary and sufficient conditions for the existence of a conjugate gradient method", SIAM Journal on Numerical Analysis, 21 (2): 352–362, doi:10.1137/0721026, MR 736337.


This article is issued from Wikipedia - version of the 4/13/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.