Traub, J. F. (Joseph Frederick) 1932
Overview
Works:  156 works in 370 publications in 4 languages and 7,541 library holdings 

Genres:  Conference papers and proceedings Periodicals 
Roles:  Author, Editor, Honoree, Creator 
Classifications:  QA297, 519.4 
Publication Timeline
.
Most widely held works about
J. F Traub
 Festschrift for the 70th birthday of Joseph F. Traub( Book )
 Traub, Joseph Frederick: theory( )
 Charles Babbage Institute Oral history collection by Charles Babbage Institute( )
 Oral history interview with Allen Newell by Allen Newell( )
 School of Computer Science Collection( )
 Oral history collection : by Charles Babbage Institute( )
more
fewer
Most widely held works by
J. F Traub
Iterative methods for the solution of equations by
J. F Traub(
Book
)
25 editions published between 1964 and 1999 in 3 languages and held by 754 WorldCat member libraries worldwide
25 editions published between 1964 and 1999 in 3 languages and held by 754 WorldCat member libraries worldwide
Complexity and information by
J. F Traub(
Book
)
15 editions published between 1998 and 2000 in English and held by 512 WorldCat member libraries worldwide
15 editions published between 1998 and 2000 in English and held by 512 WorldCat member libraries worldwide
A general theory of optimal algorithms by
J. F Traub(
Book
)
14 editions published between 1980 and 1983 in 3 languages and held by 466 WorldCat member libraries worldwide
14 editions published between 1980 and 1983 in 3 languages and held by 466 WorldCat member libraries worldwide
Algorithms and complexity : new directions and recent results : [proceedings of a Symposium on New Directions and Recent Results
in Algorithms and Complexity held by the Computer Science Department, CarnegieMellon University, April 79, 1976] by
J. F Traub(
Book
)
18 editions published between 1976 and 1977 in English and Italian and held by 381 WorldCat member libraries worldwide
18 editions published between 1976 and 1977 in English and Italian and held by 381 WorldCat member libraries worldwide
Information, uncertainty, complexity by
J. F Traub(
Book
)
14 editions published between 1983 and 1988 in 3 languages and held by 356 WorldCat member libraries worldwide
14 editions published between 1983 and 1988 in 3 languages and held by 356 WorldCat member libraries worldwide
Analytic computational complexity by
J. F Traub(
Book
)
18 editions published between 1976 and 2014 in English and Undetermined and held by 326 WorldCat member libraries worldwide
18 editions published between 1976 and 2014 in English and Undetermined and held by 326 WorldCat member libraries worldwide
Complexity of sequential and parallel numerical algorithms [proceedings] by
J. F Traub(
Book
)
16 editions published in 1973 in 3 languages and held by 316 WorldCat member libraries worldwide
16 editions published in 1973 in 3 languages and held by 316 WorldCat member libraries worldwide
Informationbased complexity by
J. F Traub(
Book
)
11 editions published in 1988 in English and Undetermined and held by 305 WorldCat member libraries worldwide
11 editions published in 1988 in English and Undetermined and held by 305 WorldCat member libraries worldwide
Cohabiting with computers(
Book
)
9 editions published between 1984 and 1985 in English and held by 263 WorldCat member libraries worldwide
9 editions published between 1984 and 1985 in English and held by 263 WorldCat member libraries worldwide
Supercomputers : directions in technology and applications by National Research Council Staff(
Book
)
7 editions published in 1989 in English and held by 192 WorldCat member libraries worldwide
7 editions published in 1989 in English and held by 192 WorldCat member libraries worldwide
Scaling up : a research agenda for software engineering by
National Research Council (U.S.)(
Book
)
2 editions published in 1989 in English and held by 84 WorldCat member libraries worldwide
Large and growing opportunity costs are resulting from the inability to produce sophisticated, reliable software in a timely manner. Software engineering presents stubborn problems, but in this book, a group of experts suggest several constructive directions for research. Together, they support the need for greater interaction between researchers and practitioners and more aggressive efforts to share and reuse software engineering knowledge
2 editions published in 1989 in English and held by 84 WorldCat member libraries worldwide
Large and growing opportunity costs are resulting from the inability to produce sophisticated, reliable software in a timely manner. Software engineering presents stubborn problems, but in this book, a group of experts suggest several constructive directions for research. Together, they support the need for greater interaction between researchers and practitioners and more aggressive efforts to share and reuse software engineering knowledge
The national challenge in computer science and technology by
National Research Council (U.S.)(
Book
)
3 editions published in 1988 in English and held by 35 WorldCat member libraries worldwide
3 editions published in 1988 in English and held by 35 WorldCat member libraries worldwide
Algorithms and complexity for continuous problems Dagstuhl seminar ; 06391 abstracts collection(
)
2 editions published in 2007 in English and held by 16 WorldCat member libraries worldwide
2 editions published in 2007 in English and held by 16 WorldCat member libraries worldwide
Annual review of computer science : Vol. 1, 1986(
Book
)
1 edition published in 1986 in English and held by 14 WorldCat member libraries worldwide
1 edition published in 1986 in English and held by 14 WorldCat member libraries worldwide
Annual review of computer science : Vol. 2, 1987(
Book
)
1 edition published in 1987 in English and held by 10 WorldCat member libraries worldwide
1 edition published in 1987 in English and held by 10 WorldCat member libraries worldwide
Annual review of computer science : vol. 4, 19891990(
Book
)
1 edition published in 1990 in English and held by 9 WorldCat member libraries worldwide
1 edition published in 1990 in English and held by 9 WorldCat member libraries worldwide
Principles for testing polynomial zerofinding programs by
M. A Jenkins(
Book
)
4 editions published in 1974 in English and held by 8 WorldCat member libraries worldwide
The stateoftheart in polynomial zerofinding algorithms and programs is briefly summarized. Our focus in this paper is on principles for testing such programs. We view testing as requiring four steps: (1) testing program robustness, (2) testing for convergence difficulties, (3) testing for specific weakness of the algorithms, (4) assessment of program performance by statistical testing. The authors' algorithm for real polynomials has been reprogrammed with substantial modifications to the decision making processes. In order to verify that the new program is a reliable and efficient mathematical software product, it underwent the testing outlined above. The results of part of this testing are described in this paper. (Modified author abstract)
4 editions published in 1974 in English and held by 8 WorldCat member libraries worldwide
The stateoftheart in polynomial zerofinding algorithms and programs is briefly summarized. Our focus in this paper is on principles for testing such programs. We view testing as requiring four steps: (1) testing program robustness, (2) testing for convergence difficulties, (3) testing for specific weakness of the algorithms, (4) assessment of program performance by statistical testing. The authors' algorithm for real polynomials has been reprogrammed with substantial modifications to the decision making processes. In order to verify that the new program is a reliable and efficient mathematical software product, it underwent the testing outlined above. The results of part of this testing are described in this paper. (Modified author abstract)
Accelerated iterative methods for the solution of tridiagonal systems on parallel computers by D. E Heller(
Book
)
5 editions published in 1974 in English and Undetermined and held by 8 WorldCat member libraries worldwide
The authors consider iterative methods for the solution of tridiagonal systems and present a new iteration whose rate of convergence is comparable to that of the optimal twocyclic Chebyshev iteration but which does not require the calculation of optimal parameters. The theory has a natural extension to block tridiagonal systems. Numerical experiments suggest that on a parallel computer this new algorithm is the best of the iterative algorithms considered
5 editions published in 1974 in English and Undetermined and held by 8 WorldCat member libraries worldwide
The authors consider iterative methods for the solution of tridiagonal systems and present a new iteration whose rate of convergence is comparable to that of the optimal twocyclic Chebyshev iteration but which does not require the calculation of optimal parameters. The theory has a natural extension to block tridiagonal systems. Numerical experiments suggest that on a parallel computer this new algorithm is the best of the iterative algorithms considered
On the complexity of composition and generalized composition of power series by
R. P Brent(
Book
)
3 editions published in 1978 in English and held by 7 WorldCat member libraries worldwide
Let F(x) = f1x + f2(x)(x) + ... be a formal power series over a field Delta. Let F superscript 0(x) = x and for q = 1,2, ..., define F superscript q(x) = F superscript (q1) (F(x)). The obvious algorithm for computing the first n terms of F superscript q(x) is by the composition position analogue of repeated squaring. This algorithm has complexity about log 2 q times that of a single composition. The factor log 2 q can be eliminated in the computation of the first n terms of (F(x)) to the q power by a change of representation, using the logarithm and exponential functions. We show the factor log 2 q can also be eliminated for the composition problem. F superscript q(x) can often, but not always, be defined for more general q. We give algorithms and complexity bounds for computing the first n terms of F superscript q(x) whenever it is defined
3 editions published in 1978 in English and held by 7 WorldCat member libraries worldwide
Let F(x) = f1x + f2(x)(x) + ... be a formal power series over a field Delta. Let F superscript 0(x) = x and for q = 1,2, ..., define F superscript q(x) = F superscript (q1) (F(x)). The obvious algorithm for computing the first n terms of F superscript q(x) is by the composition position analogue of repeated squaring. This algorithm has complexity about log 2 q times that of a single composition. The factor log 2 q can be eliminated in the computation of the first n terms of (F(x)) to the q power by a change of representation, using the logarithm and exponential functions. We show the factor log 2 q can also be eliminated for the composition problem. F superscript q(x) can often, but not always, be defined for more general q. We give algorithms and complexity bounds for computing the first n terms of F superscript q(x) whenever it is defined
All algebraic functions can be computed fast by
H. T Kung(
Book
)
4 editions published in 1976 in English and Undetermined and held by 7 WorldCat member libraries worldwide
The expansions of algebraic functions can be computed 'fast' using the Newton Polygon Process and any 'normal' iteration. Let M(j) be the number of operations sufficient to multiply two jth degree polynomials. It is shown that the first N terms of an expansion of any algebraic function defined by an nth degree polynomial can be computed in O(n(M(N)) operations, while the classical method needs O(N sup n) operations. Among the numerous applications of algebraic functions are symbolic mathematics and combinatorial analysis. Reversion, reciprocation, and nth root of a polynomial are all special cases of algebraic functions
4 editions published in 1976 in English and Undetermined and held by 7 WorldCat member libraries worldwide
The expansions of algebraic functions can be computed 'fast' using the Newton Polygon Process and any 'normal' iteration. Let M(j) be the number of operations sufficient to multiply two jth degree polynomials. It is shown that the first N terms of an expansion of any algebraic function defined by an nth degree polynomial can be computed in O(n(M(N)) operations, while the classical method needs O(N sup n) operations. Among the numerous applications of algebraic functions are symbolic mathematics and combinatorial analysis. Reversion, reciprocation, and nth root of a polynomial are all special cases of algebraic functions
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 National Research Council (U.S.). Computer Science and Technology Board
 National Research Council (U.S.). Commission on Physical Sciences, Mathematics, and Resources
 Hoffman, Allan R.
 Academy Industry Program (National Research Council (U.S.))
 Woźniakowski, H. Author
 National Science Foundation (U.S.)
 CarnegieMellon University Computer Science Department
 Wasilkowski, G. W.
 Werschulz, Arthur G.
 CarnegieMellon University
Useful Links
Associated Subjects
Algebraic functions Algorithms AlgorithmsTesting Amarel, Saul Approximation theory Approximation theoryData processing Artificial intelligence Artificial intelligenceResearch Buchanan, Bruce G CarnegieMellon University.Computer Science Department CarnegieMellon University.School of Computer Science Computational complexity Computational complexityData processing Computer algorithms Computer networks Computer programming Computers Computers and civilization Computer scienceMathematics Computer scienceResearch Computer software Computer softwareDevelopment Computer softwareVerification ComputersResearch Cooper, Robert B.,Jr, Electronic data processing Electronic digital computers EquationsNumerical solutions Feigenbaum, Edward A Iterative methods (Mathematics) Machine theory Mathematical optimization Mathematical optimizationData processing MathematicsData processing National Institutes of Health (U.S.) Newell, Allen Nilsson, Nils J., Numerical analysisData processing Numerical calculations Parallel processing (Electronic computers) Polynomials Sequential processing (Computer science) Simon, Herbert A.(Herbert Alexander), Software engineeringResearch Stanford Artificial Intelligence Laboratory Stanford University.Computer Science Department Supercomputers Traub, J. F.(Joseph Frederick), United States Winograd, Terry
Alternative Names
Traub, Dž.
Traub, Dž. 1932
Traub, Džo Fred 1932
Traub, Džozef Fredrik 1932
Traub, J. F.
Traub, J. F. 1932
Traub, Joe F. 1932
Traub, Joe Fred.
Traub Joe Fred 1932....
Traub, Joseph F.
Traub, Joseph F. 1932
Traub, Joseph F. (Joseph Frederick), 1932
Traub, Joseph Frederick.
Traub, Joseph Frederick 1932
Трауб, Дж 1932
トラウブ, ジョセフ・F
Languages
Covers