User profiles for J. F. Traub

JF Traub

Edwin Howard Armstrong Professor of Computer Science, Columbia University
Verified email at cs.columbia.edu
Cited by 13117

[BOOK][B] Iterative methods for the solution of equations

JF Traub - 1982 - books.google.com
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 …

Information-based complexity

JF Traub - Encyclopedia of Computer Science, 2003 - dl.acm.org
Many of the mathematical models used in fields such as the physical sciences, engineering,
economics, and mathematical finance use continuous mathematical models. These models …

Optimal order of one-point and multipoint iteration

HT Kung, JF Traub - Journal of the ACM (JACM), 1974 - dl.acm.org
… We regard the proof given here as an improvement of Traub's proof. … KUNC~, HT, ANn
TRAUB, JF Computational complexity of one-point and multipoint iteration. Report, Computer Sci. …

Faster valuation of financial derivatives

S Paskov, JF Traub - 1996 - academiccommons.columbia.edu
Monte Carlo simulation is widely used to value complex nancial instruments. Vast sums are
spent annually on these methods. Monte Carlo methods use random (or more precisely, …

[BOOK][B] Complexity and information

JF Traub, AG Werschulz - 1998 - books.google.com
… This monograph is a greatly expanded and updated version of the series of lectures that
Joseph Traub presented by invitation of the Accademia Nazionale dei Lincei at the Scuola …

[PDF][PDF] On Euclid's algorithm and the theory of subresultants

WS Brown, JF Traub - Journal of the ACM (JACM), 1971 - dl.acm.org
This paper presents an elementary treatment of the theory of subresultants, and examines
the relationship of the subresultants of a given pair of polynomials to their polynomial …

The statistical security of a statistical database

JF Traub, Y Yemini, H Woźniakowski - ACM Transactions on Database …, 1984 - dl.acm.org
JF TRAUB AND Y. YEMINI Columbia University … Traub and Y. Yemini wish to
acknowledge the support of the Advance Research Projects Agency, under contract N00039-82-C-0427. …

A three-stage algorithm for real polynomials using quadratic iteration

MA Jenkins, JF Traub - SIAM Journal on Numerical Analysis, 1970 - SIAM
… In Jenkins and Traub [3] we studied an algorithm for polynomials with complex coefficients
which is similar in spirit to two-stage algorithmsproposed by Traub [6], [7], [8]. The results of [3] …

A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration

MA Jenkins, JF Traub - Numerische Mathematik, 1970 - Springer
… two-stage algorithms proposed by Traub [8--t0]. In [8] Traub gives a class of always convergent
Traub, JF : A class of globally convergent iteration functions for the solution of polynomial …

The algebraic theory of matrix polynomials

JE Dennis, Jr, JF Traub, RP Weber - SIAM Journal on Numerical Analysis, 1976 - SIAM
… [6] MA JENKINS AND JF TRAUB, A three-stage variable-shiftiteration:forpolynomial
zeros and its relation to generalized Rayleigh iteration, Numer. Math., 14 (1970), pp. [7] P. …