Numerical Analysis, 10th Edition

J. Douglas Faires

Copyright 2016
{{checkPublicationMessage('Published', '2015-01-01T00:00:00+0000')}}

Starting At £53.00 See pricing and ISBN options

Instructor Next Steps

Students: Buy now

Numerical Analysis 10th Edition by J. Douglas Faires

Quick Navigation

Overview
Meet the Author
What's New
Features
Table of Contents
Pricing

Overview

This well-respected text introduces the theory and application of modern numerical approximation techniques to students taking a one- or two-semester course in numerical analysis. Providing an accessible treatment that only requires a calculus prerequisite, the authors explain how, why, and when approximation techniques can be expected to work-and why, in some situations, they fail. A wealth of examples and exercises develop students' intuition, and demonstrate the subject's practical applications to important everyday problems in math, computing, engineering, and physical science disciplines. The first book of its kind when crafted more than 30 years ago to serve a diverse undergraduate audience, Burden, Faires, and Burden's NUMERICAL ANALYSIS remains the definitive introduction to a vital and practical subject.

Meet the Authors

{{collapseContainerClosed['meet-the-author'] ? 'Show More' : 'Show Less'}}

J. Douglas Faires

J. Douglas Faires, late of Youngstown State University, pursued mathematical interests in analysis, numerical analysis, mathematics history, and problem solving. Dr. Faires won numerous awards, including the Outstanding College-University Teacher of Mathematics by the Ohio Section of MAA and five Distinguished Faculty awards from Youngstown State University, which also awarded him an Honorary Doctor of Science award in 2006.

What's New

{{collapseContainerClosed['whats-new'] ? 'Show More' : 'Show Less'}}

Some of the examples in the book have been rewritten to better emphasize the problem being solved before the solution is provided. Additional steps have been added to some of the examples to explicitly show the computations required for the first steps of iteration processes. This gives readers a way to test and debug programs they have written for problems similar to the examples.
Chapter Exercises have been split into computational, applied, and theoretical categories to give instructors more flexibility in assigning homework. In almost all of the computational situations, the exercises have been paired in an odd-even manner, with answers to odd problems provided in the back of the book. If the instructor assigns even problems as homework, students can work the odd problems and check their answers prior to doing the even problems.
Many new applied exercises have been added to the text, from diverse areas of engineering as well as from the physical, computer, biological, and social sciences.
Discussion questions have been added after each chapter section, primarily for instructor use in online courses. In addition, parts of the text have been reorganized to facilitate online instruction.
The last section of each chapter has been renamed and split into four subsections: Numerical Software, Discussion Questions, Key Concepts, and Chapter Review. Many of the discussion questions point students to modern areas of research in software development.
Additional PowerPoint® slides, available on the Instructor Companion Website, have been added to supplement the reading material.
The bibliographic material has been updated to reflect new sources and new editions of referenced books.

Features

{{collapseContainerClosed['features'] ? 'Show More' : 'Show Less'}}

Virtually every concept in the text is illustrated by examples. In addition, concepts and examples are reinforced by more than 2500 class-tested exercises ranging from elementary applications of methods and algorithms to generalizations and extensions of the theory.
The exercise sets include many applied problems from diverse areas of engineering, as well as from the physical, computer, biological, and social sciences.
The algorithms in the text are designed to work with a wide variety of software packages and programming languages, allowing maximum flexibility for users to harness computing power to perform approximations. The book's companion website offers Maple, Mathematica, and MATLAB worksheets, as well as C, FORTRAN, Java, and Pascal programs.
The design of the text gives instructors flexibility in choosing topics they wish to cover, selecting the level of theoretical rigor desired, and deciding which applications are most appropriate or interesting for their classes.

{{collapseContainerClosed['table-of-contents'] ? 'Show More' : 'Show Less'}}

1. MATHEMATICAL PRELIMINARIES AND ERROR ANALYSIS.
Review of Calculus. Round-off Errors and Computer Arithmetic. Algorithms and Convergence. Numerical Software and Chapter Summary.
2. SOLUTIONS OF EQUATIONS IN ONE VARIABLE.
The Bisection Method. Fixed-Point Iteration. Newton's Method and Its Extensions. Error Analysis for Iterative Methods. Accelerating Convergence. Zeros of Polynomials and Müller's Method. Numerical Software and Chapter Summary.
3. INTERPOLATION AND POLYNOMIAL APPROXIMATION.
Interpolation and the Lagrange Polynomial. Data Approximation and Neville's Method. Divided Differences. Hermite Interpolation. Cubic Spline Interpolation. Parametric Curves. Numerical Software and Chapter Summary.
4. NUMERICAL DIFFERENTIATION AND INTEGRATION.
Numerical Differentiation. Richardson's Extrapolation. Elements of Numerical Integration. Composite Numerical Integration. Romberg Integration. Adaptive Quadrature Methods. Gaussian Quadrature. Multiple Integrals. Improper Integrals. Numerical Software and Chapter Summary.
5. INITIAL-VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS.
The Elementary Theory of Initial-Value Problems. Euler's Method. Higher-Order Taylor Methods. Runge-Kutta Methods. Error Control and the Runge-Kutta-Fehlberg Method. Multistep Methods. Variable Step-Size Multistep Methods. Extrapolation Methods. Higher-Order Equations and Systems of Differential Equations. Stability. Stiff Differential Equations. Numerical Software and Chapter Summary.
6. DIRECT METHODS FOR SOLVING LINEAR SYSTEMS.
Linear Systems of Equations. Pivoting Strategies. Linear Algebra and Matrix Inversion. The Determinant of a Matrix. Matrix Factorization. Special Types of Matrices. Numerical Software and Chapter Summary.
7. ITERATIVE TECHNIQUES IN MATRIX ALGEBRA.
Norms of Vectors and Matrices. Eigenvalues and Eigenvectors. The Jacobi and Gauss-Siedel Iterative Techniques. Relaxation Techniques for Solving Linear Systems. Error Bounds and Iterative Refinement. The Conjugate Gradient Method. Numerical Software and Chapter Summary.
8. APPROXIMATION THEORY.
Discrete Least Squares Approximation. Orthogonal Polynomials and Least Squares Approximation. Chebyshev Polynomials and Economization of Power Series. Rational Function Approximation. Trigonometric Polynomial Approximation. Fast Fourier Transforms. Numerical Software and Chapter Summary.
9. APPROXIMATING EIGENVALUES.
Linear Algebra and Eigenvalues. Orthogonal Matrices and Similarity Transformations. The Power Method. Householder's Method. The QR Algorithm. Singular Value Decomposition. Numerical Software and Chapter Summary.
10. NUMERICAL SOLUTIONS OF NONLINEAR SYSTEMS OF EQUATIONS.
Fixed Points for Functions of Several Variables. Newton's Method. Quasi-Newton Methods. Steepest Descent Techniques. Homotopy and Continuation Methods. Numerical Software and Chapter Summary.
11. BOUNDARY-VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL EQUATIONS.
The Linear Shooting Method. The Shooting Method for Nonlinear Problems. Finite-Difference Methods for Linear Problems. Finite-Difference Methods for Nonlinear Problems. The Rayleigh-Ritz Method. Numerical Software and Chapter Summary.
12. NUMERICAL SOLUTIONS TO PARTIAL DIFFERENTIAL EQUATIONS.
Elliptic Partial Differential Equations. Parabolic Partial Differential Equations. Hyperbolic Partial Differential Equations. An Introduction to the Finite-Element Method. Numerical Software and Chapter Summary.
Bibliography.
Answers to Selected Exercises.