Titlebook: Computer Algebra in Scientific Computing; CASC 2000 Victor G. Ganzha,Ernst W. Mayr,Evgenii V. Vorozhts Conference proceedings 2000 Springer

储备

On the Relation between Pommaret and Janet Bases, then the latter is a minimal Janet basis. An improved version of the related algorithm for computation of Janet bases, initially designed by Zharkov, is described. For an ideal with a finite Pommaret basis, the algorithm computes this basis. Otherwise, the algorithm computes a Janet basis which nee

缩短

An (Asymptotic) Error Bound for the Evaluation of Polynomials at Roots,≤ .. We show that .is an (asymptotic) error bound for the evaluation of an arbitrary but fixed multivariate polynomial . ∈ ℂ[..,...,..] at the .-tuple (α.,...,α.) instead of the .-tuple of the roots (..,...,..),and that for some polynomials the (asymptotic) error bound is Ω .. Analysis of algorithms

开花期女

,Three Remarks on Comprehensive Gröbner and SAGBI Bases,ials, a general remark about CGB for parameterized binomial ideals, and it introduces the concept of comprehensive SAGBI bases together with a first application in invariant theory. .. Comprehensive Gröbner bases, parameterized binomial ideals, comprehensive SAGBI bases, algorithmic invariant theory

兽群

违反

Symbolic Algorithms of Algebraic Perturbation Theory for a Hydrogen Atom: the Stark Effect,rm electric fields. Algebraic perturbation theory schemes are built up using the irreducible representations of the dynamical symmetry algebras .(4,2) and .(3,2), which are connected by the tilting transformations with ‘wave functions of the 3-D and 2-D hydrogen atoms. Such a construction is based o

不透气

CADECOM: Computer Algebra software for functional DECOMposition,decom deals with are multivariate rational functions over any computable field, and the key tool are the functional decomposition algorithms. The functional decomposition problem has many applications in computer science, engineering (CAGD), pure mathematics or robotics. We motivate the interest of

激怒某人

泥瓦匠

Computing the Cylindrical Algebraic Decomposition Adapted to a Set of Equalities, to present two approaches allowing, in some cases, to simplify the projection phase in the Cylindrical Algebraic Decomposition algorithm when some of the involved polynomials are prescribed to have a particular sign behaviour.

lactic

On a Description of Irreducible Component in the Set of Nilpotent Leibniz Algebras Containing the Ation of a zero-filiform algebra is quite natural. We also investigate the complex non-Lie filiform Leibniz algebras. In particular, we give some equivalent conditions of filiformity of Leibniz algebras and describe complex Leibniz algebras, which were graded in natural way.

不知疲倦