网上购物 货比三家
您现在的位置:快乐比价网 > 图书 > 计算机与网络 > 原理基础 > 商品详情

数值分析(英文版.第3版)[按需印刷]

分享到:
数值分析(英文版.第3版)[按需印刷]

最 低 价:¥150.00

定 价:¥75.00

作 者:(美)David Kincaid,Ward Cheney

出 版 社:机械工业出版社

出版时间:2003 年4月

I S B N:7111119134

商品详情

编辑推荐

内容简介

这是一部非常成功的学术著作,它介绍了科学计算需要的各类数值分析。不但在严谨的数学科学背景下进行讨论,而且给出了数值分析方法的严格证明。
   本书适合作为数学、工程、计算机科学和其他相关专业高年级本科生或研究生数值分析课程的教材本书特点:
  ·涵盛了科学计算中数值分桥的广泛主题,除数值分析的基础知识外,还涉及线性代数和非线性代数系统的求解、数值微分与数值积分.常微分方程和偏微分方程的数值解、函数逼近等方面的内容
  ·增加了优化方面的内容和查询相关信息的网络资源
  ·书中并不详细分析算法,而是着重讲解相关的理论基础
  ·算法以伪代码的形式给出,以便学生可以立即用标准语言和交互数据包来编写实现算法的计算机程序
  

作者简介

David Kincaid是得克萨斯大学奥斯汀分校计算机科学系及数学系的高级讲师,他还是得克萨斯计算及应用 数学学会数值分析中心的代主任。
Ward Cheney是得克萨斯大学奥斯汀分校数学系教授,他的研究方向主要是逼近理论、数值分析和极大化问题。
.. << 查看详细

目录

1 mathematical preliminaries
1.0 introduction
1.1 basic concepts and taylor's theorem
1.2 orders of convergence and additional basic concepts
1.3 difference equations
2 computer arithmetic
2.0 introduaion
2.1 floating-point numbers and roundoff errors
2.2 absolute and relative errors: loss of significance
2.3 stable and unstable computations: conditioning
3 solution of nonlinear equations
3.0 introduction
3.1 bisection (interval halving method
3.2 newton's method
3.3 secant method
3.4 fixed points. and functional iteration
3.5 computing roots of polynomials
3.6 homotopy and continuation methods
4 solving systems of linear equations
4.0 introduction
.4.1 matrix algebra
4.2 lu and cholesky factorizations
4.3 pivoting and constructing an algorithm
4.4 norms and the analysis of errors
4.5 neumann series and iterative refinement
4.6 solution of equations by iterative methods
4.7 steepest descent and conjugate gradient methods
4.8 analysis of roundoff error in the gaussian algorithm
5 selected topics in numerical linear algebra
5.0 review of basic concepts
5.1 matrix eigenvalue problem: power method
5.2 schur's and cershgorin's theorems
5.3 orthogonal factorizations and least-squares problems
5.4 singular-value decomposition and pseudoinverses
5.5 qr-algorithm of francis for the eigenvalue problem
6 approximating functions
6.0 introduction
6.1 polynomial interpolation
6.2 divided differences
6.3 hermite interpolation
6.4 spline interpolation
6.5 b-splines: basic theory
6.6 b-splines: applications
6.7 taylor series
6.8 best approximation: least-squares theory
6.9 best approximation: chebyshev theory
6.1o interpolatlon in higher dimensions
6.11 continued fractions
6.12 trigonometric interpolation
6.13 fast fourier transform
6.14 adaptive approximation
7 numerical differentiation and
7.1 numerical differentiation and
7.2 numerical integration based on
7.3 gaussian quadrature
7.4 romberg integration
7.5 adaptive quadrature
7.6 sard's theory of approximating functionals
7.7 bernoulli polynomials and the euler-maclaurin formula
8 numeriral solution ot ordinary
differential equations
8.0 introduction
8.1 the existence and uniqueness of solutions
8.2 taylor-series method
8.3 runge-kutta methods
8.4 multistep methods
8.5 local and global errors: stability
8.6 systems and higher-order ordinary differential equations
8.7 boundary-value problems
8.8 boundary-value problems: shooting methods
8.9 boundary-value problems: finite-differences
8.1 0 boundary-value problems: collocation
8.1 1 linear differential equations
8.1 2 stiff equations
9 numetical selution of partial differential equations
9.0 introduction
9.1 parabolic equations: explicit methods
9.2 parabolic equations: implicit methods
9.3 problems without without time dependence: finite-differences
9.4 problems without without time dependence: galerkin methods
9.5 first-order partial differential equations: characteristics
9.6 quasilinear second-order equations: characteristics
9.7 other methods for hyperbolic problems
9.8 multigrid method
9.9 fast methods for poisson's equation
10 linear programming and related topics
10.1 convexity and linear inequalities
10.2 linear inequalities
10.3 linear programming
10.4 the simplex algorithm
11 oytimization
11.0 introdudion
11.1 one-variable case
11.2 descent methods
11.3 analysis of quadratic objective functions
11.4 quadratic-fitting algorithms
11.5 nelder-meade algorithm
11.6 simulated annealing
11.7 cenetic algorithms
11.8 convex programming
11.9 constrained minimization
11.10 pareto optimization
appendix a an overview of mathematical software
bibliography
index

商品评论(0条)

暂无评论!

您的浏览历史

loading 内容加载中,请稍后...