- 收听数
- 0
- 性别
- 保密
- 听众数
- 3
- 最后登录
- 2017-12-31
- QQ
 - UID
- 2761
- 阅读权限
- 30
- 帖子
- 634
- 精华
- 0
- 在线时间
- 559 小时
- 注册时间
- 2013-1-24
 
- 科研币
- 10
- 速递币
- 4975
- 娱乐币
- 1267
- 文献值
- 107
- 资源值
- 53
- 贡献值
- 0
|
速递书局
| 封面: |
 |
| 题名: |
Algorithms for Computer Algebra |
| 作者: |
Keith O. Geddes, Stephen R. Czapor, George Labahn |
| 出版社: |
Springer |
| 出版日期: |
1992 |
| ISBN: |
0792392590 |
| 附属页: |
齐全 |
| 书签: |
有 |
| 格式: |
清晰PDF |
| 内容简介: |
Algorithms for Computer Algebra is the first comprehensive textbook to be published on the topic of computational symbolic mathematics. The book first develops the foundational material from modern algebra that is required for subsequent topics. It then presents a thorough development of modern computational algorithms for such problems as multivariate polynomial arithmetic and greatest common divisor calculations, factorization of multivariate polynomials, symbolic solution of linear and polynomial systems of equations, and analytic integration of elementary functions. Numerous examples are integrated into the text as an aid to understanding the mathematical development. The algorithms developed for each topic are presented in a Pascal-like computer language. An extensive set of exercises is presented at the end of each chapter. Algorithms for Computer Algebra is suitable for use as a textbook for a course on algebraic algorithms at the third-year, fourth-year, or graduate level. Although the mathematical development uses concepts from modern algebra, the book is self-contained in the sense that a one-term undergraduate course introducing students to rings and fields is the only prerequisite assumed. The book also serves well as a supplementary textbook for a traditional modern algebra course, by presenting concrete applications to motivate the understanding of the theory of rings and fields. |
| 求助帖链接: |
- |
本帖子中包含更多资源
您需要 登录 才可以下载或查看，没有帐号？快速注册
-
总评分: 速递币 + 40
查看全部评分
|
发表于 2013-3-5 19:56:01
淘帖
收藏
顶
踩
