| 作者 |
| [美] 吉拉伊·奥克滕（Giray ＆Ouml kten） |
| 丛书名 |
| 计算机科学丛书 |
| 出版社 |
| 机械工业出版社 |
| ISBN |
| 9787111679561 |
| 简要 |
| 简介 |
| 内容简介书籍计算机书籍 本书详细介绍数值分析的理论和方法，并用Julia编程语言给出了算法实现，主要内容包括计算机算术、求根、数值求积和微分，以及逼近理论。书中还对Julia的使用做了简单介绍。 |
| 目录 |
| 出版者的话 译者序 前言 第 1 章 导论 ························ 1 1.1 微积分复习 ··············· 1 1.2 Julia 基础·················· 4 1.3 计算机运算 ··············· 21 第 2 章 方程求根 ·················· 43 2.1 迭代法的误差分析 ······ 46 2.2 二分法 ····················· 47 2.3 牛顿法 ····················· 51 2.4 弦截法 ····················· 60 2.5 穆勒法 ····················· 64 2.6 不动点迭代法 ············ 67 2.7 高次不动点迭代法 ······ 75 第 3 章 插值 ························ 78 3.1 多项式插值 ··············· 79 3.2 高次多项式插值 ········· 97 3.3 埃尔米特插值 ············101 3.4 分段多项式：样条插值 ························ 108 第 4 章 数值积分和数值微分 ···125 4.1 牛顿－柯特斯公式 ······125 4.2 复合牛顿－柯特斯公式 ························ 132 4.3 高斯求积公式 ············137 4.4 多重积分 ··················143 4.5 广义积分 ··················151 4.6 数值微分 ··················152 第 5 章 逼近理论 ··················161 5.1 离散最小二乘 ············161 5.2 连续最小二乘 ············180 5.3 正交多项式与最小二乘 ························ 183 参考文献 ····························· 199 索引 ··································· 201 |