An algorithm for detecting “linear” solutions of nonlinear polynomial differential equations.

Kotsios, Stelios

The search session has expired. Please query the service again.

Displaying similar documents to “An algorithm for detecting “linear” solutions of nonlinear polynomial differential equations.”

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:

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...

A polynomial reduction algorithm

Henri Cohen, Francisco Diaz Y Diaz (1991)

Journal de théorie des nombres de Bordeaux

Similarity:

The algorithm described in this paper is a practical approach to the problem of giving, for each number field $K$ a polynomial, as canonical as possible, a root of which is a primitive element of the extension $K / ℚ$ . Our algorithm uses the $L L L$ algorithm to find a basis of minimal vectors for the lattice of $ℝ^{n}$ determined by the integers of $K$ under the canonical map.

2-D polynomial equations

Michael Šebek (1983)

Kybernetika

Similarity:

Complexity bound of absolute factoring of parametric polynomials.

Ayad, A. (2004)

Zapiski Nauchnykh Seminarov POMI

Similarity:

Subresultant Polynomial Remainder Sequences Obtained by Polynomial Divisions in Q[x] or in Z[x]

Akritas, Alkiviadis G., Malaschonok, Gennadi I., Vigklas, Panagiotis S. (2016)

Serdica Journal of Computing

Similarity:

In this paper we present two new methods for computing the subresultant polynomial remainder sequence (prs) of two polynomials f, g ∈ Z[x]. We are now able to also correctly compute the Euclidean and modified Euclidean prs of f, g by using either of the functions employed by our methods to compute the remainder polynomials. Another innovation is that we are able to obtain subresultant prs’s in Z[x] by employing the function rem(f, g, x) to compute the remainder polynomials in [x]. This...

Degrees of Polynomial Solutions of a Class of Riccati - tipe Differential Equations*.

Mira Bhargava (1964)

Collectanea Mathematica

Similarity:

Selected Chapters from Algebra, II

I. R. Shafarevich (1999)

The Teaching of Mathematics

Similarity: