On the complexities of multipoint evaluation and interpolation
نویسندگان
چکیده
We compare the complexities of multipoint polynomial evaluation and interpolation. We show that, over a field of characteristic zero, both questions have equivalent complexities, up to a constant number of polynomial multiplications.
منابع مشابه
Fast Approximate Polynomial Multipoint Evaluation and Applications
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial F ∈ C[x] of degree n at n complex-valued points can be done with Õ(n) exact field operations in C, where Õ(·) means that we omit polylogarithmic factors. We complement this result by an analysis of approximate multipoint evaluation of F to a precision of L bits after the binary po...
متن کاملAn Interpolation Approximation for the GI/G/1 Queue Based on Multipoint Padé Approximation
The performance evaluation of many complex manufacturing, communication and computer systems has been made possible by modeling them as queueing systems. Many approximations used in queueing theory have been drawn from the behavior of queues in light and heavy tra c conditions. In this paper, we propose a new approximation technique, which combines the light and heavy tra c characteristics. Thi...
متن کاملMaximal order of multipoint iterations using n evaluations
This paper deals with multipoint iterations without memory for the solution of the nonlinear scalar equation (m) f (x) = 0, m ^ 0. Let P n( ) be the maximal order of iterations which use n evaluations of the function or its derivatives per step. We prove the Kung and Traub conjecture p (0) = 2 n ^ for Hermitian information. We show p (m+l)^p (m) and conjecture P n( ) = 2 . The problem of the ma...
متن کاملA Family of Optimal Multipoint Root-Finding Methods Based on the Interpolating Polynomials
A family of simple derivative-free multipoint iterative methods, based on the interpolating polynomials, for solving nonlinear equations is presented. It is shown that the presented n-point iterative method has the convergence order 2n−1 with n function evaluations per iteration. It is an optimal iterative method in the sense of the Kung-Traub’s conjecture. Numerical examples are included to su...
متن کاملFast polynomial factorization, modular composition, and multipoint evaluation of multivariate polynomials in small characteristic
We obtain randomized algorithms for factoring degree n univariate polynomials over Fq that use O(n + n log q) field operations, when the characteristic is at most n. When log q < n, this is asymptotically faster than the best previous algorithms (von zur Gathen & Shoup (1992) and Kaltofen & Shoup (1998)); for log q ≥ n, it matches the asymptotic running time of the best known algorithms. The im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 329 شماره
صفحات -
تاریخ انتشار 2004