A Rational Function Decomposition Algorithm by Near-separated Polynomials
نویسندگان
چکیده
منابع مشابه
Decomposition of Differential Polynomials with Rational Function Coefficients
In this paper, we present an algorithm to decompose nonlinear differential polynomials in one variable and with rational functions as coefficients. Besides arithmetic operations, the algorithm needs decomposition of LODEs, decomposition of multi-variable polynomials, factorization of multi-variable polynomials and solution of linear equation systems.
متن کاملOn Multivariate Rational Function Decomposition
If K is a field, and g, h ∈ K(x) are rational functions of degree greater than one, then f = g ◦ h = g(h) is their (functional) composition, (g, h) is a (functional) decomposition of f , and f is a decomposable rational function. The univariate rational functional decomposition problem can be stated as follows: given f ∈ K(x), determine whether there exists a decomposition (g, h) of f with g an...
متن کاملOn Decomposition of Tame Polynomials and Rational Functions
In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial, proving it for arbitrary tame polynomials, and considering the case of rational functions.
متن کاملA Fast Algorithm for Rational Interpolation Via Orthogonal Polynomials
A new algorithm for rational interpolation is proposed. Given the data set, the algorithm generates a set of orthogonal polynomials by the classical threeterm recurrence relation and then uses Newton interpolation to find the numerator and the denominator polynomials of the rational interpolating function. The number of arithmetic operations of the algorithm to find a particular rational interp...
متن کاملA Block Decomposition Algorithm for Computing Rook Polynomials
Rook polynomials are a powerful tool in the theory of restricted permutations. It is known that the rook polynomial of any board can be computed recursively, using a cell decomposition technique of Riordan. [13] In this paper, we give a new decomposition theorem, which yields a more efficient algorithm for computing the rook polynomial. We show that, in the worst case, this block decomposition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1995
ISSN: 0747-7171
DOI: 10.1006/jsco.1995.1030