29 resultados para quadratic polynomial

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

40.00% 40.00%

Publicador:

Resumo:

* Dedicated to the memory of Prof. N. Obreshkoff

Relevância:

30.00% 30.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 81R50, 16W50, 16S36, 16S37.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

ACM Computing Classification System (1998): G.1.1, G.1.2.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

MSC 2010: 30C10, 32A30, 30G35

Relevância:

30.00% 30.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary: 11D09, 11A55, 11C08, 11R11, 11R29; Secondary: 11R65, 11S40; 11R09.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we present F LQ, a quadratic complexity bound on the values of the positive roots of polynomials. This bound is an extension of FirstLambda, the corresponding linear complexity bound and, consequently, it is derived from Theorem 3 below. We have implemented FLQ in the Vincent-Akritas-Strzeboński Continued Fractions method (VAS-CF) for the isolation of real roots of polynomials and compared its behavior with that of the theoretically proven best bound, LM Q. Experimental results indicate that whereas F LQ runs on average faster (or quite faster) than LM Q, nonetheless the quality of the bounds computed by both is about the same; moreover, it was revealed that when VAS-CF is run on our benchmark polynomials using F LQ, LM Q and min(F LQ, LM Q) all three versions run equally well and, hence, it is inconclusive which one should be used in the VAS-CF method.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

∗ Partially supported by INTAS grant 97-1644

Relevância:

20.00% 20.00%

Publicador:

Resumo:

* Partially supported by Universita` di Bari: progetto “Strutture algebriche, geometriche e descrizione degli invarianti ad esse associate”.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

It is shown that the invertible polynomial maps over a finite field Fq , if looked at as bijections Fn,q −→ Fn,q , give all possible bijections in the case q = 2, or q = p^r where p > 2. In the case q = 2^r where r > 1 it is shown that the tame subgroup of the invertible polynomial maps gives only the even bijections, i.e. only half the bijections. As a consequence it is shown that a set S ⊂ Fn,q can be a zero set of a coordinate if and only if #S = q^(n−1).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dubrovin type equations for the N -gap solution of a completely integrable system associated with a polynomial pencil is constructed and then integrated to a system of functional equations. The approach used to derive those results is a generalization of the familiar process of finding the 1-soliton (1-gap) solution by integrating the ODE obtained from the soliton equation via the substitution u = u(x + λt).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We prove that in quadratic perturbations of generic Hamiltonian vector fields with two saddle points and one center there can appear at most two limit cycles. This bound is exact.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Class.: 33C10,33D60,26D15,33D05,33D15,33D90

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Classification: 45G10, 45M99, 47H09

Relevância:

20.00% 20.00%

Publicador:

Resumo:

AMS Subj. Classification: 83C15, 83C35

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This article goes into the development of NURBS models of quadratic curves and surfaces. Curves and surfaces which could be represented by one general equation (one for the curves and one for the surfaces) are addressed. The research examines the curves: ellipse, parabola and hyperbola, the surfaces: ellipsoid, paraboloid, hyperboloid, double hyperboloid, hyperbolic paraboloid and cone, and the cylinders: elliptic, parabolic and hyperbolic. Many real objects which have to be modeled in 3D applications possess specific features. Because of this these geometric objects have been chosen. Using the NURBS models presented here, specialized software modules (plug-ins) have been developed for a 3D graphic system. An analysis of their implementation and the primitives they create has been performed.