Computational Science and Engineering
Will be published approx. on 1. November 2007
Book
Hardback
750 pages
978-0-9614088-1-7 (ISBN)
Description
Encompasses the full range of computational science and engineering from modelling to solution, both analytical and numerical. It develops a framework for the equations and numerical methods of applied mathematics. Gilbert Strang has taught this material to thousands of engineers and scientists (and many more on MIT's OpenCourseWare 18.085-6). His experience is seen in his clear explanations, wide range of examples, and teaching method. The book is solution-based and not formula-based: it integrates analysis and algorithms and MATLAB codes to explain each topic as effectively as possible. The topics include applied linear algebra and fast solvers, differential equations with finite differences and finite elements, Fourier analysis and optimization. This book also serves as a reference for the whole community of computational scientists and engineers. Supporting resources, including MATLAB codes, problem solutions and video lectures from Gilbert Strang's 18.085 courses at MIT, are provided at math.mit.edu/cse.
More details
Language
English
Place of publication
Wellesley
United States
Target group
College/higher education
Professional and scholarly
Dimensions
Height: 264 mm
Width: 200 mm
Thickness: 40 mm
Weight
1470 gr
ISBN-13
978-0-9614088-1-7 (9780961408817)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Person
Gilbert Strang received his Ph.D. from UCLA and since then he has taught at MIT. He has been a Sloan Fellow and a Fairchild Scholar and is a Fellow of the American Academy of Arts and Sciences. He is a Professor of Mathematics at MIT and an Honorary Fellow of Balliol College. Professor Strang has published eight textbooks. He received the von Neumann Medal of the US Association for Computational Mechanics, and the Henrici Prize for applied analysis. The first Su Buchin Prize from the International Congress of Industrial and Applied Mathematics, and the Haimo Prize from the Mathematical Association of America, were awarded for his contributions to teaching around the world.
Content
1. Applied Linear Algebra: 1.1 Four special matrices; 1.2 Differences, derivatives, and boundary conditions; 1.3 Elimination leads to K = LDL^T; 1.4 Inverses and delta functions; 1.5 Eigenvalues and eigenvectors; 1.6 Positive definite matrices; 1.7 Numerical linear algebra: LU, QR, SVD; 1.8 Best basis from the SVD; 2. A Framework for Applied Mathematics: 2.1 Equilibrium and the stiffness matrix; 2.2 Oscillation by Newton's law; 2.3 Least squares for rectangular matrices; 2.4 Graph models and Kirchhoff's laws; 2.5 Networks and transfer functions; 2.6 Nonlinear problems; 2.7 Structures in equilibrium; 2.8 Covariances and recursive least squares; 2.9 Graph cuts and gene clustering; 3. Boundary Value Problems: 3.1 Differential equations of equilibrium; 3.2 Cubic splines and fourth order equations; 3.3 Gradient and divergence; 3.4 Laplace's equation; 3.5 Finite differences and fast Poisson solvers; 3.6 The finite element method; 3.7 Elasticity and solid mechanics; 4. Fourier Series and Integrals: 4.1 Fourier series for periodic functions; 4.2 Chebyshev, Legendre, and Bessel; 4.3 The discrete Fourier transform and the FFT; 4.4 Convolution and signal processing; 4.5 Fourier integrals; 4.6 Deconvolution and integral equations; 4.7 Wavelets and signal processing; 5. Analytic Functions: 5.1 Taylor series and complex integration; 5.2 Famous functions and great theorems; 5.3 The Laplace transform and z-transform; 5.4 Spectral methods of exponential accuracy; 6. Initial Value Problems: 6.1 Introduction; 6.2 Finite difference methods for ODEs; 6.3 Accuracy and stability for u_t = c u_x; 6.4 The wave equation and staggered leapfrog; 6.5 Diffusion, convection, and finance; 6.6 Nonlinear flow and conservation laws; 6.7 Fluid mechanics and Navier-Stokes; 6.8 Level sets and fast marching; 7. Solving Large Systems: 7.1 Elimination with reordering; 7.2 Iterative methods; 7.3 Multigrid methods; 7.4 Conjugate gradients and Krylov subspaces; 8. Optimization and Minimum Principles: 8.1 Two fundamental examples; 8.2 Regularized least squares; 8.3 Calculus of variations; 8.4 Errors in projections and eigenvalues; 8.5 The Saddle Point Stokes problem; 8.6 Linear programming and duality; 8.7 Adjoint methods in design.