Approximations with rational polynomials

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Factoring Polynomials with Rational Coefficients

In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial f e Q[X] in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q[X]. It is well known that this is equivalent to factoring primitive polynomials feZ[X] into irreducible factors in Z[X]. Here we call f ~ Z[X] primitive if the greatest comm...

متن کامل

Conditional Density Approximations with Mixtures of Polynomials

Mixtures of polynomials (MoPs) are a non-parametric density estimation technique especially designed for hybrid Bayesian networks with continuous and discrete variables. Algorithms to learn oneand multi-dimensional (marginal) MoPs from data have recently been proposed. In this paper we introduce two methods for learning MoP approximations of conditional densities from data. Both approaches are ...

متن کامل

Rational invariant subspace approximations with applications

Subspace methods such as MUSIC, Minimum Norm, and ESPRIT have gained considerable attention due to their superior performance in sinusoidal and direction-of-arrival (DOA) estimation, but they are also known to be of high computational cost. In this paper, new fast algorithms for approximating signal and noise subspaces and that do not require exact eigendecomposition are presented. These algori...

متن کامل

Rational approximations and quantum algorithms with postselection

We study the close connection between rational functions that approximate a given Boolean function, and quantum algorithms that compute the same function using postselection. We show that the minimal degree of the former equals (up to a factor of 2) the minimal query complexity of the latter. We give optimal (up to constant factors) quantum algorithms with postselection for the Majority functio...

متن کامل

Rational Approximations to n

Using an IBM 1130 computer, we have generated the first 20,000 partial quotients in the ordinary continued-fraction representation of x.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quarterly of Applied Mathematics

سال: 1968

ISSN: 0033-569X,1552-4485

DOI: 10.1090/qam/226819