1 / 390
文档名称:

Maple V Programming Guide-[3rd ed ]-[M B Monagan, K O Geddes, K M Heal, G Labahn, S M Vorkoetter (auth )].pdf

格式:pdf   大小:8,349KB   页数:390页
下载后只包含 1 个 PDF 格式的文档,没有任何的图纸或源代码,查看文件列表

如果您已付费下载过本站文档,您可以点这里二次下载

Maple V Programming Guide-[3rd ed ]-[M B Monagan, K O Geddes, K M Heal, G Labahn, S M Vorkoetter (auth )].pdf

上传人:联系 2017/7/1 文件大小:8.15 MB

下载得到文件列表

Maple V Programming Guide-[3rd ed ]-[M B Monagan, K O Geddes, K M Heal, G Labahn, S M Vorkoetter (auth )].pdf

相关文档

文档介绍

文档介绍:Maple V
Programming Guide
Springer
New York
Berlin
Heidelberg
Barcelona
Budapest
Hong Kong
London
Milan
Paris
Santa Clara
Singapore
Tokyo
Maple V
Programming Guide
M. B. Monagan K. o. Geddes K. M. Heal
G. Labahn S. M. Vorkoetter
With the Assistance ofJ. S. Devitt, M. L. Hansen,
D. Redfern, K. M. Rickard
Springer
Waterloo Maple Inc.
450 Phillip St.
Waterloo, ON N2L 5J2
Canada
Maple and Maple V are registered trademarks of Waterloo Maple Inc.
Printed on acid-free paper.
© 1998, 1996 Waterloo Maple Inc.
All rights reserved. This work may not be translated or copied in whole or in part without
the written permission of the copyright holder, except for brief excerpts in connection with
reviews or scholarly analysis. Use in connection with any form of information storage and
retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology
now known or hereafter developed is forbidden.
The use of general descriptive names, trade names, trademarks, etc., in this publication,
even if the former are not especially identified, is not to be taken as a sign that such names,
as understood by the Trade Marks and Merchandise Marks Act, may accordingly be used
freely by anyone.
Camera-ready copy prepared using Springer-Verlag's TEX macros.
987654321
ISBN-13: 978-0-387-98398-1 e-ISBN-13: 978-1-4612-2214-9
DOl: -1-4612-2214-9
Contents
1. Introduction 1
Getting Started 2
Locals and Globals 6
Inputs, Parameters, Arguments 8
Basic Programming Constructs 10
The Assignment Statement 10
The for Loop 12
The Conditional Statement 13
The while Loop 18
Modularization 19
Recursive Procedures 20
Exercise 23
Basic Data Structures 23
Exercise 24
Exercise 26
A MEMBER Procedure 26
Exercise 27
Binary Search 27
Exercises 29
Plotting the Roots of a Polynomial 29
with Formulae 31
The Height of a Polynomial 32
Exercise 34
The Chebyshev Polynomials, Tn (x