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

insular

Complexity of Derivatives Generated by Symbolic Differentiation,e the complexity of algorithms for computing derivatives of rational functions. In particular, we deal with the forward mode and the reverse mode of symbolic differentiation. We discuss bounds on the amount of work within the described algorithms in terms of rational operations.

背心

synchronous

visual-cortex

jungle

Shape Optimal Conception of Antenna Arrays,ssible viscous heat-conducting gas. This system has five arbitrary elements. The solution of the problem of finding equivalence transfonpations is presented. The group classification is carried out in some particular cases.

铺子

Subdue

Artur Zaporozhets,Volodymyr Artemchukate size problems. These results show that Maple Vr5 is generally the speediest on our examples. Finally, we formulate some requirements for developing a comprehensive test suite for analyzing the efficiency of CASs.

白杨鱼

Vladislav Kuchanskyy,Volodymyr Tereshchukthis program package by presenting applications on computing roots, simplifying sine-cosine equations, integrating rational functions, computing subfields, computing Gröbner bases and reparametrizing parametric curves. We also include a short overview of the package from the Maple system point of view.

Apraxia

jumble

Artur Zaporozhets,Volodymyr Artemchuk is described. For an ideal with a finite Pommaret basis, the algorithm computes this basis. Otherwise, the algorithm computes a Janet basis which need not be minimal. The obtained results are generalized to linear differential ideals.