|
|
|
The seventh edition of this classic text has retained the features that make it popular, while updating its treatment and inclusion of Computer Algebra Systems and Programming Languages. Interesting and timely applications motivate and enhance students' understanding of methods and analysis of results. This text incorporates a balance of theory with techniques and applications, including optional theory-based sections in each chapter. The exercise sets include additional challenging problems and projects which show practical applications of the material. Also, sections which discuss the use of computer algebra systems such as MapleA (R), MathematicaA (R), and MATLABA (R), facilitate the integration of technology in the course. Furthermore, the text incorporates programming material in both FORTRAN and C. The breadth of topics, such as partial differential equations, systems of nonlinear equations, and matrix algebra, provide comprehensive and flexible, coverage of all aspects of numerical analysis.
| ISBN | 0321133048 | | Pages | 624 | | ISBN13 | 9780321133045
(What's this?) | | Volumes | 1 | | Publisher | Pearson Education (US) | | Weight (grammes) | 1075 | | Imprint | Pearson | | Published in | Upper Saddle River | | Format | Paperback | | Previous ISBN | 9780201870725 | | Publication date | 31 Jul 2003 | | Height (mm) | 232 | | Library of Congress | QA297.G47 | | Width (mm) | 191 | | DEWEY | 519.4 | | Spine width (mm) | 34 | | DEWEY edition | DC21 | | Academic level | Professional / Scholarly |
|
| |
0. Preliminaries. Analysis versus Numerical Analysis. Computers and Numerical Analysis. An Illustrative Example. Kinds of Errors in Numerical Procedures. Interval Arithmetic. Parallel and Distributed Computing. Measuring the Efficiency of Procedures. 1. Solving Nonlinear Equations. Interval Halving (Bisection). Linear Interpolation Methods. Newton's Method. Muller's Method. Fixed-Point Iteration. Other Methods. Nonlinear Systems. 2. Solving Sets of Equations. Matrices and Vectors. Elimination Methods. The Inverse of a Matrix and Matrix Pathology. Almost Singular Matrices - Condition Numbers. Interactive Methods. Parallel Processing. 3. Interpolation and Curve Fitting. Interpolating Polynomials. Divided Differences. Spline Curves. Bezier Curves and B-Splines. Interpolating on a Surface. Least Squares Approximations. 4. Approximation of Functions. Chebyshev Polynomials and Chebyshev Series. Rational Function Approximations. Fourier Series. 5. Numerical Differentiation and Integration. Differentiation with a Computer. Numerical Integration - The Trapezoidal Rule. Simpson's Rules. An Application of Numerical Integration - Fourier Series and Fourier Transforms Adaptive Integration. Gaussian Quadrature. Multiple Integrals. Applications of Cubic Splines. 6. Numerical Solution of Ordinary Differential Equations. The Taylor Series Method. The Euler Method and Its Modification. Runge-Kutta Methods. Multistep Methods. Higher-Order Equations and Systems. Stiff Equations. Boundary-Value Problems. Characteristic-Value Problems. 7. Optimization. Finding the Minimum of y = f(x). Minimizing a Function of Several Variables. Linear Programming. Nonlinear Programming. Other Optimizations. 8. Partial Differential Equations. Elliptic Equations. Parabolic Equations. Hyperbolic Equations. 9. Finite Element Analysis. Mathematical Background. Finite Elements for Ordinary Differential Equation. Finite Elements for Partial Differential Equation. Appendices. A. Some Basic Information from Calculus. B. Software Resources. Answers to Selected Exercises. References. Index.
|
|
|
|
|
Enlarge
