Ship-Ship-Hooray! Free Shipping on $25+ Details >

by David R. Kincaid and E. Ward Cheney

Cover type: HardbackEdition: 3RD 02

Copyright: 2002

Publisher: Brooks/Cole Publishing Co.

Published: 2002

International: No

List price: $94.00

All of our used books are 100% hand-inspected and guaranteed! Happy you, happy us.

FREE Shipping on $25+

Order $25 or more and the shipping's on us. Marketplace items and other exclusions apply.

Ships Monday

Order by noon CST (Mon-Fri, excluding holidays). Some restrictions apply.

Easy 30-Day Returns

Not the right book for you? We accept returns within 30 days of purchase. Access codes are non-refundable once revealed or redeemed.

Ships directly from us

SELL THIS BOOK NOW

Get $24.50 CASH!

Get $24.50 CASH!

You Save $35.58 (38%)

$58.42

Condition: Very Good
**100% Satisfaction Guarantee**

We hand-inspect every one of our used books.

We hand-inspect every one of our used books.

This title is currently not available in digital format.

Well, that's no good. Unfortunately, this edition is currently out of stock. Please check back soon.

Also available in the Marketplace starting at $34.28

Price | Condition | Seller | Comments |
---|

This highly successful and scholarly book introduces students with diverse backgrounds to the various types of mathematical analysis that are commonly needed in scientific computing. The subject of numerical analysis is treated from a mathematical point of view, offering a complete analysis of methods for scientific computing with careful proofs and scientific background. An in-depth treatment of the topics of numerical analysis, a more scholarly approach, and a different menu of topics sets this book apart from the authors' well-respected and best-selling text: NUMERICAL MATHEMATICS AND COMPUTING, FOURTH EDITION.

Benefits:

- Problems have been separated into Problems and Computer Problems.
- This text includes an extensive and updated bibliography of more than 400 items.
- Algorithms are presented in pseudocode, so that students can immediately write computer programs in standard languages or use interactive mathematical software packages.
- NEW! The authors have added a chapter on optimization. Subtopics addressed in this new chapter are methods of descent, quadratic fitting algorithms, the Nelder-Meade algorithm, simulated annealing, genetic algorithms, Pareto optimization, and convex programming
- NEW! Up-to-date information about resources on the Internet has been added.
- NEW! References to problems and to other parts of the book now include page numbers to help the reader find them easily.
- NEW! Theorems are displayed with names or titles to help the reader remember them.
- NEW! Approximately 20% of the problems are new to this edition.
- NEW! The book has a new design that makes it easier for students to find and review information.

**Kincaid, David R. : University of Texas at Austin **

**Cheney, E. Ward : University of Texas at Austin **

**Preface. Numerical Analysis: What Is It? **

**1. Mathematical Preliminaries. **

Basic Concepts and Taylor's Theorem. Orders of Convergence and Additional Basic Concepts. Difference Equations.

**2. Computer Arithmetic. **

Floating-Point Numbers and Roundoff Errors. Absolute and Relative Errors: Loss of Significance. Stable and Unstable Computations: Conditioning.

**3. Solution of Nonlinear Equations. **Bisection (Interval Halving) Method. Newton's Method. Secant Method. Fixed Points and Functional Iteration. Computing Zeros of Polynomials. Hornotopy and Continuation Methods.

**4. Solving Systems of Linear Equations. **Matrix Algebra. The LU and Cholesky Factorizations. Pivoting and Constructing an Algorithm. Norms and the Analysis of Errors. Nuemann Series and Interactive Refinement. Solution of Equations by Iterative Methods. Steepest Descent and Conjugate Gradient Methods. Analysis of Roundoff Error in the Gaussian Algorithm.

**5. Selected Topics in Numerical Linear Algebra. **Matrix Eigenvalue Problem: Power Method. Schur's and Gershgorin's Theorems. Orthogonal Factorizations and Least-Squares Problems. Singular-Value Decomposition and Pseudoinverses. The QR-Algorithm of Francis for the Eigenvalue Problem.

**6. Approximation Functions. **Polynomial Interpolation. Divided Differences. Hermite Interpolation. Spline Interpolation. The B-Splines: Basic Theory. The B-Splines: Applications. Taylor Series. Best Approximation: Least-Squares Theory. Best Approximation: Chebyshev Theory. Interpolation in Higher Dimension. Continued Fractions. Trigonometric Interpolation. Fast Fourier Transform. Adaptive Approximation.

**7. Numerical Differentiation and Integration. **Numerical Differentiation and Richardson Extrapolation. Numerical Integration Based on Interpolation. Gaussian Quadrature. Romberg Integration. Adaptive Quadrature. Sard's Theory of Approximating Functionals. Bernoulli Polynomials and the Euler-Maclaurin Formula.

**8. Numerical Solution of Ordinary Differential Equations. **The Existence and Uniqueness of Solutions. Taylor-Series Methods. Runge-Kutta Methods. Multistep Methods. Local and Global Errors: Stability. Systems and Higher-Order Ordinary Differential Equations. Boundary-Value Problems. Boundary-Value Problems: Shooting Methods. Boundary-Value Problems: Finite-Difference Methods. Boundary-Value Problems: Collocation. Linear Differential Equations. Stiff Equations.

**9. Numerical Solution of Partial Differential Equations. **Parabolic Equations: Explicit Methods. Parabolic Equations: Implicit Methods. Problems Without Time Dependence: Finite-Difference Methods. Problems Without Time Dependence: Galerkin and Ritz Methods. First-Order Partial Differential Equations: Characteristic Curves. Quasilinear Second-Order Equations: Characteristics. Other Methods for Hyperbolic Problems. Multigrid Method. Fast Methods for Poisson's Equation.

**10. Linear Programming and Related Topics. **

Convexity and Linear Inequalities. Linear Inequalities. Linear Programming. The Simplex Algorithm.

**11. Optimization. **

One-Variable Case. Descent Methods. Analysis of Quadratic Objective Functions. Nelder-Meade Algorithm. Simulated Annealing. Genetic Algorithms. Convex Programming. Constrained Minimization. Pareto Optimization.

**Overview of Mathematical Software. Bibliography. Index.**

shop us with confidence

Summary

This highly successful and scholarly book introduces students with diverse backgrounds to the various types of mathematical analysis that are commonly needed in scientific computing. The subject of numerical analysis is treated from a mathematical point of view, offering a complete analysis of methods for scientific computing with careful proofs and scientific background. An in-depth treatment of the topics of numerical analysis, a more scholarly approach, and a different menu of topics sets this book apart from the authors' well-respected and best-selling text: NUMERICAL MATHEMATICS AND COMPUTING, FOURTH EDITION.

Benefits:

- Problems have been separated into Problems and Computer Problems.
- This text includes an extensive and updated bibliography of more than 400 items.
- Algorithms are presented in pseudocode, so that students can immediately write computer programs in standard languages or use interactive mathematical software packages.
- NEW! The authors have added a chapter on optimization. Subtopics addressed in this new chapter are methods of descent, quadratic fitting algorithms, the Nelder-Meade algorithm, simulated annealing, genetic algorithms, Pareto optimization, and convex programming
- NEW! Up-to-date information about resources on the Internet has been added.
- NEW! References to problems and to other parts of the book now include page numbers to help the reader find them easily.
- NEW! Theorems are displayed with names or titles to help the reader remember them.
- NEW! Approximately 20% of the problems are new to this edition.
- NEW! The book has a new design that makes it easier for students to find and review information.

Author Bio

**Kincaid, David R. : University of Texas at Austin **

**Cheney, E. Ward : University of Texas at Austin **

Table of Contents

**Preface. Numerical Analysis: What Is It? **

**1. Mathematical Preliminaries. **

Basic Concepts and Taylor's Theorem. Orders of Convergence and Additional Basic Concepts. Difference Equations.

**2. Computer Arithmetic. **

Floating-Point Numbers and Roundoff Errors. Absolute and Relative Errors: Loss of Significance. Stable and Unstable Computations: Conditioning.

**3. Solution of Nonlinear Equations. **Bisection (Interval Halving) Method. Newton's Method. Secant Method. Fixed Points and Functional Iteration. Computing Zeros of Polynomials. Hornotopy and Continuation Methods.

**4. Solving Systems of Linear Equations. **Matrix Algebra. The LU and Cholesky Factorizations. Pivoting and Constructing an Algorithm. Norms and the Analysis of Errors. Nuemann Series and Interactive Refinement. Solution of Equations by Iterative Methods. Steepest Descent and Conjugate Gradient Methods. Analysis of Roundoff Error in the Gaussian Algorithm.

**5. Selected Topics in Numerical Linear Algebra. **Matrix Eigenvalue Problem: Power Method. Schur's and Gershgorin's Theorems. Orthogonal Factorizations and Least-Squares Problems. Singular-Value Decomposition and Pseudoinverses. The QR-Algorithm of Francis for the Eigenvalue Problem.

**6. Approximation Functions. **Polynomial Interpolation. Divided Differences. Hermite Interpolation. Spline Interpolation. The B-Splines: Basic Theory. The B-Splines: Applications. Taylor Series. Best Approximation: Least-Squares Theory. Best Approximation: Chebyshev Theory. Interpolation in Higher Dimension. Continued Fractions. Trigonometric Interpolation. Fast Fourier Transform. Adaptive Approximation.

**7. Numerical Differentiation and Integration. **Numerical Differentiation and Richardson Extrapolation. Numerical Integration Based on Interpolation. Gaussian Quadrature. Romberg Integration. Adaptive Quadrature. Sard's Theory of Approximating Functionals. Bernoulli Polynomials and the Euler-Maclaurin Formula.

**8. Numerical Solution of Ordinary Differential Equations. **The Existence and Uniqueness of Solutions. Taylor-Series Methods. Runge-Kutta Methods. Multistep Methods. Local and Global Errors: Stability. Systems and Higher-Order Ordinary Differential Equations. Boundary-Value Problems. Boundary-Value Problems: Shooting Methods. Boundary-Value Problems: Finite-Difference Methods. Boundary-Value Problems: Collocation. Linear Differential Equations. Stiff Equations.

**9. Numerical Solution of Partial Differential Equations. **Parabolic Equations: Explicit Methods. Parabolic Equations: Implicit Methods. Problems Without Time Dependence: Finite-Difference Methods. Problems Without Time Dependence: Galerkin and Ritz Methods. First-Order Partial Differential Equations: Characteristic Curves. Quasilinear Second-Order Equations: Characteristics. Other Methods for Hyperbolic Problems. Multigrid Method. Fast Methods for Poisson's Equation.

**10. Linear Programming and Related Topics. **

Convexity and Linear Inequalities. Linear Inequalities. Linear Programming. The Simplex Algorithm.

**11. Optimization. **

One-Variable Case. Descent Methods. Analysis of Quadratic Objective Functions. Nelder-Meade Algorithm. Simulated Annealing. Genetic Algorithms. Convex Programming. Constrained Minimization. Pareto Optimization.

**Overview of Mathematical Software. Bibliography. Index.**

Publisher Info

Publisher: Brooks/Cole Publishing Co.

Published: 2002

International: No

Published: 2002

International: No

This highly successful and scholarly book introduces students with diverse backgrounds to the various types of mathematical analysis that are commonly needed in scientific computing. The subject of numerical analysis is treated from a mathematical point of view, offering a complete analysis of methods for scientific computing with careful proofs and scientific background. An in-depth treatment of the topics of numerical analysis, a more scholarly approach, and a different menu of topics sets this book apart from the authors' well-respected and best-selling text: NUMERICAL MATHEMATICS AND COMPUTING, FOURTH EDITION.

Benefits:

- Problems have been separated into Problems and Computer Problems.
- This text includes an extensive and updated bibliography of more than 400 items.
- Algorithms are presented in pseudocode, so that students can immediately write computer programs in standard languages or use interactive mathematical software packages.
- NEW! The authors have added a chapter on optimization. Subtopics addressed in this new chapter are methods of descent, quadratic fitting algorithms, the Nelder-Meade algorithm, simulated annealing, genetic algorithms, Pareto optimization, and convex programming
- NEW! Up-to-date information about resources on the Internet has been added.
- NEW! References to problems and to other parts of the book now include page numbers to help the reader find them easily.
- NEW! Theorems are displayed with names or titles to help the reader remember them.
- NEW! Approximately 20% of the problems are new to this edition.
- NEW! The book has a new design that makes it easier for students to find and review information.

**Kincaid, David R. : University of Texas at Austin **

**Cheney, E. Ward : University of Texas at Austin **

**Preface. Numerical Analysis: What Is It? **

**1. Mathematical Preliminaries. **

Basic Concepts and Taylor's Theorem. Orders of Convergence and Additional Basic Concepts. Difference Equations.

**2. Computer Arithmetic. **

Floating-Point Numbers and Roundoff Errors. Absolute and Relative Errors: Loss of Significance. Stable and Unstable Computations: Conditioning.

**3. Solution of Nonlinear Equations. **Bisection (Interval Halving) Method. Newton's Method. Secant Method. Fixed Points and Functional Iteration. Computing Zeros of Polynomials. Hornotopy and Continuation Methods.

**4. Solving Systems of Linear Equations. **Matrix Algebra. The LU and Cholesky Factorizations. Pivoting and Constructing an Algorithm. Norms and the Analysis of Errors. Nuemann Series and Interactive Refinement. Solution of Equations by Iterative Methods. Steepest Descent and Conjugate Gradient Methods. Analysis of Roundoff Error in the Gaussian Algorithm.

**5. Selected Topics in Numerical Linear Algebra. **Matrix Eigenvalue Problem: Power Method. Schur's and Gershgorin's Theorems. Orthogonal Factorizations and Least-Squares Problems. Singular-Value Decomposition and Pseudoinverses. The QR-Algorithm of Francis for the Eigenvalue Problem.

**6. Approximation Functions. **Polynomial Interpolation. Divided Differences. Hermite Interpolation. Spline Interpolation. The B-Splines: Basic Theory. The B-Splines: Applications. Taylor Series. Best Approximation: Least-Squares Theory. Best Approximation: Chebyshev Theory. Interpolation in Higher Dimension. Continued Fractions. Trigonometric Interpolation. Fast Fourier Transform. Adaptive Approximation.

**7. Numerical Differentiation and Integration. **Numerical Differentiation and Richardson Extrapolation. Numerical Integration Based on Interpolation. Gaussian Quadrature. Romberg Integration. Adaptive Quadrature. Sard's Theory of Approximating Functionals. Bernoulli Polynomials and the Euler-Maclaurin Formula.

**8. Numerical Solution of Ordinary Differential Equations. **The Existence and Uniqueness of Solutions. Taylor-Series Methods. Runge-Kutta Methods. Multistep Methods. Local and Global Errors: Stability. Systems and Higher-Order Ordinary Differential Equations. Boundary-Value Problems. Boundary-Value Problems: Shooting Methods. Boundary-Value Problems: Finite-Difference Methods. Boundary-Value Problems: Collocation. Linear Differential Equations. Stiff Equations.

**9. Numerical Solution of Partial Differential Equations. **Parabolic Equations: Explicit Methods. Parabolic Equations: Implicit Methods. Problems Without Time Dependence: Finite-Difference Methods. Problems Without Time Dependence: Galerkin and Ritz Methods. First-Order Partial Differential Equations: Characteristic Curves. Quasilinear Second-Order Equations: Characteristics. Other Methods for Hyperbolic Problems. Multigrid Method. Fast Methods for Poisson's Equation.

**10. Linear Programming and Related Topics. **

Convexity and Linear Inequalities. Linear Inequalities. Linear Programming. The Simplex Algorithm.

**11. Optimization. **

One-Variable Case. Descent Methods. Analysis of Quadratic Objective Functions. Nelder-Meade Algorithm. Simulated Annealing. Genetic Algorithms. Convex Programming. Constrained Minimization. Pareto Optimization.

**Overview of Mathematical Software. Bibliography. Index.**