Search Results - subject:"Computer Algebra"

A CAS aid to the elaboration of the expert system supporting the managing the monolitic construction

Marlewski, Adam; Hajdasz, Magdalena - In: Mathematics and Computers in Simulation (MATCOM) 51 (2000) 5, pp. 483-488

a crane (loading capacity, horizontal and vertical ranges). In this paper a non-standard use of a CAS (computer algebra …

Persistent link: https://www.econbiz.de/10010750136

Social structures and speeding trucks

Faia, Michael A. - In: Mathematics and Computers in Simulation (MATCOM) 51 (2000) 5, pp. 529-545

This study develops a Maple worksheet for experimenting with truck transportation, with incentives for speeding, and with the efficacy of various ways of controlling speeding. The model suggests that the total cost function, operating as a feedback mechanism, may influence a truck driver’s...

Persistent link: https://www.econbiz.de/10010870190

A symbolic approximation of periodic solutions of the Henon–Heiles system by the normal form method

Edneral, Victor F. - In: Mathematics and Computers in Simulation (MATCOM) 45 (1998) 5, pp. 445-463

This article describes the computer algebra application of the normal form method for building analytic approximations …

Persistent link: https://www.econbiz.de/10010749164

Computer algebra and field theories

Calmet, J; Seiler, W.M - In: Mathematics and Computers in Simulation (MATCOM) 45 (1998) 1, pp. 33-37

We discuss some non-standard applications of computer algebra in field theories based on the formal theory of …

Persistent link: https://www.econbiz.de/10010750191

Minimal involutive bases

Gerdt, Vladimir P.; Blinkov, Yuri A. - In: Mathematics and Computers in Simulation (MATCOM) 45 (1998) 5, pp. 543-560

In this paper, we present an algorithm for construction of minimal involutive polynomial bases which are Gröbner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division which leads to partition of variables into multiplicative...

Persistent link: https://www.econbiz.de/10011050267

Involutive bases of polynomial ideals

Gerdt, Vladimir P.; Blinkov, Yuri A. - In: Mathematics and Computers in Simulation (MATCOM) 45 (1998) 5, pp. 519-541

In this paper we consider an algorithmic technique more general than that proposed by Zharkov and Blinkov for the involutive analysis of polynomial ideals. It is based on a new concept of involutive monomial division which is defined for a monomial set. Such a division provides for each monomial...

Persistent link: https://www.econbiz.de/10011050722

Algebraic computation in geometry

Winkler, Franz - In: Mathematics and Computers in Simulation (MATCOM) 42 (1996) 4, pp. 529-537

Computations with algebraic curves and surfaces are very well suited for being treated with computer algebra. Many … aspects of computer algebra need to be combined for successfully solving problems in this area, e.g. computations with … branches. We will describe the application of computer algebra to problems arising in algebraic geometry. The program system …

Persistent link: https://www.econbiz.de/10010749514

Sketches and computations over fields

Duval, Dominique; Reynaud, Jean-Claude - In: Mathematics and Computers in Simulation (MATCOM) 42 (1996) 4, pp. 363-373

The goal of this short paper is to describe one possible use of sketches in computer algebra. We show that sketches are …

Persistent link: https://www.econbiz.de/10010870008

Involution approach to investigating polynomial systems

Zharkov, A. Yu.; Blinkov, Yu.A. - In: Mathematics and Computers in Simulation (MATCOM) 42 (1996) 4, pp. 323-332

An involution approach to solving systems of polynomial equations is proposed. A notion of involutive polynomial system is introduced and an algorithm for its construction is presented. The relation between involutive systems and Gröbner bases is clarified, and some advantages of the involution...

Persistent link: https://www.econbiz.de/10011050182

Examples of using dynamic constructible closure

Gómez-Díaz, Teresa - In: Mathematics and Computers in Simulation (MATCOM) 42 (1996) 4, pp. 375-383

We present here some examples of using the “Dynamic Constructible Closure” program, which performs automatic case distinction in computations involving parameters over a base field K. This program is an application of the “Dynamic Evaluation” principle, which generalizes traditional...

Persistent link: https://www.econbiz.de/10011050471