نتایج جستجو برای: algebraic resolution

تعداد نتایج: 339011  

Journal: :J. Symb. Comput. 2010
Meera Sitharam Jörg Peters Yong Zhou

Graphs of pairwise incidences between collections of rigid bodies occur in many practical applications and give rise to large algebraic systems for which all solutions have to be found. Such pairwise incidences have explicit, simple and rational parametrizations that, in principle, allow us to partially resolve these systems and arrive at a reduced, parametrized system in terms of the rational ...

Journal: :journal of linear and topological algebra (jlta) 2015
f mirzaee

the principal aim of this paper is to serve the numerical solution of an integral-algebraic equation (iae) by using the bernoulli polynomials and the residual correction method. after implementation of our scheme, the main problem would be transformed into a system of algebraic equations such that its solutions are the unknown bernoulli coefficients. thismethod gives an analytic solution when t...

Journal: :journal of sciences, islamic republic of iran 2011
b davaz

the concept of algebraic hyperstructures introduced by marty as a generalization of ordinary algebraic structures. in an ordinary algebraic structure, the composition of two elements is an element, while in an algebraic hyperstructure, the composition of two elements is a set. the concept of ?-semihyperrings is a generalization of semirings, a generalization of semihyper rings and a generalizat...

Journal: :Crelle's Journal 2021

Abstract Using formal-local methods, we prove that a separated and normal tame Artin surface has the resolution property. By proving stacks can be rigidified, ultimately reduce our analysis to establishing existence of Azumaya algebras. Our construction passes through case gerbes, curves, algebraic space surfaces, each which establish independently.

1999
Sumio Watanabe

Hierarchical learning machines are non-regular and non-identifiable statistical models, whose true parameter sets are analytic sets with singularities. Using algebraic analysis, we rigorously prove that the stochastic complexity of a non-identifiable learning machine is asymptotically equal to λ1 log n − (m1 − 1) log logn + const., where n is the number of training samples. Moreover we show tha...

2008
Béchir Ktari François Lajeunesse-Robert Claude Bolduc

This work aims to investigate conditions under which program analysis can be viewed as algebraically solving equations involving terms of subclasses of Kleene algebras and variables. In this paper, we show how to solve a kind of linear equations in which variables appear only on one side of the equality sign, over a *-continuous action lattice. Furthermore, based on the method developed for sol...

The paper is devoted to concern a relationship between rough set theory and universal algebra. Notions of lower and upper rough approximations on an algebraic structure induced by an ideal are introduced and some of their properties are studied. Also, notions of rough subalgebras and rough ideals with respect to an ideal of an algebraic structure, which is an extended notion of subalgebras and ...

Journal: :Theoretical Computer Science 1992

اسلامی‌کلانتری, محمد, دهقان‌نژاد, اکبر, موسوی‌نژاد, سیدمحمد,

Algebraic hyperstructures theory is a natural extension of the classical‎ ‎algebraic structures‎. Because of importance and new viewpoints in this theory, we try to apply this theory to the elementary particle physics and nuclear physics presenting the definitions and the concepts of the algebraic hyperstructures. In this work we intend to use this new branch of mathematics to describe the inte...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید