Zobrazeno 1 - 10
of 161
pro vyhledávání: '"Traub, J. F."'
Autor:
Papageorgiou, A., Traub, J. F.
Most continuous mathematical formulations arising in science and engineering can only be solved numerically and therefore approximately. We shall always assume that we're dealing with a numerical approximation to the solution. There are two major mot
Externí odkaz:
http://arxiv.org/abs/0712.1211
Autor:
Papageorgiou, A., Traub, J. F.
The number of qubits used by a quantum algorithm will be a crucial computational resource for the foreseeable future. We show how to obtain the classical query complexity for continuous problems. We then establish a simple formula for a lower bound o
Externí odkaz:
http://arxiv.org/abs/quant-ph/0512082
Autor:
Traub, J. F., Wozniakowski, H.
Publikováno v:
Quantum Information Processing 1(5), 365-388, Oct. 2002
We study path integration on a quantum computer that performs quantum summation. We assume that the measure of path integration is Gaussian, with the eigenvalues of its covariance operator of order j^{-k} with k>1. For the Wiener measure occurring in
Externí odkaz:
http://arxiv.org/abs/quant-ph/0109113
Autor:
Traub, J. F.
Publikováno v:
Physics Today, May, 1999, 39-43
Although the Turing-machine model of computation is widely used in computer science it is fundamentally inadequate as a foundation for the theory of modern scientific computation. The real-number model is described as an alternative. Physicists often
Externí odkaz:
http://arxiv.org/abs/physics/0106045
Autor:
Papageorgiou, A., Traub, J. F.
Publikováno v:
Computers in Physics, Nov/Dec, 1997, 574-578
In a recent paper Keister proposed two quadrature rules as alternatives to Monte Carlo for certain multidimensional integrals and reported his test results. In earlier work we had shown that the quasi-Monte Carlo method with generalized Faure points
Externí odkaz:
http://arxiv.org/abs/physics/0011053
Publikováno v:
Econometrica, 2002 Jan 01. 70(1), 285-329.
Externí odkaz:
https://www.jstor.org/stable/2692170
Autor:
Traub, J. F., Woźniakowski, Henryk
Publikováno v:
Bull. Amer. Math. Soc. (N.S.) 26 (1992) 29-52
The authors discuss information-based complexity theory, which is a model of finite-precision computations with real numbers, and its applications to numerical analysis.
Comment: 24 pages. Abstract added in migration.
Comment: 24 pages. Abstract added in migration.
Externí odkaz:
http://arxiv.org/abs/math/9201269
Publikováno v:
Mathematics of Computation, 2013 Oct 01. 82(284), 2293-2304.
Externí odkaz:
https://www.jstor.org/stable/42002741
Chairman: Joseph F. Traub.
Publikováno v:
SIAM Journal on Numerical Analysis, 1978 Jun 01. 15(3), 523-533.
Externí odkaz:
https://www.jstor.org/stable/2156582