Skip to:Content
|
Bottom
Cover image for Numerical methods for engineers and scientists using MATLAB
Title:
Numerical methods for engineers and scientists using MATLAB
Publication Information:
Boca Raton : CRC Press, Taylor & Francis Group, 2013
Physical Description:
xxiii, 526 pages : illustrations ; 24 cm.
ISBN:
9781466585690

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
33000000009030 TA335 E84 2013 Open Access Book Book
Searching...
Searching...
30000010344114 TA335 E84 2013 Open Access Book Book
Searching...

On Order

Summary

Summary

Designed to benefit scientific and engineering applications, Numerical Methods for Engineers and Scientists Using MATLAB®focuses on the fundamentals of numerical methods while making use of MATLAB software. The book introduces MATLAB early on and incorporates it throughout the chapters to perform symbolic, graphical, and numerical tasks. The text covers a variety of methods from curve fitting to solving ordinary and partial differential equations.

Provides fully worked-out examples showing all details Confirms results through the execution of the user-defined function or the script file Executes built-in functions for re-confirmation, when available Generates plots regularly to shed light on the soundness and significance of the numerical results

Created to be user-friendly and easily understandable, Numerical Methods for Engineers and Scientists Using MATLAB®provides background material and a broad introduction to the essentials of MATLAB, specifically its use with numerical methods. Building on this foundation, it introduces techniques for solving equations and focuses on curve fitting and interpolation techniques. It addresses numerical differentiation and integration methods, presents numerical methods for solving initial-value and boundary-value problems, and discusses the matrix eigenvalue problem, which entails numerical methods to approximate a few or all eigenvalues of a matrix. The book then deals with the numerical solution of partial differential equations, specifically those that frequently arise in engineering and science.

The book presents a user-defined function or a MATLAB script file for each method, followed by at least one fully worked-out example. When available, MATLAB built-in functions are executed for confirmation of the results. A large set of exercises of varying levels of difficulty appears at the end of each chapter. The concise approach with strong, up-to-date MATLAB integration provided by this book affords readers a thorough knowledge of the fundamentals of numerical methods utilized in various disciplines.


Author Notes

Dr.Ramin S. Esfandiariis a professor of mechanical and aerospace engineering at California State University, Long Beach. He received his BS in mechanical engineering, as well as his MA and PhD in applied mathematics from the University of California, Santa Barbara. He has authored several books and refereed research papers in high-quality engineering and scientific journals, including Modeling and Analysis of Dynamic Systems (CRC Press, 2010) with Dr. Bei Lu. Dr. Esfandiari has received several teaching and research awards, including two Meritorious Performance and Professional Promise Awards, the TRW Excellence in Teaching and Scholarship Award, and the Distinguished Faculty Teaching Award.


Table of Contents

Prefacep. xvii
Acknowledgmentsp. xxi
Authorp. xxiii
1 Background and Introductionp. 1
1.1 Backgroundp. 1
1.1.1 Differential Equationsp. 1
1.1.1.1 Linear First-Order ODEsp. 2
1.1.1.2 Second-Order ODEs with Constant Coefficientsp. 2
1.1.2 Matrix Analysisp. 5
1.1.2.1 Matrix Operationsp. 5
1.1.2.2 Special Matricesp. 6
1.1.2.3 Determinant of a Matrixp. 6
1.1.2.4 Inverse of a Matrixp. 9
1.1.3 Matrix Eigenvalue Problemp. 10
1.1.3.1 Solving the Eigenvalue Problemp. 11
1.1.3.2 Similarity Transformationp. 12
1.2 Introduction to Numerical Methodsp. 13
1.2.1 Errors and Approximationsp. 13
1.2.1.1 Computational Errorsp. 13
1.2.1.2 Binary and Hexadecimal Numbersp. 14
1.2.1.3 Floating Point and Rounding Errorsp. 15
1.2.1.4 Absolute and Relative Errorsp. 17
1.2.2 Iterative Methodsp. 21
1.2.2.1 A Fundamental Iterative Methodp. 23
1.2.2.2 Rate of Convergence of an Iterative Methodp. 24
Problem Setp. 25
2 Introduction to MATLAB®p. 31
2.1 MATLAB® Built-in Functionsp. 31
2.1.1 Rounding Commandsp. 32
2.1.2 Relational Operatorsp. 32
2.1.3 Format Optionsp. 32
2.2 Vectors and Matricesp. 33
2.2.1 Linspacep. 34
2.2.2 Matricesp. 35
2.2.3 Determinant, Transpose, and Inversep. 37
2.2.4 Slash Operatorsp. 37
2.2.5 Element-by-Element Operationsp. 38
2.3 User-Defined Functions and Script Filesp. 39
2.3.1 Setting Default Values for Input Variablesp. 40
2.3.2 Creating Script Filesp. 41
2.3.3 Anonymous Functionsp. 42
2.3.4 Inlinep. 43
2.4 Program Flow Controlp. 43
2.4.1 for Loopp. 44
2.4.2 if Commandp. 44
2.4.3 while Loopp. 45
2.5 Displaying Formatted Datap. 46
2.6 Symbolic Toolboxp. 47
2.6.1 Differentiationp. 48
2.6.2 Integrationp. 49
2.6.3 Differential Equationsp. 49
2.7 Plottingp. 50
2.7.1 Subplotp. 50
2.7.2 Plotting Analytical Expressionsp. 51
2.7.3 Multiple Plotsp. 52
Problem Setp. 52
3 Solution of Equations of a Single Variablep. 55
3.1 Numerical Solution of Equationsp. 56
3.2 Bisection Methodp. 56
3.2.1 MATLAB® Built-in Function fzerop. 62
3.3 Regula Falsi Method (Method of False Position)p. 62
3.3.1 Modified Regula Falsi Methodp. 65
3.4 Fixed-Point Methodp. 66
3.4.1 Selection of a Suitable Iteration Functionp. 67
3.4.2 A Note on Convergencep. 68
3.4.3 Rate of Convergence of the Fixed-Point Iterationp. 73
3.5 Newton's Method (Newton-Raphson Method)p. 73
3.5.1 Rate of Convergence of Newton's Methodp. 77
3.5.2 A Few Notes on Newton's Methodp. 78
3.5.3 Modified Newton's Method for Roots with Multiplicity 2 or Higherp. 79
3.6 Secant Methodp. 82
3.6.1 Rate of Convergence of Secant Methodp. 84
3.6.2 A Few Notes on Secant Methodp. 84
3.7 Equations with Several Rootsp. 84
3.7.1 Finding Zeros to the Right of a Specified Pointp. 85
3.7.2 Finding Zeros on Two Sides of a Specified Pointp. 87
3.7.3 Using f zero to Find Several Rootsp. 89
3.7.4 Points of Discontinuity Mistaken for Rootsp. 91
Problem Setp. 92
4 Solution of Systems of Equationsp. 99
4.1 Linear Systems of Equationsp. 99
4.2 Numerical Solution of Linear Systemsp. 100
4.3 Gauss Elimination Methodp. 100
4.3.1 Choosing the Pivot Row: Partial Pivoting with Row Scalingp. 102
4.3.2 Permutation Matricesp. 104
4.3.3 Counting the Number of Operationsp. 107
4.3.3.1 Eliminationp. 107
4.3.3.2 Back Substitutionp. 108
4.3.4 Tridiagonal Systemsp. 109
4.3.4.1 Thomas Methodp. 109
4.3.4.2 MATLAB® Built-in Function "\"p. 112
4.4 LU Factorization Methodsp. 112
4.4.1 Doolittle Factorizationp. 113
4.4.1.1 Doolittle's Method to Solve a Linear Systemp. 116
4.4.1.2 Operations Countp. 118
4.4.2 Cholesky Factorizationp. 118
4.4.2.1 Cholesky's Method to Solve a Linear Systemp. 120
4.4.2.2 Operations Countp. 122
4.4.2.3 MATLAB® Built-in Functions lu and cholp. 122
4.5 Iterative Solution of Linear Systemsp. 122
4.5.1 Vector Normsp. 123
4.5.2 Matrix Normsp. 124
4.5.2.1 Compatibility of Vector and Matrix Normsp. 126
4.5.3 General Iterative Methodp. 126
4.5.3.1 Convergence of the General Iterative Methodp. 127
4.5.4 Jacobi Iteration Methodp. 128
4.5.4.1 Convergence of the Jacobi Iteration Methodp. 129
4.5.5 Gauss-Seidel Iteration Methodp. 132
4.5.5.1 Convergence of the Gauss-Seidel Iteration Methodp. 133
4.5.6 Indirect Methods versus Direct Methods for Large Systemsp. 137
4.6 Ill-Conditioning and Error Analysisp. 138
4.6.1 Condition Numberp. 138
4.6.2 Ill-Conditioningp. 139
4.6.2.1 Indicators of Ill-Conditioningp. 140
4.6.3 Computational Errorp. 141
4.6.3.1 Consequences of Ill-Conditioningp. 143
4.6.4 Effects of Parameter Changes on the Solutionp. 144
4.7 Systems of NonLinear Equationsp. 146
4.7.1 Newton's Method for a System of Nonlinear Equationsp. 146
4.7.1.1 Method for Solving a System of Two Nonlinear Equationsp. 146
4.7.1.2 Method for Solving a System of n Nonlinear Equationsp. 150
4.7.1.3 Convergence of Newton's Methodp. 151
4.7.2 Fixed-Point Iteration Method for a System of Nonlinear Equationsp. 152
4.7.2.1 Convergence of the Fixed-Point Iteration Methodp. 152
Problem Setp. 156
5 Curve Fitting (Approximation) and Interpolationp. 175
5.1 Least-Squares Regressionp. 175
5.2 Linear Regressionp. 176
5.2.1 Deciding a "Best" Fit Criterionp. 177
5.2.2 Linear Least-Squares Regressionp. 179
5.3 Linearization of Nonlinear Datap. 182
5.3.1 Exponential Functionp. 182
5.3.2 Power Functionp. 183
5.3.3 Saturation Functionp. 183
5.4 Polynomial Regressionp. 188
5.4.1 Quadratic Least-Squares Regressionp. 190
5.4.2 Cubic Least-Squares Regressionp. 192
5.4.3 MATLAB® Built-in Functions polyfit and polyvalp. 195
5.5 Polynomial Interpolationp. 196
5.5.1 Lagrange Interpolating Polynomialsp. 197
5.5.2 Drawbacks of Lagrange Interpolationp. 200
5.5.3 Newton Divided-Difference Interpolating Polynomialsp. 200
5.5.4 Special Case: Equally Spaced Datap. 203
5.5.5 Newton Forward-Difference Interpolating Polynomialsp. 206
5.6 Spline Interpolationp. 208
5.6.1 Linear Splinesp. 209
5.6.2 Quadratic Splinesp. 210
5.6.2.1 Function Values at the Endpointsp. 210
5.6.2.2 Function Values at the Interior Knotsp. 211
5.6.2.3 First Derivatives at the Interior Knotsp. 211
5.6.2.4 Second Derivative at the Left Endpoint is Zerop. 212
5.6.3 Cubic Splinesp. 213
5.6.4 Construction of Cubic Splines: Clamped Boundary Conditionsp. 215
5.6.5 Construction of Cubic Splines: Free Boundary Conditionsp. 219
5.6.6 MATLAB® Built-in Functions interp1 and splinep. 221
5.6.7 Boundary Conditionsp. 223
5.6.8 Interactive Curve Fitting and Interpolation in MATLAB®p. 224
5.7 Fourier Approximation and Interpolationp. 225
5.7.1 Sinusoidal Curve Fittingp. 225
5.7.2 Linear Transformation of Datap. 227
5.7.3 Discrete Fourier Transformp. 232
5.7.4 Fast Fourier Transformp. 233
5.7.4.1 Sande-Tukey Algorithm (N = 2 p , p = integer)p. 234
5.7.4.2 Cooley-Tukey Algorithm (N=2 p , p = integer)p. 238
5.7.5 MATLAB® Built-in Function fftp. 238
5.7.5.1 Interpolation Using fftp. 238
Problem Setp. 241
6 Numerical Differentiation and Integrationp. 267
6.1 Numerical Differentiationp. 267
6.2 Finite-Difference Formulas for Numerical Differentiationp. 267
6.2.1 Finite-Difference Formulas for the First Derivativep. 268
6.2.1.1 Two-Point Backward Difference Formulap. 268
6.2.1.2 Two-Point Forward Difference Formulap. 269
6.2.1.3 Two-Point Central Difference Formulap. 269
6.2.1.4 Three-Point Backward Difference Formulap. 271
6.2.1.5 Three-Point Forward Difference Formulap. 272
6.2.2 Finite-Difference Formulas for the Second Derivativep. 273
6.2.2.1 Three-Point Backward Difference Formulap. 273
6.2.2.2 Three-Point Forward Difference Formulap. 273
6.2.2.3 Three-Point Central Difference Formulap. 274
6.2.2.4 Summary of Finite-Difference Formulas for First to Fourth Derivativesp. 275
6.2.3 Estimate Improvement: Richardson's Extrapolationp. 275
6.2.4 Derivative Estimates for Nonevenly Spaced Datap. 280
6.2.5 MATLAB® Built-in Functions dif f and polyderp. 281
6.3 Numerical Integration: Newton-Cotes Formulasp. 283
6.3.1 Newton-Cotes Formulasp. 284
6.3.2 Rectangular Rulep. 284
6.3.2.1 Composite Rectangular Rulep. 285
6.3.3 Error Estimate for Composite Rectangular Rulep. 287
6.3.4 Trapezoidal Rulep. 289
6.3.4.1 Composite Trapezoidal Rulep. 290
6.3.4.2 Error Estimate for Composite Trapezoidal Rulep. 291
6.3.5 Simpson's Rulesp. 292
6.3.5.1 Simpson's 1/3 Rulep. 293
6.3.5.2 Composite Simpson's 1/3 Rulep. 294
6.3.5.3 Error Estimate for Composite Simpson's 1/3 Rulep. 295
6.3.5.4 Simpson's 3/8 Rulep. 296
6.3.5.5 Composite Simpson's 3/8 Rulep. 297
6.3.5.6 Error Estimate for Composite Simpson's 3/8 Rulep. 298
6.3.6 MATLAB® Built-in Functions quad and trapzp. 299
6.4 Numerical Integration of Analytical Functions: Romberg Integration, Gaussian Quadraturep. 300
6.4.1 Richardson's Extrapolation, Romberg Integrationp. 301
6.4.1.1 Richardson's Extrapolationp. 301
6.4.1.2 Romberg Integrationp. 304
6.4.2 Gaussian Quadraturep. 306
6.5 Improper Integralsp. 312
Problem Setp. 313
7 Numerical Solution of Initial-Value Problemsp. 329
7.1 One-Step Methodsp. 329
7.2 Euler's Methodp. 330
7.2.1 Error Analysis for Euler's Methodp. 333
7.2.2 Calculation of Local and Global Truncation Errorsp. 333
7.2.3 Higher-Order Taylor Methodsp. 335
7.3 Runge-Kutta Methodsp. 338
7.3.1 Second-Order Runge-Kutta Methodsp. 338
7.3.1.1 Improved Euler's Methodp. 340
7.3.1.2 Heun's Methodp. 340
7.3.1.3 Ralston's Methodp. 340
7.3.1.4 Graphical Representation of Heun's Methodp. 341
7.3.2 Third-Order Runge-Kutta Methodsp. 343
7.3.2.1 Classical RK3 Methodp. 344
7.3.2.2 Heun's RK3 Methodp. 345
7.3.3 Fourth-Order Runge-Kutta Methodsp. 346
7.3.3.1 Classical RK4 Methodp. 347
7.3.3.2 Higher-Order Runge-Kutta Methodsp. 349
7.3.4 Runge-Kutta-Fehlberg Methodp. 350
7.4 Multistep Methodsp. 351
7.4.1 Adams-Bashforth Methodp. 351
7.4.1.1 Second-Order Adams-Bashforth Formulap. 352
7.4.1.2 Third-Order Adams-Bashforth Formulap. 353
7.4.1.3 Fourth-Order Adams-Bashforth Formulap. 353
7.4.2 Adams-Moulton Methodp. 354
7.4.2.1 Second-Order Adams-Moulton Formulap. 354
7.4.2.2 Third-Order Adams-Moulton Formulap. 355
7.4.2.3 Fourth-Order Adams-Moulton Formulap. 355
7.4.3 Predictor-Corrector Methodsp. 355
7.4.3.1 Heun's Predictor-Corrector Methodp. 356
7.4.3.2 Adams-Bashforth-Moulton Predictor-Corrector Methodp. 357
7.5 Systems of Ordinary Differential Equationsp. 360
7.5.1 Transformation into a System of First-Order ODEsp. 360
7.5.1.1 State Variablesp. 360
7.5.1.2 Notationp. 360
7.5.1.3 State-Variable Equationsp. 360
7.5.2 Numerical Solution of a System of First-Order ODEsp. 363
7.5.2.1 Euler's Method for Systemsp. 363
7.5.2.2 Heun's Method for Systemsp. 366
7.5.2.3 Classical RK4 Method for Systemsp. 368
7.6 Stabilityp. 371
7.6.1 Euler's Methodp. 371
7.6.2 Euler's Implicit Methodp. 372
7.7 Stiff Differential Equationsp. 374
7.8 MATLAB® Built-in Functions for Initial-Value Problemsp. 376
7.8.1 Nonstiff Equationsp. 376
7.8.1.1 Single First-Order IVPp. 376
7.8.1.2 Setting ODE Solver Optionsp. 378
7.8.1.3 System of First-Order IVPsp. 379
7.8.2 Stiff Equationsp. 380
Problem Setp. 382
8 Numerical Solution of Boundary-Value Problemsp. 401
8.1 Shooting Methodp. 402
8.2 Finite-Difference Methodp. 408
8.3 BVPs with Mixed Boundary Conditionsp. 413
8.4 MATLAB® Built-in Function bvp4c for BVPsp. 417
8.4.1 Second-Order BVPp. 417
Problem Setp. 422
9 Matrix Eigenvalue Problemp. 429
9.1 Power Method: Estimation of the Dominant Eigenvaluep. 429
9.1.1 Inverse Power Method: Estimation of the Smallest Eigenvaluep. 434
9.1.2 Shifted Inverse Power Method: Estimation of the Eigenvalue Nearest a Specified Valuep. 434
9.1.2.1 Shifted Power Methodp. 437
9.1.3 MATLAB® Built-in Function eigp. 439
9.2 Deflation Methodsp. 440
9.2.1 Wielandt's Deflation Methodp. 440
9.2.1.1 Deflation Processp. 441
9.3 Householder Tridiagonalization and QR Factorization Methodsp. 444
9.3.1 Householder's Tridiagonalization Method (Symmetric Matrices)p. 445
9.3.1.1 Determination of Symmetric Orthogonal P k (k = 1,2,..., n-2)p. 446
9.3.2 QR Factorization Methodp. 449
9.3.2.1 Determination of Q k and R k Matricesp. 450
9.3.2.2 Structure of L k (k = 2,3,..., n)p. 451
9.3.2.3 MATLAB® Built-in Function qrp. 452
9.3.3 Transformation to Hessenberg Form (Nonsymmetric Matrices)p. 456
Problem Setp. 457
10 Numerical Solution of Partial Differential Equationsp. 463
10.1 Introductionp. 463
10.2 Elliptic PDEsp. 464
10.2.1 Dirichlet Problemp. 464
10.2.2 Alternating Direction-Implicit Methodsp. 469
10.2.2.1 Peaceman-Rachford Alternating Direction-Implicit Methodp. 470
10.2.3 Neumann Problemp. 476
10.2.3.1 Existence of Solution for Neumann Problemp. 478
10.2.4 Mixed Problemp. 479
10.2.5 More Complex Regionsp. 480
10.3 Parabolic PDEsp. 483
10.3.1 Finite-Difference (FD) Methodp. 483
10.3.1.1 Stability and Convergence of the FD Methodp. 485
10.3.2 Crank-Nicolson (CN) Methodp. 487
10.3.2.1 CN Method versus FD Methodp. 491
10.4 Hyperbolic PDEsp. 493
10.4.1 Starting the Procedurep. 494
Problem Setp. 498
Bibliographyp. 511
Indexp. 513
Go to:Top of Page