Algorithm 32. Construction of polynomial values orthogonal on given set of one-dimensional variable

Anna Bartkowiak

Displaying similar documents to “Algorithm 32. Construction of polynomial values orthogonal on given set of one-dimensional variable”

Algorithm 7. Evaluation of a trigonometric polynomial

Lucja Sobich (1970)

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 calculate the kernel of certain polynomial ring homomorphisms.

Di Biase, Fausto, Urbanke, Rüdiger (1995)

Experimental Mathematics

Similarity:

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:

Extending the MAX Algorithm for Maximum Independent Set

Ngoc C. Lê, Christoph Brause, Ingo Schiermeyer (2015)

Discussiones Mathematicae Graph Theory

Similarity:

The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G. We present a set of forbidden induced subgraphs such that Algorithm MAX always results in finding a maximum independent set of G. We also describe two modifications of Algorithm MAX and sets of forbidden induced subgraphs for the new algorithms.