A rigorous and comprehensive introduction to numerical analysis Numerical Methods provides a clear and concise exploration of standard numerical analysis topics, as well as nontraditional ones, including mathematical modeling, Monte Carlo methods, Markov chains, and fractals. Filled with appealing examples that will motivate students, the textbook considers modern application areas, such as information retrieval and animation, and classical topics from physics and engineering. Exercises use MATLAB and promote understanding of computational results. The book gives instructors the flexibility to emphasize different aspects—design, analysis, or computer implementation—of numerical algorithms, depending on the background and interests of students. Designed for upper-division undergraduates in mathematics or computer science classes, the textbook assumes that students have prior knowledge of linear algebra and calculus, although these topics are reviewed in the text. Short discussions of the history of numerical methods are interspersed throughout the chapters. The book also includes polynomial interpolation at Chebyshev points, use of the MATLAB package Chebfun, and a section on the fast Fourier transform. Supplementary materials are available online. Clear and concise exposition of standard numerical analysis topics Explores nontraditional topics, such as mathematical modeling and Monte Carlo methods Covers modern applications, including information retrieval and animation, and classical applications from physics and engineering Promotes understanding of computational results through MATLAB exercises Provides flexibility so instructors can emphasize mathematical or applied/computational aspects of numerical methods or a combination Includes recent results on polynomial interpolation at Chebyshev points and use of the MATLAB package Chebfun Short discussions of the history of numerical methods interspersed throughout Supplementary materials available online

This book is written for engineers and other practitioners using numerical methods in their work and serves as a textbook for courses in applied mathematics and numerical analysis.

Elementary yet rigorous, this concise treatment is directed toward students with a knowledge of advanced calculus, basic numerical analysis, and some background in ordinary differential equations and linear algebra. 1968 edition.

On the occasion of this new edition, the text was enlarged by several new sections. Two sections on B-splines and their computation were added to the chapter on spline functions: Due to their special properties, their flexibility, and the availability of well-tested programs for their computation, B-splines play an important role in many applications. Also, the authors followed suggestions by many readers to supplement the chapter on elimination methods with a section dealing with the solution of large sparse systems of linear equations. Even though such systems are usually solved by iterative methods, the realm of elimination methods has been widely extended due to powerful techniques for handling sparse matrices. We will explain some of these techniques in connection with the Cholesky algorithm for solving positive definite linear systems. The chapter on eigenvalue problems was enlarged by a section on the Lanczos algorithm; the sections on the LR and QR algorithm were rewritten and now contain a description of implicit shift techniques. In order to some extent take into account the progress in the area of ordinary differential equations, a new section on implicit differential equa tions and differential-algebraic systems was added, and the section on stiff differential equations was updated by describing further methods to solve such equations.

The method of least squares was discovered by Gauss in 1795. It has since become the principal tool to reduce the influence of errors when fitting models to given observations. Today, applications of least squares arise in a great number of scientific areas, such as statistics, geodetics, signal processing, and control. In the last 20 years there has been a great increase in the capacity for automatic data capturing and computing. Least squares problems of large size are now routinely solved. Tremendous progress has been made in numerical methods for least squares problems, in particular for generalized and modified least squares problems and direct and iterative methods for sparse problems. Until now there has not been a monograph that covers the full spectrum of relevant problems and methods in least squares. This volume gives an in-depth treatment of topics such as methods for sparse least squares problems, iterative methods, modified least squares, weighted problems, and constrained and regularized problems. The more than 800 references provide a comprehensive survey of the available literature on the subject.

Python Programming and Numerical Methods: A Guide for Engineers and Scientists introduces programming tools and numerical methods to engineering and science students, with the goal of helping the students to develop good computational problem-solving techniques through the use of numerical methods and the Python programming language. Part One introduces fundamental programming concepts, using simple examples to put new concepts quickly into practice. Part Two covers the fundamentals of algorithms and numerical analysis at a level that allows students to quickly apply results in practical settings. Includes tips, warnings and "try this" features within each chapter to help the reader develop good programming practice Summaries at the end of each chapter allow for quick access to important information Includes code in Jupyter notebook format that can be directly run online