Algorithm 7. Evaluation of a trigonometric polynomial
Lucja Sobich (1970)
Applicationes Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “An algorithm to calculate the kernel of certain polynomial ring homomorphisms.”
Algorithm 7. Evaluation of a trigonometric polynomial
Algorithm 32. Construction of polynomial values orthogonal on given set of one-dimensional variable
Anna Bartkowiak (1974)
Applicationes Mathematicae
Similarity:
Improvements on the Cantor-Zassenhaus factorization algorithm
Michele Elia, Davide Schipani (2015)
Mathematica Bohemica
Similarity:
The paper presents a careful analysis of the Cantor-Zassenhaus polynomial factorization algorithm, thus obtaining tight bounds on the performances, and proposing useful improvements. In particular, a new simplified version of this algorithm is described, which entails a lower computational cost. The key point is to use linear test polynomials, which not only reduce the computational burden, but can also provide good estimates and deterministic bounds of the number of operations needed...
An algorithm to compute the kernel of a derivation up to a certain degree
Stefan Maubach (2001)
Annales Polonici Mathematici
Similarity:
An algorithm is described which computes generators of the kernel of derivations on k[X₁,...,Xₙ] up to a previously given bound. For w-homogeneous derivations it is shown that if the algorithm computes a generating set for the kernel then this set is minimal.
Integral minimalisations improvement for Murphy's polynomial selection algorithm.
Jedlička, Přemysl (2010)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Algorithm 10. Determination of the best polynomial in the sense of uniform approximation by the second algorithm of Remez
S. Paszkowski (1971)
Applicationes Mathematicae
Similarity:
An algebraic approach to fix points of GOST-algorithm
Marcel Zanechal (2001)
Mathematica Slovaca
Similarity:
The F4-algorithm for Euclidean rings
Afshan Sadiq (2010)
Open Mathematics
Similarity:
In this short note, we extend Faugére’s F4-algorithm for computing Gröbner bases to polynomial rings with coefficients in an Euclidean ring. Instead of successively reducing single S-polynomials as in Buchberger’s algorithm, the F4-algorithm is based on the simultaneous reduction of several polynomials.