Introduction To Scientific Computing - Couverture souple

Van Loan, Charles-F

Couverture souple

ISBN 10 : 0139491570 ISBN 13 : 9780139491573

Editeur : Pearson, 1999

Synopsis

Introduction to Scientific Computing Intended for one-semester courses in Numerical Methods in computer science and engineering programs, and Numerical Analysis courses in mathematics programs. This text covers various topics that are usually covered in an introduction to scientific computing.

A propos du livre

Quatrième de couverture

Unique in content and approach, this piece covers all the topics that are usually covered in an introduction to scientific computing—but folds in graphics and matrix-vector manipulation in a way that gets readers to appreciate the connection between continuous mathematics and computing. Matlab 5 is used throughout to encourage experimentation, and each chapter focuses on a different important theorem—allowing users to appreciate the rigorous side of scientific computing. In addition to standard topical coverage, each chapter includes 1) a sketch of a "hard" problem that involves ill-conditioning, high dimension, etc.; 2) at least one theorem with both a rigorous proof and a "proof by MATLAB" experiment to bolster intuition; 3) at least one recursive algorithm; and 4) at least one connection to a real-world application.

FEATURES/BENEFITS

• NEW—Upgraded to a MATLAB 5 level.
• NEW—Approximately 60 new problems.,
• NEW—New sections on structure arrays, cell arrays, and how to produce more informative plots (Ch. 1).
• NEW—A brief treatment of trigonometric interpolation (Ch. 2)—A follow-up FFT solution to the problem is provided in Ch. 5).
• NEW—A brief discussion of sparse arrays (Ch. 5).
  • Permits a limited study of sparse methods for linear equations and least squares in Chs. 6 and 7.
• NEW—Block matrix material—Now enriched with the use of cell arrays (Chs. 6-7).
• NEW—Orbit problem solutions—Now make use of simple structures (Ch. 8).
  • Simplifies the presentation.
• NEW—More detailed coverage of "ode23" (Ch. 9).
• NEW—Website—Provides solutions to half the problems.
  • Additional coverage of graphics.
• Numerical linear algebra—Permeates the entire presentation, beginning in Ch. 1. (This is a get-started-with-MATLAB tutorial, but is driven by examples that set the stage for the numerical algorithms that follow.)
• One important theorem covered per chapter.
  • Motivational examples and related homework problems using MATLAB.
    • Allows users to get a personal feel for algorithm strengths and weaknesses without the distraction of debugging the syntax of a compiled higher level language.
  • An abundance of examples, packaged in 200+ M-files—The book revolves around examples that are packaged in 200+ M-files, which, collectively, communicate all the key mathematical ideas and an appreciation for the subtleties of numerical computing.
  • Snapshots of advanced computing—In sections that deal with parallel adaptive quadrature and parallel matrix computations. Treatment of recursion includes divided differences, adaptive approximation, quadrature, the fast Fourier transform, Strassen matrix multiplication, and the Cholesky factorization.

Présentation de l'éditeur

For one-semester courses in Numerical Methods in computer science and engineering programs, and Numerical Analysis courses in mathematics programs.

Unique in content and approach, this text covers all the topics that are usually covered in an introduction to scientific computing—but folds in graphics and matrix-vector manipulation in a way that gets students to appreciate the connection between continuous mathematics and computing.Matlab 5 is used throughout to encourage experimentation, and each chapter focuses on a different important theorem—allowing students to appreciate the rigorous side of scientific computing. In addition to standard topical coverage, each chapter includes 1) a sketch of a “hard” problem that involves ill-conditioning, high dimension, etc.; 2)  at least one theorem with both a rigorous proof and a “proof by MATLAB” experiment to bolster intuition; 3) at least one recursive algorithm; and 4) at least one connection to a real-world application. The text is brief and clear enough for introductory numerical analysis students to “get their feet wet,” yet comprehensive enough in its treatment of problems and applications for higher-level students to develop a deeper grasp of numerical tools.

Détails de l'édition

• Éditeur: Pearson
• Date d'édition: 1999
• ISBN 10: 0139491570
• ISBN 13: 9780139491573
• Reliure: Broché
• Langue: anglais
• Numéro d'édition: 2
• Nombre de pages: 367