A First Course in the Numerical Analysis of Differential Equations

by
Edition: 2nd
Format: Paperback
Pub. Date: 2008-12-29
Publisher(s): Cambridge University Press
  • Free Shipping Icon

    This Item Qualifies for Free Shipping!*

    *Excludes marketplace orders.

  • Buyback Icon We Buy This Book Back!
    In-Store Credit: $2.10
    Check/Direct Deposit: $2.00
    PayPal: $2.00
List Price: $62.71

Buy New

Arriving Soon. Will ship when available.
$59.72

Rent Textbook

Select for Price
There was a problem. Please try again later.

Rent Digital

Rent Digital Options
Online:180 Days access
Downloadable:180 Days
$65.28
Online:1825 Days access
Downloadable:Lifetime Access
$81.59
$65.28

Used Textbook

We're Sorry
Sold Out

How Marketplace Works:

  • This item is offered by an independent seller and not shipped from our warehouse
  • Item details like edition and cover design may differ from our description; see seller's comments before ordering.
  • Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
  • Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
  • Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.

Summary

Numerical analysis presents different faces to the world. For mathematicians it is a bona fide mathematical theory with an applicable flavour. For scientists and engineers it is a practical, applied subject, part of the standard repertoire of modelling techniques. For computer scientists it is a theory on the interplay of computer architecture and algorithms for real-number calculations. The tension between these standpoints is the driving force of this book, which presents a rigorous account of the fundamentals of numerical analysis of both ordinary and partial differential equations. The point of departure is mathematical but the exposition strives to maintain a balance between theoretical, algorithmic and applied aspects of the subject. In detail, topics covered include numerical solution of ordinary differential equations by multistep and Runge-Kutta methods; finite difference and finite elements techniques for the Poisson equation; a variety of algorithms to solve large, sparse algebraic systems; methods for parabolic and hyperbolic differential equations and techniques of their analysis. The book is accompanied by an appendix that presents brief back-up in a number of mathematical topics. Dr Iserles concentrates on fundamentals: deriving methods from first principles, analysing them with a variety of mathematical techniques and occasionally discussing questions of implementation and applications. By doing so, he is able to lead the reader to theoretical understanding of the subject without neglecting its practical aspects. The outcome is a textbook that is mathematically honest and rigorous and provides its target audience with a wide range of skills in both ordinary and partial differential equations.

Table of Contents

Preface to the second editionp. ix
Preface to the first editionp. xiii
Flowchart of contentsp. xix
Ordinary differential equationsp. 1
Euler's method and beyondp. 3
Ordinary differential equations and the Lipschitz conditionp. 3
Euler's methodp. 4
The trapezoidal rulep. 8
The theta methodp. 13
Comments and bibliographyp. 15
Exercisesp. 16
Multistep methodsp. 19
The Adams methodp. 19
Order and convergence of multistep methodsp. 21
Backward differentiation formulaep. 26
Comments and bibliographyp. 28
Exercisesp. 31
Runge-Kutta methodsp. 33
Gaussian quadraturep. 33
Explicit Runge-Kutta schemesp. 38
Implicit Runge-Kutta schemesp. 41
Collocation and IRK methodsp. 43
Comments and bibliographyp. 48
Exercisesp. 50
Stiff equationsp. 53
What are stiff ODEs?p. 53
The linear stability domain and A-stabilityp. 56
A-stability of Runge-Kutta methodsp. 59
A-stability of multistep methodsp. 63
Comments and bibliographyp. 68
Exercisesp. 70
Geometric numerical integrationp. 73
Between quality and quantityp. 73
Monotone equations and algebraic stabilityp. 77
From quadratic invariants to orthogonal flowsp. 83
Hamiltonian systemsp. 87
Comments and bibliographyp. 95
Exercisesp. 99
Error controlp. 105
Numerical software vs. numerical mathematicsp. 105
The Milne devicep. 107
Embedded Runge-Kutta methodsp. 113
Comments and bibliographyp. 119
Exercisesp. 121
Nonlinear algebraic systemsp. 123
Functional iterationp. 123
The Newton-Raphson algorithm and its modificationp. 127
Starting and stopping the iterationp. 130
Comments and bibliographyp. 132
Exercisesp. 133
The Poisson equationp. 137
Finite difference schemesp. 139
Finite differencesp. 139
The five-point formula for ∇2u = fp. 147
Higher-order methods for ∇2u = fp. 158
Comments and bibliographyp. 163
Exercisesp. 166
The finite element methodp. 171
Two-point boundary value problemsp. 171
A synopsis of FEM theoryp. 184
The Poisson equationp. 192
Comments and bibliographyp. 200
Exercisesp. 201
Spectral methodsp. 205
Sparse matrices vs. small matricesp. 205
The algebra of Fourier expansionsp. 211
The fast Fourier transformp. 214
Second-order elliptic PDEsp. 219
Chebyshev methodsp. 222
Comments and bibliographyp. 225
Exercisesp. 230
Gaussian elimination for sparse linear equationsp. 233
Banded systemsp. 233
Graphs of matrices and perfect Cholesky factorizationp. 238
Comments and bibliographyp. 243
Exercisesp. 246
Classical iterative methods for sparse linear equationsp. 251
Linear one-step stationary schemesp. 251
Classical iterative methodsp. 259
Convergence of successive over-relaxationp. 270
The Poisson equationp. 281
Comments and bibliographyp. 286
Exercisesp. 288
Multigrid techniquesp. 291
In lieu of a justificationp. 291
The basic multigrid techniquep. 298
The full multigrid techniquep. 302
Poisson by multigridp. 303
Comments and bibliographyp. 307
Exercisesp. 308
Conjugate gradientsp. 309
Steepest, but slow, descentp. 309
The method of conjugate gradientsp. 312
Krylov subspaces and preconditionersp. 317
Poisson by conjugate gradientsp. 323
Comments and bibliographyp. 325
Exercisesp. 327
Fast Poisson solversp. 331
TST matrices and the Hockney methodp. 331
Fast Poisson solver in a discp. 336
Comments and bibliographyp. 342
Exercisesp. 344
Partial differential equations of evolutionp. 347
The diffusion equationp. 349
A simple numerical methodp. 349
Order, stability and convergencep. 355
Numerical schemes for the diffusion equationp. 362
Stability analysis I: Eigenvalue techniquesp. 368
Stability analysis II: Fourier techniquesp. 372
Splittingp. 378
Comments and bibliographyp. 381
Exercisesp. 383
Hyperbolic equationsp. 387
Why the advection equation?p. 387
Finite differences for the advection equationp. 394
The energy methodp. 403
The wave equationp. 407
The Burgers equationp. 413
Comments and bibliographyp. 418
Exercisesp. 422
Appendix Bluffer's guide to useful mathematicsp. 427
Linear algebrap. 428
Vector spacesp. 428
Matricesp. 429
Inner products and normsp. 432
Linear systemsp. 434
Eigenvalues and eigenvectorsp. 437
Bibliographyp. 439
Analysisp. 439
Introduction to functional analysisp. 439
Approximation theoryp. 442
Ordinary differential equationsp. 445
Bibliographyp. 446
Indexp. 447
Table of Contents provided by Ingram. All Rights Reserved.

An electronic version of this book is available through VitalSource.

This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.

By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.

Digital License

You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.

More details can be found here.

A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.

Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.

Please view the compatibility matrix prior to purchase.