19 resultados para Almost always algebra
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
Information extraction or knowledge discovery from large data sets should be linked to data aggregation process. Data aggregation process can result in a new data representation with decreased number of objects of a given set. A deterministic approach to separable data aggregation means a lesser number of objects without mixing of objects from different categories. A statistical approach is less restrictive and allows for almost separable data aggregation with a low level of mixing of objects from different categories. Layers of formal neurons can be designed for the purpose of data aggregation both in the case of deterministic and statistical approach. The proposed designing method is based on minimization of the of the convex and piecewise linear (CPL) criterion functions.
Resumo:
The paper has been presented at the 12th International Conference on Applications of Computer Algebra, Varna, Bulgaria, June, 2006
Resumo:
A boundary-value problems for almost nonlinear singularly perturbed systems of ordinary differential equations are considered. An asymptotic solution is constructed under some assumption and using boundary functions and generalized inverse matrix and projectors.
Resumo:
The theorem of Czerniakiewicz and Makar-Limanov, that all the automorphisms of a free algebra of rank two are tame is proved here by showing that the group of these automorphisms is the free product of two groups (amalgamating their intersection), the group of all affine automorphisms and the group of all triangular automorphisms. The method consists in finding a bipolar structure. As a consequence every finite subgroup of automorphisms (in characteristic zero) is shown to be conjugate to a group of linear automorphisms.
Resumo:
Mathematics Subject Classification: Primary 47A60, 47D06.
Resumo:
Certain curvature properties and scalar invariants of the mani- folds belonging to one of the main classes almost contact manifolds with Norden metric are considered. An example illustrating the obtained results is given and studied.
Resumo:
Families of linear connections are constructed on almost con- tact manifolds with Norden metric. An analogous connection to the symmetric Yano connection is obtained on a normal almost contact manifold with Norden metric and closed structural 1-form. The curvature properties of this connec- tion are studied on two basic classes of normal almost contact manifolds with Norden metric.
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.
Resumo:
We consider a 3-dimensional Riemannian manifold V with a metric g and an a±nor structure q. The local coordinates of these tensors are circulant matrices. In V we define an almost conformal transformation. Using that definition we construct an infinite series of circulant metrics which are successively almost conformaly related. In this case we get some properties.
Resumo:
This article presents the principal results of the doctoral thesis “Direct Operational Methods in the Environment of a Computer Algebra System” by Margarita Spiridonova (Institute of mathematics and Informatics, BAS), successfully defended before the Specialised Academic Council for Informatics and Mathematical Modelling on 23 March, 2009.
Resumo:
We present quasi-Monte Carlo analogs of Monte Carlo methods for some linear algebra problems: solving systems of linear equations, computing extreme eigenvalues, and matrix inversion. Reformulating the problems as solving integral equations with a special kernels and domains permits us to analyze the quasi-Monte Carlo methods with bounds from numerical integration. Standard Monte Carlo methods for integration provide a convergence rate of O(N^(−1/2)) using N samples. Quasi-Monte Carlo methods use quasirandom sequences with the resulting convergence rate for numerical integration as good as O((logN)^k)N^(−1)). We have shown theoretically and through numerical tests that the use of quasirandom sequences improves both the magnitude of the error and the convergence rate of the considered Monte Carlo methods. We also analyze the complexity of considered quasi-Monte Carlo algorithms and compare them to the complexity of the analogous Monte Carlo and deterministic algorithms.
Resumo:
2000 Mathematics Subject Classification: 17A50, 05C05.
Resumo:
Марта Теофилова - Конструиран е пример на четиримерно специално комплексно многообразие с норденова метрика и постоянна холоморфна секционна кривина чрез двупара-метрично семейство от разрешими алгебри на Ли. Изследвани са кривинните свойства на полученото многообразие. Дадени са необходими и достатъчни усло-вия за разглежданото многообразие да бъде изотропно келерово.
Resumo:
Л. И. Каранджулов, Н. Д. Сиракова - В работата се прилага методът на Поанкаре за решаване на почти регулярни нелинейни гранични задачи при общи гранични условия. Предполага се, че диференциалната система съдържа сингулярна функция по отношение на малкия параметър. При определени условия се доказва асимптотичност на решението на поставената задача.
Resumo:
2000 Mathematics Subject Classification: 60J27.