31 resultados para Quadratic Algebras

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

60.00% 60.00%

Publicador:

Resumo:

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

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:

This project was partially supported by RFBR, grants 99-01-00233, 98-01-01020 and 00-15-96128.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

∗The first author was partially supported by MURST of Italy; the second author was par- tially supported by RFFI grant 99-01-00233.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

* The authors thank the “Swiss National Science Foundation” for its support.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

∗ The work was supported by the National Fund “Scientific researches” and by the Ministry of Education and Science in Bulgaria under contract MM 70/91.

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:

* Dedicated to the memory of Prof. N. Obreshkoff

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:

The isomorphism problem of arbitrary algebraic structures plays always a central role in the study of a given algebraic object. In this paper we give the first investigations and also some basic results on the isomorphism problem of commutative group algebras in Bulgaria.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Let a commutative ring R be a direct product of indecomposable rings with identity and let G be a finite abelian p-group. In the present paper we give a complete system of invariants of the group algebra RG of G over R when p is an invertible element in R. These investigations extend some classical results of Berman (1953 and 1958), Sehgal (1970) and Karpilovsky (1984) as well as a result of Mollov (1986).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we give the first investigations and also some basic results on the unit groups of commutative group algebras in Bulgaria. These investigations continue some classical results. Namely, it is supposed that the cardinality of the starting group is arbitrary.

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We consider the problems of finding two optimal triangulations of a convex polygon: MaxMin area and MinMax area. These are the triangulations that maximize the area of the smallest area triangle in a triangulation, and respectively minimize the area of the largest area triangle in a triangulation, over all possible triangulations. The problem was originally solved by Klincsek by dynamic programming in cubic time [2]. Later, Keil and Vassilev devised an algorithm that runs in O(n^2 log n) time [1]. In this paper we describe new geometric findings on the structure of MaxMin and MinMax Area triangulations of convex polygons in two dimensions and their algorithmic implications. We improve the algorithm’s running time to quadratic for large classes of convex polygons. We also present experimental results on MaxMin area triangulation.