![]() Numerical approximation of a function (Section 6.9): Automatic integration through evalf Taylor series computation function definition through unapply rational function approximation with convert (., ratpoly) Chebyshev polynomials, Chebyshev approximation with chebyshev. The 3 n + 1 conjecture (Section 6.8): Number theory large integers type checking with structured types selection of a result through op integer quotients and remainders (iquo) definition of a recursive function through proc and through assignment. ![]() Primitive trinomials (Section 6.7): Modular integer and polynomial arithmetic factorization of integers and polynomials (ifactor and factor) factorization over finite fields iterated computation using for-in-while. Stock market computation (Section 6.6): Linear algebra with linalg matrices eigenvalues and eigenvectors characteristic matrices and null spaces. Zeros of Bessel functions (Section 6.5): Name aliasing constrained root-finding with fsolve plots of several functions formatted output of a table. The critical length of a rod (Section 6.4): Differential equations solved through dsolve name aliasing substitution of identities one-sided limits two-dimensional plotting. The Maxwell gas velocity formula (Section 6.3): Finding a maximum of a function through dif f and solve simplification of algebraic expressions with simplify. Here’s a list of the examples and the Maple techniques they illustrate:īalancing chemical reactions (Section 6.2): Equation solving with isolve back substitution of a solution into the defining equations. This chapter shows Maple in action on a collection of problems drawn from engineering, mathematics, and the physical sciences. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |