Results 251 to 260 of about 2,555,427 (286)

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   +2 more sources

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   +2 more sources

A polynomial-based division algorithm

2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353), 2003
A polynomial-based division algorithm and a corresponding hardware structure are proposed. The proposed algorithm is shown to be competitive to other conventional algorithms like the Newton-Raphson algorithm for up to about 32 bits accuracy. For example, using Newton-Raphson with less than 12 bits accuracy of the initial approximation, requires 33 ...
Robert Hägglund, Per Löwenborg, Mark Vesterbacka   +2 more
openaire   +1 more source

Polynomial algorithms for projection and matching

1993
The main purpose of this paper is to develop polynomial algorithms for the projection and matching operations on conceptual graphs. Since all interesting problems related to these operations are at least NP-complete — we will consider here the exhibition of a solution and counting the solutions — we propose to explore polynomial cases by restricting ...
Marie-Laure Mugnier, Michel Chein
openaire   +2 more sources

Algorithms for polynomials in Bernstein form

Computer Aided Geometric Design, 1988
The aim of this paper is to investigate the aspects of the formulation of geometric modeling algorithms in the Bernstein polynomial basis. Bernstein forms for various basic polynomial procedures required in such algorithms are developed and are found to be of similar complexity to their customary power forms.
Rida T. Farouki, V. T. Rajan
exaly   +3 more sources

Algorithms for adaptive factorization of polynomials

Signal Processing, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Probabilistic algorithms for sparse polynomials

1979
In this paper we have tried to demonstrate how sparse techniques can be used to increase the effectiveness of the modular algorithms of Brown and Collins. These techniques can be used for an extremely wide class of problems and can applied to a number of different algorithms including Hensel's lemma.
openaire   +2 more sources

An algorithm for the multiplication of symmetric polynomials

ACM Transactions on Mathematical Software, 1988
Although the cycle index polynomial for a permutation group can often be easily determined, expansion of the figure counting series in a Po´lya enumeration presents computational difficulties for object sets with higher degrees of symmetry and more than modest size.
openaire   +2 more sources

POLYNOMIALLY BOUNDED (-TIME) ALGORITHM (Polynomial algorithm)

2001
Saul I. Gass, Carl M. Harris
openaire   +1 more source