Titlebook: Introduction to Maple; André Heck Textbook 2003Latest edition Springer Science+Business Media New York 2003 Approximation.Maple.algebra.co

節(jié)省

Variables and Names,le no need to declare the types of variables. Maple figures out the type of an expression on the basis of how it is internally represented and how it is used. In this chapter, we shall have a look at the basic data types. Moreover, we shall describe the way symbolic expressions are normally evaluated, viz., by full evaluation.

sacrum

Bridle

Getting Around with Maple,ces, how to trace computations, and how to get user-information about chosen techniques or algorithms. Formatted I/O and code generation are examples of interaction between Maple and programming or typeset-ting languages. Moreover, the setup of the Maple library (standard library, packages, and share library of users’ contributions) is explained.

Fibrin

Manipulation of Polynomials and Rational Expressions,s that are defined over the rational numbers as well as manipulation of expressions that are defined over other domains, like finite fields, algebraic numbers, and algebraic function fields. Furthermore, we shall give a short, theoretical introduction to canonical and normal form simplification.

FRAUD

The Assume Facility, model on which the facility is based. Throughout this chapter we shall assume that a variable for which assumptions have been made is distinguished from ordinary variables by a trailing tilde in its name. This can be accomplished by the following interface setting.

嘮叨

礦石

Semblance

EVICT

Variables and Names, chapter, we shall discuss what are valid names in Maple, how to assign a value to a name, how to unassign a variable, how to protect or unprotect a variable, and how to associate an attribute or a property to a variable. Unlike in programming languages such as FORTRAN, Algol, and C, there is in Map

使尷尬

Getting Around with Maple,rompt, width of printout, labeling, etc.), how to edit inputs, how to read and write files, how to get more information about usage of computer resources, how to trace computations, and how to get user-information about chosen techniques or algorithms. Formatted I/O and code generation are examples