An engineer’s guide to numerical analysis
To properly function in today’s work environment, engineers require a working familiarity with numerical analysis. This book provides that necessary background, striking a balance between analytical rigor and an applied approach focusing on methods particular to the solving of engineering problems.
An Introduction to Numerical Analysis for Electrical and Computer Engineers gives electrical and computer engineering students their first exposure to numerical analysis and serves as a refresher for professionals as well. Emphasizing the earlier stages of numerical analysis for engineers with real-life solutions for computing and engineering applications, the book:
- Forms a logical bridge between first courses in matrix/linear algebra and the more sophisticated methods of signal processing and control system courses
- Includes MATLAB®-oriented examples, with a quick introduction to MATLAB for those who need it
- Provides detailed proofs and derivations for many key results
Specifically tailored to the needs of computer and electrical engineers, this is the resource engineers have long needed in order to master an area of mathematics critical to their profession.
Author(s): Christopher J. Zarowski
Edition: 1
Publisher: Wiley-Interscience
Year: 2004
Language: English
Pages: 605
An Introduction to Numerical Analysis for Electrical and Computer Engineers......Page 1
CONTENTS......Page 10
PREFACE......Page 16
1.1 INTRODUCTION......Page 20
1.2 SOME SETS......Page 21
1.3 SOME SPECIAL MAPPINGS: METRICS, NORMS,......Page 23
1.3.1 Metrics and Metric Spaces......Page 25
1.3.2 Norms and Normed Spaces......Page 27
1.3.3 Inner Products and Inner Product Spaces......Page 33
1.4 THE DISCRETE FOURIER SERIES (DFS)......Page 44
APPENDIX 1.A COMPLEX ARITHMETIC......Page 47
REFERENCES......Page 51
PROBLEMS......Page 52
2.2 FIXED-POINT REPRESENTATIONS......Page 57
2.3 FLOATING-POINT REPRESENTATIONS......Page 61
2.4 ROUNDING EFFECTS IN DOT PRODUCT COMPUTATION......Page 67
2.5 MACHINE EPSILON......Page 72
APPENDIX 2.A REVIEW OF BINARY NUMBER CODES......Page 73
PROBLEMS......Page 78
3.2 CAUCHY SEQUENCES AND COMPLETE SPACES......Page 82
3.3 POINTWISE CONVERGENCE AND UNIFORM CONVERGENCE......Page 89
3.4 FOURIER SERIES......Page 92
3.5 TAYLOR SERIES......Page 97
3.6 ASYMPTOTIC SERIES......Page 116
3.7 MORE ON THE DIRICHLET KERNEL......Page 122
3.A.1 Introduction......Page 126
3.A.2 The Concept of a Discrete Basis......Page 127
3.A.3 Rotating Vectors in the Plane......Page 131
3.A.4 Computing Arctangents......Page 133
3.A.5 Final Remarks......Page 134
APPENDIX 3.B MATHEMATICAL INDUCTION......Page 135
APPENDIX 3.C CATASTROPHIC CANCELLATION......Page 136
REFERENCES......Page 138
PROBLEMS......Page 139
4.2 LEAST-SQUARES APPROXIMATION AND LINEAR SYSTEMS......Page 146
4.3 LEAST-SQUARES APPROXIMATION AND ILL-CONDITIONED......Page 151
4.4 CONDITION NUMBERS......Page 154
4.5 LU DECOMPOSITION......Page 167
4.6 LEAST-SQUARES PROBLEMS AND QR DECOMPOSITION......Page 180
4.7 ITERATIVE METHODS FOR LINEAR SYSTEMS......Page 195
APPENDIX 4.A HILBERT MATRIX INVERSES......Page 205
APPENDIX 4.B SVD AND LEAST SQUARES......Page 210
REFERENCES......Page 212
PROBLEMS......Page 213
5.2 GENERAL PROPERTIES OF ORTHOGONAL POLYNOMIALS......Page 226
5.3 CHEBYSHEV POLYNOMIALS......Page 237
5.4 HERMITE POLYNOMIALS......Page 244
5.5 LEGENDRE POLYNOMIALS......Page 248
5.6 AN EXAMPLE OF ORTHOGONAL POLYNOMIAL......Page 254
5.7 UNIFORM APPROXIMATION......Page 257
PROBLEMS......Page 260
6.1 INTRODUCTION......Page 270
6.2 LAGRANGE INTERPOLATION......Page 271
6.3 NEWTON INTERPOLATION......Page 276
6.4 HERMITE INTERPOLATION......Page 285
6.5 SPLINE INTERPOLATION......Page 288
REFERENCES......Page 303
PROBLEMS......Page 304
7.1 INTRODUCTION......Page 309
7.2 BISECTION METHOD......Page 311
7.3 FIXED-POINT METHOD......Page 315
7.4 NEWTON–RAPHSON METHOD......Page 324
7.5 SYSTEMS OF NONLINEAR EQUATIONS......Page 331
7.6 CHAOTIC PHENOMENA AND A CRYPTOGRAPHY APPLICATION......Page 342
REFERENCES......Page 351
PROBLEMS......Page 352
8.2 PROBLEM STATEMENT AND PRELIMINARIES......Page 360
8.3 LINE SEARCHES......Page 364
8.4 NEWTON’S METHOD......Page 372
8.5 EQUALITY CONSTRAINTS AND LAGRANGE MULTIPLIERS......Page 376
PROBLEMS......Page 383
9.1 INTRODUCTION......Page 388
9.2 TRAPEZOIDAL RULE......Page 390
9.3 SIMPSON’S RULE......Page 397
9.4 GAUSSIAN QUADRATURE......Page 404
9.5 ROMBERG INTEGRATION......Page 412
9.6 NUMERICAL DIFFERENTIATION......Page 420
PROBLEMS......Page 425
10.1 INTRODUCTION......Page 434
10.2 FIRST-ORDER ODEs......Page 440
10.3 SYSTEMS OF FIRST-ORDER ODEs......Page 461
10.4 MULTISTEP METHODS FOR ODEs......Page 474
10.5 VARIABLE-STEP-SIZE (ADAPTIVE) METHODS FOR ODEs......Page 483
10.6 STIFF SYSTEMS......Page 486
APPENDIX 10.A MATLAB CODE FOR EXAMPLE 10.8......Page 488
APPENDIX 10.B MATLAB CODE FOR EXAMPLE 10.13......Page 489
REFERENCES......Page 491
PROBLEMS......Page 492
11.2 REVIEW OF EIGENVALUES AND EIGENVECTORS......Page 499
11.3 THE MATRIX EXPONENTIAL......Page 507
11.4 THE POWER METHODS......Page 517
11.5 QR ITERATIONS......Page 527
REFERENCES......Page 537
PROBLEMS......Page 538
12.2 A BRIEF OVERVIEW OF PARTIAL DIFFERENTIAL EQUATIONS......Page 544
12.3.1 The Vibrating String......Page 547
12.3.2 Plane Electromagnetic Waves......Page 553
12.4 THE FINITE-DIFFERENCE (FD) METHOD......Page 564
12.5 THE FINITE-DIFFERENCE TIME-DOMAIN (FDTD) METHOD......Page 569
APPENDIX 12.A MATLAB CODE FOR EXAMPLE 12.5......Page 576
REFERENCES......Page 579
PROBLEMS......Page 580
13.2 STARTUP......Page 584
13.3 SOME BASIC OPERATORS, OPERATIONS, AND FUNCTIONS......Page 585
13.4 WORKING WITH POLYNOMIALS......Page 590
13.5 LOOPS......Page 591
13.6 PLOTTING AND M-FILES......Page 592
REFERENCES......Page 596
End of Book......Page 598
