01 / Reading Guide
Reading Guide
Citation
Kreyszig, E. (2011). Advanced Engineering Mathematics (10th ed.). John Wiley & Sons.
Chapter Summary
The book has 25 chapters in seven parts (A to G), followed by five appendices: references, answers to odd-numbered problems, auxiliary material, additional proofs and tables. Each chapter ends with review questions and problems and a short summary of the chapter. The part and chapter openers state what the chapter needs and which sections can be dropped in a shorter course; Chapter 1, for example, lists integral calculus as its prerequisite and marks Sections 1.6 and 1.7 as omittable.
Part A: Ordinary Differential Equations (Chapters 1–6)
Part A opens the book with two stated aims: the main methods for solving ordinary differential equations and the practice of modeling, that is, turning a physical situation into a mathematical model. Chapter 1, First-Order ODEs, runs from basic concepts and modeling through direction fields and Euler's method, separable and exact equations, linear equations and the Bernoulli equation, orthogonal trajectories (optional) and existence and uniqueness. Chapter 2, Second-Order Linear ODEs, covers homogeneous and nonhomogeneous equations, the Wronskian and variation of parameters, with modeling sections on free and forced oscillations, resonance and electric circuits. Chapter 3 extends these results to higher order. Chapter 4, Systems of ODEs. Phase Plane. Qualitative Methods, begins with a reference section on matrices and vectors and then treats the phase plane, critical points and stability. Chapter 5, Series Solutions of ODEs. Special Functions, covers the power series and Frobenius methods and Legendre and Bessel functions. Chapter 6, Laplace Transforms, treats the transform, shifting theorems, the unit step and Dirac delta, convolution, systems of ODEs and a table of transforms.
Part B: Linear Algebra. Vector Calculus (Chapters 7–10)
Chapter 7, Linear Algebra: Matrices, Vectors, Determinants. Linear Systems, covers matrix operations, Gauss elimination, rank, determinants, inverses and, as an optional section, vector spaces and linear transformations. Chapter 8 is devoted to matrix eigenvalue problems, including symmetric, skew-symmetric and orthogonal matrices, diagonalization and quadratic forms. Chapters 9 and 10 turn to vector differential calculus (grad, div, curl; curves, arc length, curvature and torsion) and vector integral calculus (line and surface integrals, Green's theorem, the divergence theorem of Gauss and Stokes's theorem).
Part C: Fourier Analysis. Partial Differential Equations (Chapters 11–12)
Chapter 11 develops Fourier series, forced oscillations, Sturm–Liouville problems and orthogonal series, the Fourier integral and the cosine, sine and Fourier transforms, including the discrete and fast Fourier transforms. Chapter 12 applies these tools to the wave, heat and Laplace equations, with separation of variables, d'Alembert's solution, rectangular and circular membranes and solution of PDEs by Laplace transforms.
Part D: Complex Analysis (Chapters 13–18)
Six chapters cover complex numbers and complex differentiation (Cauchy–Riemann equations, elementary functions), complex integration (Cauchy's integral theorem and formula), power series and Taylor series (uniform convergence is optional), Laurent series and residue integration, conformal mapping (Riemann surfaces optional) and complex analysis applied to potential theory in electrostatics, heat problems and fluid flow.
Part E: Numeric Analysis (Chapters 19–21)
A software note opens the part. Chapter 19, Numerics in General, covers iteration for equations, interpolation, splines, and numeric integration and differentiation. Chapter 20 treats numeric linear algebra: Gauss elimination, LU-factorization, iterative methods, ill-conditioning and norms, least squares, and methods for eigenvalues. Chapter 21 covers numerical methods for ODEs and PDEs. Part A's opener points out that Sections 21.1–21.3 (ODE methods) are written to be read directly after Chapter 1 or 2.
Part F: Optimization, Graphs (Chapters 22–23)
Chapter 22 covers unconstrained optimization by steepest descent, linear programming and the simplex method with its difficulties. Chapter 23 covers graphs and digraphs, shortest-path problems, Dijkstra's algorithm, spanning trees, network flows and the Ford–Fulkerson algorithm, and bipartite graphs and assignment problems.
Part G: Probability, Statistics (Chapters 24–25)
Chapter 24, Data Analysis. Probability Theory, runs from data representation through probability, random variables, the binomial, Poisson, hypergeometric and normal distributions, to distributions of several random variables. Chapter 25, Mathematical Statistics, covers estimation, confidence intervals, hypothesis testing, quality control and acceptance sampling, the chi-square goodness-of-fit test, nonparametric tests, and regression and correlation.
Key Concepts
Part A: Ordinary Differential Equations
- Mathematical modeling: setting up an equation from a physical situation, solving it and interpreting the result, the activity Part A names as one of its two aims.
- Direction field and Euler's method: a graphical and a numerical way to follow solutions of y' = f(x, y) without solving it.
- Phase plane and critical points: the qualitative picture of a system of ODEs, with criteria for stability.
- Laplace transform: a transform that turns ODEs and systems into algebraic problems, with the step function and Dirac delta handling discontinuous inputs.
Parts B and C: Linear Algebra, Vector Calculus, Fourier Analysis and PDEs
- Eigenvalue problem: finding vectors a matrix only stretches, the basis of diagonalization and quadratic forms.
- Divergence theorem and Stokes's theorem: the integral theorems of Chapter 10 that connect surface and volume or boundary integrals.
- Fourier series, integral and transform: expansions of periodic and nonperiodic functions used to solve the PDEs of Chapter 12.
- Separation of variables: the standard route to solutions of the wave, heat and Laplace equations.
Parts D to G
- Residue integration: evaluating complex and real integrals from the singularities of a function.
- Conformal mapping: angle-preserving maps used for potential problems.
- Numeric linear algebra: LU-factorization, iterative solution, norms and conditioning, and eigenvalue methods.
- Simplex method: the standard algorithm for linear programming.
- Hypothesis testing and regression: the main inference tools of Chapter 25.
Critical Analysis
Strengths
- Breadth in one volume. The contents run from ODEs and linear algebra through PDEs, complex analysis, numerics, optimization and statistics, so one book can serve several engineering mathematics courses. Wiley's description presents the tenth edition as adding more detailed examples and more applied exercises.
- Built to be read selectively. Openers give prerequisites and list sections that may be omitted, some sections are labelled optional or "for reference" (4.0 on matrices and vectors, 7.6 on determinants, the calculus reviews in 9.6 and 10.3), and the numerics sections for ODEs are written to be read early. Instructors and self-learners can therefore cut a path.
- Modeling is built in. Titles such as "Modeling: Free Oscillations", "Modeling: Forced Oscillations. Resonance", "Modeling: Electric Circuits" and "Modeling: Membrane, Two-Dimensional Wave Equation" show the physical setup being treated as part of the mathematics.
- Practice and checking. The first chapter, which Wiley publishes as a sample, has problem sets, modeling problems, Euler's-method problems and CAS projects, and ends with review questions and a summary. Answers to odd-numbered problems are in Appendix 2.
Limitations
- Breadth over depth. Seven areas share about 1,260 pages in the print edition: probability and statistics, for instance, take two chapters and numerics three. Readers who need a full course in any one subject, such as statistics or numerical analysis, will likely want a dedicated text as well.
- Dependencies between chapters. Parts are not fully self-contained: Chapter 12 solves PDEs with the Fourier series of Chapter 11 and, in Section 12.12, the Laplace transforms of Chapter 6. Students who jump in need to follow the prerequisites in the chapter openers.
- Edition and format variants. The tenth edition appears in several forms: the Wiley India edition lists 1,148 pages and a contents list that stops at Part F, while Google Books and Wiley's e-text listing give 1,264 and 1,280 pages. Check that a copy includes Part G if probability and statistics matter.
Where It Fits in the Course
Kreyszig is the broad second-level reference in this course list. Two books prepare for it from the start: Stroud's Engineering Mathematics is a self-paced programmed text running from foundation algebra to Laplace transforms, and Croft and Davison's Mathematics for Engineers is a first-year text that builds from arithmetic and algebra to calculus, matrices, complex numbers and differential equations. A student who is not yet fluent in calculus should work through one of these first.
Beside Kreyszig sits James and colleagues' Advanced Modern Engineering Mathematics, which, according to its publisher, builds on a first-year companion text and spreads its twelve chapters over matrix analysis, numerical ODEs, vector calculus, one complex-variable chapter, Laplace and z transforms, Fourier methods, PDEs, optimization and probability and statistics. Kreyszig gives complex analysis six chapters and ODE solution methods their own part; James adds the z transform. Beyond both, Riley, Hobson and Bence's Mathematical Methods for Physics and Engineering extends into Green's functions, variational calculus, tensors and group theory, and Bender and Orszag's volume on asymptotic methods and perturbation theory is a graduate text for approximate analytical solutions.
How to Use This Book
Wiley's description addresses engineers and computer scientists meeting advanced mathematics through practical problems. The book suits students who have completed a calculus sequence and need the standard methods of mathematical modeling. Chapter 1 asks only for integral calculus; later parts, especially the vector, Fourier and complex chapters, assume the earlier ones.
A practical plan is to treat it as a companion to specific courses rather than a book to read straight through:
- Core for most engineering courses: Chapters 1–2 and 6 (ODEs and Laplace transforms), 7–8 (matrices and eigenvalues), 9–10 (vector calculus) and 11–12 (Fourier methods and PDEs).
- When needed: Chapters 3–5 for higher-order equations, systems and special functions; Chapters 13–18 for a complex analysis course or potential-theory applications; Chapters 19–21 for numerical methods, with 21.1–21.3 usable right after Chapter 1 or 2; Chapters 22–23 and 24–25 for optimization and statistics.
- Skip on a first pass: sections marked optional, such as 1.6, 2.3, 7.9, 8.5, 15.5 and 17.5.
Work the examples first, try a CAS only to check hand solutions (the opening chapter itself recommends this), and use the end-of-chapter summaries and review questions for revision.
