[PDF] numerical analysis bsc 3rd year
[PDF] numerical analysis handwritten notes pdf
[PDF] numerical analysis pdf download
[PDF] numerical analysis pdf for computer science
[PDF] numerical analysis pdf s.s sastry
[PDF] numerical analysis pdf sauer
[PDF] numerical analysis pdf solutions
[PDF] numerical analysis questions and answers pdf
[PDF] numerical mathematical analysis pdf
[PDF] numerical methods for computer science pdf
[PDF] numerical methods for engineering and science by saumyen guha pdf
[PDF] numerical methods for scientific and engineering computation 4th edition pdf
[PDF] numerical methods for solving system of nonlinear equations
[PDF] numerical methods in civil engineering book pdf
[PDF] numerical methods journal pdf
Walter Gautschi
Numerical Analysis
Second Edition
Walter Gautschi
Department of Computer Sciences
Purdue University
250 N. University Street
West Lafayette, IN 47907-2066
wgautschi@purdue.edu
ISBN 978-0-8176-8258-3 e-ISBN 978-0-8176-8259-0
DOI 10.1007/978-0-8176-8259-0
Springer New York Dordrecht Heidelberg London
Library of Congress Control Number: 2011941359
Mathematics Subject Classification (2010): 65-01, 65D05, 65D07, 65D10, 65D25, 65D30, 65D32,
65H04, 65H05, 65H10, 65L04, 65L05, 65L06, 65L10
c ?Springer Science+Business Media, LLC 1997, 2012
All rights reserved. This work may not be translated or copied in whole or in part without the written
permission of the publisher (Springer ScienceCBusiness Media, LLC, 233 Spring Street, New York, NY 10013, USA), except for brief excerpts in connection with reviews or scholarly analysis. Use in
connection with any form of information storage and retrieval, electronic adaptation, computer software,
or by similar or dissimilar methodology nowknown or hereafter developed is forbidden.
The use in this publication of trade names, trademarks, service marks, and similar terms, even if they are
not identified as such, is not to be taken as an expression of opinion as to whether or not they are subject
to proprietary rights.
Printed on acid-free paper
www.birkhauser-science.com TO ERIKA
Preface to the Second Edition
In this second edition, the outline of chapters and sections has been preserved. The subtitle ÒAn IntroductionÓ,as suggested by several reviewers, has been deleted. The content, however, is brought up to date, both in the text and in the notes. Many passages in the text have been either corrected or improved. Some biographical notes have been added as well as a few exercises and computer assignments. The typographical appearance has also been improved by printing vectors and matrices consistently in boldface types. With regard to computer language in illustrations and exercises, we now adopt uniformly Matlab. For readers not familiar with Matlab, there are a number of introductory texts available, some, like Moler [2004], Otto and Denier [2005], Stanoyevitch [2005] that combine Matlab with numerical computing, others, like Knight [2000], Higham and Higham [2005], Hunt, Lipsman and Rosenberg [2006], and Driscoll [2009], more exclusively focused on Matlab. Themajornovelty,however,is acompleteset ofdetailedsolutionstoallexercises and machine assignments. The solution manual is available to instructors upon request at the publisherÕs websitehttp://www.birkhauser-science.com/978-0-8176-
8258-3
. Selected solutions are also included in the text to give students an idea of what is expected. The bibliographyhas been expanded to reßect technical advances in the Þeld and to include references to new books and expository accounts. As a result, the text has undergone an expansion in size of about 20%.
West Lafayette, Indiana Walter Gautschi
November 2011
vii
Preface to the First Edition
The book is designed for use in a graduate program in Numerical Analysis that is structured so as to include a basic introductory course and subsequent more specialized courses. The latter are envisaged to cover such topics as numerical linear algebra, the numerical solution of ordinary and partial differential equations, and perhaps additional topics related to complex analysis, to multidimensional analysis, in particularoptimization,and to functionalanalysis and related functional equations. Viewed in this context, the Þrst four chapters of our book could serve as a text for the basic introductory course, and the remaining three chapters (which indeed are at a distinctly higher level) could provide a text for an advanced course on the numerical solution of ordinary differential equations. In a sense, therefore, the book breaks with tradition in that itdoes no longer attempt to deal with all major topics of numerical mathematics. It is felt by the author that some of the current subdisciplines, particularly those dealing with linear algebra and partial differential equations, have developed into major Þelds of study that have attained a degree of autonomy and identity that justiÞes their treatment in separate books and separate courses on the graduate level. The term ÒNumerical AnalysisÓ as used in this book, therefore, is to be taken in the narrow sense of the numerical analogue of Mathematical Analysis, comprising such topics as machine arithmetic, the approximationof functions,approximatedifferentiationand integration,and the approximate solution of nonlinear equations and of ordinary differential equations. What is being covered, on the other hand, is done so with a view toward stressing basic principles and maintaining simplicity and student-friendliness as far as possible. In this sense, the book is ÒAn IntroductionÓ. Topics that, even though important and of current interest, require a level of technicality that transcends the boundsof simplicity striven for, are referencedin detailed bibliographicnotes at the end of each chapter. It is hoped, in this way,to place the material treated in proper contextand to help, indeed encourage,the reader to pursue advancedmodern topics in more depth. A signiÞcant feature of the book is the large collection of exercises that are designed to help the student develop problem-solving skills and to provide interesting extensions of topics treated in the text. Particular attention is given to ix xPreface to the First Edition machine assignments, where the studentis encouraged to implement numerical techniques on the computer and to make use of modern software packages. The author has taught the basic introductory course and the advanced course on ordinary differential equations regularly at Purdue University for the last 30 years or so. The former, typically, was offered both in the fall and spring semesters, to a mixed audience consisting of graduate (and some good undergraduate) students in mathematics, computer science, and engineering,while the latter was taught only in the fall, to a smaller but also mixed audience. Written notes began to materialize in the 1970s, when the authortaught the basic course repeatedlyin summer courses on Mathematics held in Perugia, Italy. Indeed, for some time, these notes existed only in the Italian language. Over the years, th ey were progressively expanded, updated, andtransposedinto English,andalongwith that,notesforthe advancedcoursewere developed. This, briefly, is how the present book evolved. A long gestation period such as this, of course, is not without dangers, the most notable one being a tendency for the material to become dated. The author tried to counteract this by constantly updating and revising the notes, adding newer developments when deemed appropriate. There are, however, benefits as well: over time, one develops a sense for what is likely to stand the test of time and what may only be of temporaryinterest, and one selects and deletes accordingly.Another benefit is the steady accumulation of exercises and the opportunity to have them tested on a large and diverse student population. The purpose of academic teaching, in the author's view, is twofold: to transmit knowledge, and, perhaps more important, to kindle interest and even enthusiasm in the student. Accordingly, the author did not strive for comprehensiveness - even within the boundaries delineated - but rather tried to concentrate on what is essential, interesting and intellectuallypleasing, and teachable. In line with this, an attempt has been made to keep the text uncluttered with numerical examples and otherillustrative material.Being well aware,however,that masteryof a subjectdoes not come from studying alone but from active participation, the author provided many exercises, including machine projects. Attributions of results to specific authors and citations to the literature have been deliberately omitted from the body of the text. Each chapter, as already mentioned, has a set of appended notes that help the reader to pursue related topics in more depth and to consult the specialized literature. It is here where attributions and historical remarks are made, and where citations to the literature - both textbook and research - appear. The main text is preceded by a prologue, which is intended to place the book in proper perspective. In addition to othertextbooks on the subject, and information on software, it gives a detailed list of topics not treated in this book, but definitely belonging to the vast area of computational mathematics, and it provides ample references to relevant texts. A list of numerical analysis journals is also included. The reader is expected to have a good background in calculus and advanced calculus. Some passages of the text require a modest degree of acquaintance with linearalgebra,complexanalysis, ordifferentialequations.Thesepassages, however, can easily be skipped, without loss of continuity, by a student who is not familiar with these subjects.
Preface to the First Editionxi
It is a pleasure to thank the publisher for showing interest in this book and cooperating in producing it. The author is also grateful to Soren Jensen and Manil Suri, who taught from this text, and to an anonymous reader; they all made many helpful suggestions on improving the presentation. He is particularly indebted to Prof. Jensen for substantially helping in preparing the exercises to Chap. 7. The author further acknowledges assistance from Carl de Boor in preparing the notes to Chap. 2 and to Werner C. Rheinboldt for helping with the notes to Chap. 4. Last but not least, he owes a measure of gratitude to Connie Wilson for typing a preliminary version of the text and to Adam Hammer for assisting the author with the more intricate aspects of LaTeX.
West Lafayette, Indiana Walter Gautschi
January 1997
Contents
Prologue.......................................................................... xix P1 Overview.............................................................. xix P2 Numerical Analysis Software........................................ xxi P3 Textbooks and Monographs.......................................... xxi P3.1 Selected Textbooks on Numerical Analysis................. xxi P3.2 Monographsand Books on Specialized Topics............. xxiii P4 Journals................................................................xxvi
1 Machine Arithmetic and Related Matters............................... 1
1.1 Real Numbers, Machine Numbers, and Rounding.................. 2
1.1.1 Real Numbers................................................. 2
1.1.2 Machine Numbers............................................ 3
1.1.3 Rounding..................................................... 5
1.2 Machine Arithmetic.................................................. 7
1.2.1 A Model of Machine Arithmetic............................ 7
1.2.2 Error Propagation in Arithmetic Operations:
Cancellation Error............................................ 8
1.3 The Condition of a Problem.......................................... 11
1.3.1 Condition Numbers.......................................... 13
1.3.2 Examples...................................................... 16
1.4 The Condition of an Algorithm...................................... 24
1.5 Computer Solution of a Problem; Overall Error.................... 27
1.6 Notes to Chapter 1.................................................... 28
Exercises and Machine Assignments to Chapter 1......................... 31 Exercises...................................................................... 31 Machine Assignments........................................................ 39 Selected Solutions to Exercises.............................................. 44 Selected Solutions to Machine Assignments................................ 48
2 Approximation and Interpolation......................................... 55
2.1 Least Squares Approximation........................................ 59
2.1.1 Inner Products................................................ 59
2.1.2 The Normal Equations....................................... 61
xiii xivContents
2.1.3 Least Squares Error; Convergence........................... 64
2.1.4 Examples of Orthogonal Systems........................... 67
2.2 Polynomial Interpolation............................................. 73
2.2.1 Lagrange Interpolation Formula: Interpolation Operator... 74
2.2.2 Interpolation Error............................................ 77
2.2.3 Convergence.................................................. 81
2.2.4 Chebyshev Polynomials and Nodes......................... 86
2.2.5 Barycentric Formula......................................... 91
2.2.6 Newton's Formula............................................ 93
2.2.7 Hermite Interpolation........................................ 97
2.2.8 Inverse Interpolation......................................... 100
2.3 Approximation and Interpolation by Spline Functions............. 101
2.3.1 Interpolation by Piecewise Linear Functions............... 102
2.3.2 A Basis forS
01 .?/............................................ 104
2.3.3 Least Squares Approximation............................... 106
2.3.4 Interpolation by Cubic Splines.............................. 107
2.3.5 Minimality Properties of Cubic Spline Interpolants........ 110
2.4 Notes to Chapter 2.................................................... 112
Exercises and Machine Assignments to Chapter 2......................... 118 Exercises...................................................................... 118 Machine Assignments........................................................ 134 Selected Solutions to Exercises.............................................. 138 Selected Solutions to Machine Assignments................................ 150
3 Numerical Differentiation and Integration.............................. 159
3.1 Numerical Differentiation............................................ 159
3.1.1 AGeneralDifferentiationFormulaforUnequally
Spaced Points................................................. 159
3.1.2 Examples...................................................... 161
3.1.3 Numerical Differentiation with Perturbed Data............. 163
3.2 Numerical Integration................................................ 165
3.2.1 The Composite Trapezoidal and Simpson's Rules.......... 165
3.2.2 (Weighted) Newton-Cotes and Gauss Formulae............ 169
3.2.3 Properties of Gaussian Quadrature Rules................... 175
3.2.4 Some Applications of the Gauss Quadrature Rule.......... 178
3.2.5 Approximation of Linear Functionals: Method
of Interpolation vs. Method of Undetermined Coefficients................................................... 182
3.2.6 Peano Representation of Linear Functionals................ 187
3.2.7 Extrapolation Methods....................................... 190
3.3 Notes to Chapter 3.................................................... 195
Exercises and Machine Assignments to Chapter 3......................... 200 Exercises...................................................................... 200 Machine Assignments........................................................ 214 Selected Solutions to Exercises.............................................. 219 Selected Solutions to Machine Assignments................................ 232
Contentsxv
4 Nonlinear Equations........................................................ 253
4.1 Examples.............................................................. 254
4.1.1 A Transcendental Equation.................................. 254
4.1.2 A Two-Point Boundary Value Problem..................... 254
4.1.3 A Nonlinear Integral Equation............................... 256
4.1.4 s-Orthogonal Polynomials................................... 257
4.2 Iteration, Convergence, and Efficiency.............................. 258
4.3 The Methods of Bisection and Sturm Sequences................... 261
4.3.1 Bisection Method............................................. 261
4.3.2 Method of Sturm Sequences................................. 264
4.4 Method of False Position............................................. 266
4.5 Secant Method........................................................ 269
4.6 Newton's Method..................................................... 274
4.7 Fixed Point Iteration.................................................. 278
4.8 Algebraic Equations.................................................. 280
4.8.1 Newton's Method Applied to an Algebraic Equation...... 280
4.8.2 An Accelerated Newt
on Method for Equations with Real Roots............................................... 282
4.9 Systems of Nonlinear Equations..................................... 284
4.9.1 Contraction Mapping Principle.............................. 284
4.9.2 Newton's Method for Systems of Equations................ 285
4.10 Notes to Chapter 4.................................................... 287
Exercises and Machine Assignments to Chapter 4......................... 292 Exercises...................................................................... 292 Machine Assignments........................................................ 302 Selected Solutions to Exercises.............................................. 306 Selected Solutions to Machine Assignments................................ 318
5 Initial Value Problems for ODEs: One-Step Methods.................. 325
5.1 Examples.............................................................. 326
5.2 Types of Differential Equations...................................... 328
5.3 Existence and Uniqueness............................................ 331
5.4 Numerical Methods................................................... 332
5.5 Local Description of One-Step Methods............................ 333
5.6 Examples of One-Step Methods..................................... 335
5.6.1 Euler's Method............................................... 335
5.6.2 Method of Taylor Expansion................................. 336
5.6.3 Improved Euler Methods..................................... 337
5.6.4 Second-Order Two-Stage Methods.......................... 339
5.6.5 Runge-Kutta Methods....................................... 341
5.7 Global Description of One-Step Methods........................... 343
5.7.1 Stability....................................................... 344
5.7.2 Convergence.................................................. 347
5.7.3 Asymptotics of Global Error................................. 348
xviContents
5.8 Error Monitoring and Step Control.................................. 352
5.8.1 Estimation of Global Error................................... 352
5.8.2 Truncation Error Estimates.................................. 354
5.8.3 Step Control.................................................. 357
5.9 Stiff Problems......................................................... 360
5.9.1 A-Stability.................................................... 361
5.9.2 Pad
´e Approximation......................................... 362
5.9.3 Examples of A-Stable One-Step Methods.................. 367
5.9.4 Regions of Absolute Stability................................ 370
5.10 Notes to Chapter 5.................................................... 371
Exercises and Machine Assignments to Chapter 5......................... 378 Exercises...................................................................... 378 Machine Assignments........................................................ 383 Selected Solutions to Exercises.............................................. 387 Selected Solutions to Machine Assignments................................ 392
6 Initial Value Problems for ODEs: Multistep Methods.................. 399
6.1 Local Description of Multistep Methods............................ 399
6.1.1 Explicit and Implicit Methods............................... 399
6.1.2 Local Accuracy............................................... 401
6.1.3 Polynomial Degree vs. Order................................ 405
6.2 Examples of Multistep Methods..................................... 408
6.2.1 Adams-Bashforth Method................................... 409
6.2.2 Adams-Moulton Method.................................... 412
6.2.3 Predictor-Corrector Methods................................ 413
6.3 Global Description of Multistep Methods........................... 416
6.3.1 Linear Difference Equations................................. 416
6.3.2 Stability and Root Condition................................ 420
6.3.3 Convergence.................................................. 424
6.3.4 Asymptotics of Global Error................................. 426
6.3.5 Estimation of Global Error................................... 430
6.4 Analytic Theory of Order and Stability.............................. 433
6.4.1 Analytic Characterization of Order.......................... 433
6.4.2 Stable Methods of Maximum Order......................... 441
6.4.3 Applications.................................................. 446
6.5 Stiff Problems......................................................... 450
6.5.1 A-Stability.................................................... 450
6.5.2A.˛/-Stability................................................ 452
6.6 Notes to Chapter 6.................................................... 453
Exercises and Machine Assignments to Chapter 6......................... 456 Exercises...................................................................... 456 Machine Assignments........................................................ 459 Selected Solutions to Exercises.............................................. 461 Selected Solutions to Machine Assignments................................ 466
Contentsxvii
7 Two-Point Boundary Value Problems for ODEs........................ 471
7.1 Existence and Uniqueness............................................ 474
7.1.1 Examples...................................................... 474
7.1.2 A Scalar Boundary Value Problem.......................... 476
7.1.3 General Linearand Nonlinear Systems..................... 481
7.2 Initial Value Techniques.............................................. 482
7.2.1 Shooting Method for a Scalar Boundary Value Problem... 483
7.2.2 Linear and Nonlinear Systems............................... 485
7.2.3 Parallel Shooting............................................. 490
7.3 Finite Difference Methods........................................... 494
7.3.1 Linear Second-Order Equations............................. 494
7.3.2 Nonlinear Second-Order Equations......................... 500
7.4 Variational Methods.................................................. 503
7.4.1 Variational Formulation...................................... 503
7.4.2 The Extremal Problem....................................... 506
7.4.3 Approximate Solution of the Extremal Problem............ 507
7.5 Notes to Chapter7.................................................... 509
Exercises and Machine Assignments to Chapter 7......................... 512 Exercises...................................................................... 512 Machine Assignments........................................................ 518 Selected Solutions to Exercises.............................................. 521quotesdbs_dbs11.pdfusesText_17
[PDF] Numerical Analysis (Second Edition) - IKIU