Results 271 to 280 of about 94,123 (313)

A polynomial decomposition algorithm

Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976
This paper presents an efficient, effective algorithm for decomposing a polynomial f(x) into an irreducible representation of the form f(x) = g1(g2( ... gn(x) ... )). This decomposition is used as an aid in solving high degree metacyclic equations in radicals and preconditioning polynomials for evaluation.
David R. Barton, Richard E. Zippel
openaire   +1 more source

Extended polynomial algorithms

Proceedings of the annual conference on - ACM'73, 1973
It is shown that standard polynomial algorithms may be applied to a much wider class of functions by making a straightforward generalization of the concept of exponent. The implementation of a computer algebra system from a standard set of polynomial programs which allows for any coefficient or exponent structure is also discussed.
Anthony C. Hearn, Rüdiger G. K. Loos
openaire   +1 more source

Matrix recursive polynomial interpolation algorithm: An algorithm for computing the interpolation polynomials

Journal of Computational and Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abderrahim Messaoudi, Rachid Sadaka, Hassane Sadok   +2 more
openaire   +2 more sources

Algorithms for symmetrical polynomials

Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976
A special representation for symmetrical polynomials is introduced. Algorithms for the ring operations and for several versions of Gauss' method to express an arbitrary symmetrical polynomial by the elementary symmetrical functions are given and analyzed. Empirical observations show that the representation which is the most economical in terms of space
openaire   +1 more source

A Convergent Algorithm for Solving Polynomial Algorithms

Journal of the ACM, 1967
The method of steepest descent is applied in a convergent procedure to determine the zeros of polynomials having either real or complex coefficients. By expressing the polynomials in terms of the Siljak functions, the methods are readily programmed on a digital computer.
openaire   +1 more source

A polynomial algorithm for partitioning problems

ACM Transactions on Embedded Computing Systems, 2010
This article takes a theoretical approach to focus on the algorithmic properties of hardware/software partitioning. It proposes a method with polynomial complexity to find the global optimum of an NP-hard model partitioning problem for 75% of occurrences under some practical conditions.
Seyed-Abdoreza Tahaee, Amir-Hossein Jahangir   +1 more
openaire   +1 more source

New Algorithms for Polynomial Multiplication

SIAM Journal on Computing, 1979
Exploiting the structure of the 2-dimensional sorting problem associated with the polynomial product has been the strategy in the design of certain algorithms which are faster for a large class of problems than those found in the literature. First a parallel is drawn between GEN–MULT and Horowitz’s SORT–MULT algorithm [A sorting algorithm for ...
openaire   +1 more source

An algorithm on quasi-ordinary polynomials

1989
Let K be a field of characteristic O, and let R denote K[X] or K[[X]]. It is well known that the roots of a polynomial FisinR[Z] are fractional powers series in K[[X 1d/]], where Kmacr is a finite extension of K and disin N, and they can be obtained by applying the Newton Puiseux algorithm.
Maria Emilia Alonso, I. Luengo-Velasco, Mario Raimondo   +2 more
openaire   +1 more source