Background
Traub, J. F. was born on June 24, 1932.
(From the Preface (1964): ''This book presents a general t...)
From the Preface (1964): ''This book presents a general theory of iteration algorithms for the numerical solution of equations and systems of equations. The relationship between the quantity and the quality of information used by an algorithm and the efficiency of the algorithm is investigated. Iteration functions are divided into four classes depending on whether they use new information at one or at several points and whether or not they reuse old information. Known iteration functions are systematized and new classes of computationally effective iteration functions are introduced. Our interest in the efficient use of information is influenced by the widespread use of computing machines ... The mathematical foundations of our subject are treated with rigor, but rigor in itself is not the main object. Some of the material is of wider application ... Most of the material is new and unpublished. Every attempt has been made to keep the subject in proper historical perspective ... ''
http://www.amazon.com/gp/product/0828403120/?tag=2022091-20
(The twin themes of computational complexity and informati...)
The twin themes of computational complexity and information pervade this book. It starts with an introduction to information-based complexity, that is, the computational complexity of continuous mathematical models. It then moves to a variety of topics, including breaking the curse of dimensionality, complexity of path integration, solvability of ill-posed problems, value of information in computation, assigning values to mathematical hypotheses, and mathematical finance. The style is informal, and the goal is motivation and insight. Precise statements and proofs can be found in the monographs and papers included in the comprehensive bibliography. The book will be essential reading for researchers in the many disciplines influenced by the computational complexity of continuous problems.
http://www.amazon.com/gp/product/0521485061/?tag=2022091-20
(This book provides a comprehensive treatment of informati...)
This book provides a comprehensive treatment of information-based complexity, the branch of computational complexity that deals with the intrinsic difficulty of the approximate solution of problems for which the information is partial, noisy, and priced. Such problems arise in many areas including economics, physics, human and robotic vision, scientific and engineering computation, geophysics, decision theory, signal processing and control theory.
http://www.amazon.com/gp/product/0126975450/?tag=2022091-20
Traub, J. F. was born on June 24, 1932.
Bachelor of Science, City College of New York, 1954. Doctor of Philosophy, Columbia University, New York City, 1959. Doctor of Science (honorary), University Central Florida, Orlando, 2001.
Technical staff Bell Laboratories, Murray Hill, New Jersey, 1959-1970. Professor computer science and mathematics, head department computer science Carnegie-Mellon University, Pittsburgh, 1971-1979. Edwin Howard Armstrong professor computer science, chairman department, professor mathematics Columbia University, 1979-1986.
Professor computer science Princeton University, New Jersey, 1986-1987. President John Von Neumann National Supercomputer Center, Consortium for Science Computing, Princeton, 1986-1987. Edwin Howard Armstrong professor, chairman department computer science, professor mathematics Columbia University, New York City, 1987-1989, Edwin Howard Armstrong professor computer science, mathematics, since 1989.
External professor Santa Fe Institute, 1995-1998, since 2004. Fellow Biosgroup, 1998—2003. Director New York State Center Computers and Information Systems, 1982-1988.
Visiting Mackay professor University California, Berkeley, 1978-1979. Member president's advisory committee computer science Stanford University, 1972-1975, chairman, 1975-1976. Advisory committee Federal Judicial Center.
Member science council I.R.I.A., Paris, 1976-1980. Central steering committee computing science and engineering research study National Science Foundation, liaison to panel on theoretical computer science and panel on numerical computer, 1974-1980. Advisory committee Carnegie-Mellon Institute Research, 1978-1979.
Member applied mathematics division review committee Argonne National Laboratory, 1973-1975. Advisory committee mathematics and computer science National Science Foundation, 1978-1980, member committee visitors, 2005. Chairman computer science and technical board National Research Council, 1986-1990, computer science and telecommunications board, 1990-1992, National Academies, 2005-2009, member divisional committee engineering and physical science, since 2010.
Trustee Columbia University Press, 1983-1985. Lecturer in field; consultant in field.
(This book provides a comprehensive treatment of informati...)
(From the Preface (1964): ''This book presents a general t...)
(The twin themes of computational complexity and informati...)
Fellow American Association for the Advancement of Science (council 1971-1974), Association for Computing Machinery (ACM) (chairman award committee 1974-1976), New York Academy of Sciences, Society Industrial and Applied Mathematics. Member Institute of Electrical and Electronics Engineers (Emanuel R. Piore Gold medal 1991), National Academy of Engineering (membership committee for computer science, electrical engineering and control 1986-1987, membership committee for computer science and engineering 1987-1991, presidential search committee 1993-1994), Conference Board Mathematics Sciences (council 1971-1974), American Mathematics Society, Association Computing Machinery (founding chair special interest group on numerical mathematics 1965-1971).
Married Pamela Ann McCorduck, December 6, 1969. Children: Claudia Renee, Hillary Anne.